DSA Hex Game

A fast-paced turn-based game with several advanced algorithms to verse.

This is a C++ implementation of the traditional Hex board game as seen on lutanho.net. This was my sibmission for the first assignment in Data Structures & Algorithms at WSU. Although the game itself is simple, it includes pathfinding and game playing algorithms such as A*, Minimax (with alpha-beta pruning), and Monte-Carlo which have vastly different strategies.

New Algorithms / Contributing

Pull requests are welcome. As with all my projects, I am constantly on the lookout to add to the collection of algorithms, especially if they outperform all the others. If you can get the minimax working more efficiently I would love to learn how. If you know of an algorithm then I'd love to hear from you, and if you want to have a go at improving my work then by all means do so, I'd love to learn how I can do better with performance, design patterns, and more.

For major changes, please open an issue first to discuss what you would like to change.

License

GNU General Public License v3.0

References

• A* Algorithm

• Minimax

• Alpha-Beta Pruning

• lamesjim's Minimax in Chess

• WY Fok's write-up on Crooks Algorithm (my original source)

• Cornell's page on Crooks Algorithm

• J.F. Crooks's original paper on his algorithm

• 'Independence Generator'

• Greg Surma's write-up on minimax

• Stanford Poster on Algorithm Efficiency & Accuracy in Hex