Talk:Learning Haskell with Chess

From HaskellWiki
Revision as of 08:46, 19 March 2007 by Smazanek (talk | contribs)
Jump to: navigation, search

list handling vs. abstract data types (array)

full ruleset vs. reduced and simplified ruleset

for full ruleset you have to remember and consider previous states (castling rule and capturing en passant)

representation of positions

Is type Pos = (Int,Int) ok? Or better something like type Pos = (Row, Column), data Row = A | B | ... | H, data Column = ?. How to model the constraints (0<=x,y<=7)?