SufferingDoge

SufferingDoge is an AI engine developed to choose optimal moves within an MNK-game. An MNK-game is a generalized version of Tic-Tac-Toe where the game grid consists of M rows, N columns and you need to align K symbols to win. Classic Tic-Tac-Toe corresponds to MNK(3, 3, 3). SufferingDoge uses the MiniMax algorithm, aided by AlphaBeta pruning to optimize the game tree traversal. This allows exploring the game tree more deeply compared to using MiniMax alone. On more complex boards, even AlphaBeta pruning becomes ineffective, so two heuristics were introduced for position evaluation. Combined, they provide a local evaluation for the individual move and a global assessment of the entire game state. This way SufferingDoge can analyze the game tree more deeply, focusing only on favorable positions, saving time.

Challenge SufferingDoge in your preferred MNK configuration and try to beat it!