The Haskell Unfolder Episode 32: solving tic-tac-toe
In this episode, which is suitable for Haskell beginners, we don't focus on a specific Haskell programming technique, but instead try to develop an implementation of a simple game from scratch: tic-tac-toe. After having implemented the rules, we will show how to actually solve the game and allow optimal play by producing a complete game tree and using a naive minimax algorithm for evaluating states.
Resources:
xkcd on tic-tac-toe: https://xkcd.com/832/
Tic-tac-toe on Wikipedia: https://en.wikipedia.org/wiki/Tic-tac...
GitHub repository with code for the episodes: https://github.com/well-typed/unfolder