search
viz
Pathfinding
Array
Game tree
Tic-Tac-Toe
N-Queens
Play Tic-Tac-Toe
You play as
O
; the bot plays
X
and moves first, using adversarial search.
Minimax
(Full search)
Alpha-Beta
(With pruning)
AND-OR
(Contingency)
Status
Your turn
Nodes evaluated
0
Nodes pruned
0
Reset Game