https://github.com/jcla1/parity-solver

Pathfinder for Parity in Haskell, the game at: http://www.abefehr.com/parity/
https://github.com/jcla1/parity-solver

Last synced: about 1 month ago
JSON representation

Pathfinder for Parity in Haskell, the game at: http://www.abefehr.com/parity/

• Host: GitHub
• URL: https://github.com/jcla1/parity-solver
• Owner: jcla1
• License: mit
• Created: 2015-01-17T21:43:47.000Z (almost 10 years ago)
• Default Branch: master
• Last Pushed: 2015-01-24T16:31:47.000Z (almost 10 years ago)
• Last Synced: 2024-04-14T15:48:43.034Z (9 months ago)
• Language: Haskell
• Homepage:
• Size: 332 KB
• Stars: 6
• Watchers: 4
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# parity-solver

Parity is a recently published game in which you try to get the numbers in all squares of the playing-board equal, you can increase the number in a particular square by moving the "selector" onto it (using the arrow keys). You can find the game at: http://www.abefehr.com/parity/

This Haskell program models the game and, via the Data.Graph.AStar package, tries to find the optimal path through it. The graph it searches is composed of the individual GameStates (which are made up of the current position of the "selector" and the board, which in turn can be either a StdBoard or a Board containing both black & white squares) as the vertices and up, down, left and right moves as the edges.

Feedback on performance and style improvements are greatly appreciated!