Difference between revisions of "Talk:Learning Haskell with Chess"

From HaskellWiki
Jump to: navigation, search
(lists vs. adt array)
 
Line 1: Line 1:
Learning list handling vs. abstract data types (array)
+
==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 <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)?

Revision as of 08:46, 19 March 2007

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)?