A Chopsticks Solution Part 1

Abstract: In this post, we start writing a solution to a variation of the hand game “Chopsticks”. In this post, we create a graph that maps all of the possible moves and states. We also implement a version of minimax called negamax. Chopsticks is a popular hand game for two or more players. In Chopsticks,Continue reading “A Chopsticks Solution Part 1”

Tic-Tac-Toe and Minimax

Abstract: In this post, we discuss some of the important terms of basic game theory, and using the Minimax algorithm, create a strong solution for the abstract-strategy game of Tic-Tac-Toe. Tic-Tac-Toe, from a game design standpoint, is horrible. It lacks any real decision making, and assuming all players act optimally, will always end in aContinue reading “Tic-Tac-Toe and Minimax”