Editing Talk:Learning Haskell with Chess (section)

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

-- There are several ways to handle this. Much work has been done in figuring out what the best way is, but I'll just point you to the first two articles at [[http://www.cis.uab.edu/hyatt/pubs.html]] I should point out that the theory behind using bitboards has advanced significantly since those articles were written, and I would strongly recommend looking at that. -- Andrew Wagner

-- Andrew, thank you for this link. The facts there strongly apply to imperative programming, however, I cannot see how to transfer these practices to functional programming without getting the fingers too dirty. -- Steffen Mazanek

-- I'm not quite sure what you see there that's inherently imperative. In fact, the whole point of bitboards is to get rid of loops as much as possible, which should please the functional programmer greatly. Can you possibly clarify? -- Andrew