God's Algorithm

God's algorithm is a way to solve puzzles and games using the least possible number of moves, the idea being that an omniscient being would know an optimal step from any given configuration. God's algorithm is essentially the most efficient strategy for any given game, one that cannot be improved upon in any way. The solutions to the recently posted river crossing puzzles are an example.

Tic-tac-toe and Tower of Hanoi are all examples of games with simple God's algorithms. Most children figure out the ideal strategy themselves pretty quickly. One of the reasons children like these games is once they figure out the optimal strategy, no one has an edge on them--not adults, not their parents, not their teachers. They are 'experts' at the game. In fact, someone who knows the God's algorithm for a game could best God himself in a fair match. Even the eyes of God see no more to a game of tic-tac-toe than a capable player. This has lead to a wealth of fiction where supernatural beings are bested by humans in games of strategy and chance.

God's algorithms have been suggested for Rubick's cubes, chess, Irensei and Go. Theoretically any game with perfect information should have a God's algorithim solution. A game is said to have perfect information if all players know all moves that have taken place. For instance, on a chessboard there are no secrets. You and your opponent can see all of the pieces on the board at all times. By contrast, poker is a game with imperfect information since you can neither see your opponent's cards nor know which cards will come out the deck next.