/hex-tree-searchers

Course project - Playing a game of Hex using Mini-max, alpha-beta pruning and Markov Decision Trees

Primary LanguagePython

For experiments and graphs simply run the main.py. This will result in prompts in the console (i.e which player won). For promts regading searched nodes, number of cutoffs uncomment prints() in searcher.py.

If a human player should be initialised change agent = "AI" to agent = "Human" when player 1 or player 2 is defined. This should prompt input ith column, jth row for user input and a board state print Human turn and AI turn.