Editing Talk:Learning Haskell with Chess (section)

==full ruleset vs. reduced and simplified ruleset==
To implement the full ruleset you have to remember and consider previous states (in particular for castling rule and capturing en passant).

-- Actually, this isn't so bad to do. It's entirely possibly by simply checking and updating flags. A single Int with a few bit masks could easily do it. One thing to consider as far as what needs to be encoded in any given position to be able to determine all legal moves is the FEN specification for representing moves: [[http://www.very-best.de/pgn-spec.htm#16]] -- Andrew Wagner.