Ask your own question, for FREE!
Computer Science 17 Online
Macho14:

In chess, a king can move one square in any direction (horizontally, vertically, or diagonally). How many ways are there to put 8 kings in an 8×8 checkerboard such that no two kings can place each other in check in one move?

Macho14:

119138166 is the number of ways. I created a short C++ script to check this answer but I need someone to verify.

Macho14:

omg, noobs

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!