This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| A Whirlwind Tour of Combinatorial Games in Haskell | |
| ================================================== | |
| Combinatorial games are an interesting class of games where two | |
| players take turns to make a move, changing the game from one position | |
| to another. In these games, both players have perfect information | |
| about the state of the game and there is no element of chance. In | |
| 'normal play', the winner is declared when the other player is unable | |
| to move. A lot of famous strategy games can be analysed as | |
| combinatorial games: chess, go, tic-tac-toe. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| {------------------------------------------------ | |
| A Haskell solution to: http://www.coinheist.com/rubik/a_regular_crossword/grid.pdf | |
| using the Z3 SMT solver. | |
| Z3 finds the following solution in about 7 mins | |
| on my Mac Core-i5, and another 7 mins to prove | |
| it's unique. | |
| NHPEHAS | |
| DIOMOMTH |