You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In a given nxn checkerboard, each square can be one of four different colored squares. The goal is to arrange the colors on the checkerboard so that there are no two adjacent squares horizontally or vertically, using the Hill Climbing algorithm. Diagonal squares can be of the same color.