See rules. This is a very toned down version of the game, without the companion cards as that reduces the state space by a lot (since all house cards can be treated as identical)
Card lists can be found at the following 2 images:
- Shuffle the following string: SSSSSSSSGGGGGGGLLLLLLTTTTTBBBBYYYUUV
- Fit it into a 6x6 grid
- Check for valid moves (Max = 10) from (5 in east/west and 5 in north/south directions).
- Declare for a house and move Varys to the corresponding character. This must be the farthest card for that house in that direction.
- Collect the card, and gain the banner token for that house if you have the highest number of cards for that House (This can be made simpler by giving you the token if you have a proven majority)
If there are no legal moves left in the game, check number of tokens held by each player. Highest banner token player wins.
This is a learning experiment for Monte Carlo Tree Search. I picked this game because:
- It is a perfect information game
- Lookahead is a crucial part of the gameplay
- A reduced set of the game (no companion cards) is easily understandable
I am using https://jeffbradberry.com/posts/2015/09/intro-to-monte-carlo-tree-search/ as a base reference for the MCTS and the data structure implementatio
All code is licensed under MIT License