> bruteforce every possible board configuration for the next 3 turns and then make the move that leads to more desirable outcomes I'd recommend familiarizing y

> bruteforce every possible board configuration for the next 3 turns and then make the move that leads to more desirable outcomes I'd recommend familiarizing yourself with the minimax algorithm - since that's exactly what it does where "desirable outcome" is essentially the tunable evaluation aspect of the equation. https://en.wikipedia.org/wiki/Minimax https://en.wikipedia.org/wiki/Minimax