Skip to content

Latest commit

 

History

1 Commit

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 

About

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.

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages