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

From HaskellWiki
Jump to: navigation, search
Line 1: Line 1:
 
==list handling vs. abstract data types (array)==
 
==list handling vs. abstract data types (array)==
  +
Lists are very inefficient, but understanding list handling is important for understanding functional programming. On the other hand, using <hask>Array</hask> would provide understanding for abstract data types.
  +
   
 
==full ruleset vs. reduced and simplified ruleset==
 
==full ruleset vs. reduced and simplified ruleset==
for full ruleset you have to remember and consider previous states (castling rule and capturing en passant)
+
To implement the full ruleset you have to remember and consider previous states (in particular for castling rule and capturing en passant).
   
 
==representation of positions==
 
==representation of positions==

Revision as of 08:48, 19 March 2007

list handling vs. abstract data types (array)

Lists are very inefficient, but understanding list handling is important for understanding functional programming. On the other hand, using Array would provide understanding for abstract data types.


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

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