I am trying to code a bot that can play ultimate tic tac toe and beat other bots https://en.wikipedia.org/wiki/Ultimate_tic-tac-toe. I am doing so using minimax with alpha-beta pruning to limited depth, once the depth limit is reached the bot will use a heuristic evaluation function to determine which move to make. I am in need of some heuristic ideas. I have already implemented all the standard ones like counting the number of local board wins, seeing the number of uninterrupted two-in-a-rows for both mini-boards and the global board as well as seeing the mobility of a player(how many squares are available to them in the board they have been sent to) and am in need of something a bit cleverer
Asked
Active
Viewed 40 times
