Avoid impossible states with a data model for a card game in Haskell

Published: 14/02/2020
Avoid impossible states with a data model for a card game in Haskell
Source: STACKOVERFLOW.COM

I am trying to implement the Jass card game in Haskell and would like to make the game state as explicit as possible or avoiding impossible states with types. The standard variant involves four players. The players opposite each other form a team. In a game rounds are played until one team reaches the target score. At the start of each round each player is dealt with 9 cards one player gets to cho

Read more
Related news
Comment
FACEBOOK