New · Cluedo (Clue) deduction helper now uses a full SAT solver

Solve every board game one move at a time.

Import a game state, replay any position and let the optimal engine explain the best move — with probabilities, SAT proofs and clear reasoning. Improve between games. Never wonder “what should I have played?” again.

10
Games supported
6
Solver types
100%
Documented

Browse games

Pick a game, import a state and let the engine guide you move by move.

Tic-Tac-Toe

The classic. Perfectly solved.

Tap a cell to set the position. A full minimax search returns the optimal move and proves whether the game is a win, loss, or draw.

Minimax
2 playersSolved
🔴

Connect Four

Bitboard alpha-beta with transposition table.

Drop discs into the 7×6 grid. A negamax search on bitboards (after Pons) with center-first ordering, anticipated-loss pruning and a transposition table returns the best column and a per-column evaluation.

Alpha-BetaHeuristic
2 playersStrong
🎲

Yahtzee

Expectimax over dice & scorecard states.

Enter your dice and scoresheet. A precomputed expectimax table returns the optimal keep/reroll and category choice.

Expectimax
1+ playersSolved
🔍

Cluedo (Clue)

SAT solver + Monte-Carlo marginals.

Track suggestions and reveals live. A SAT solver narrows down possible envelopes; Monte-Carlo sampling gives per-card probabilities.

SAT SolverMonte-Carlo
3–6 playersHeuristic
🚢

Battleship

Probability-density hunt & target solver.

Mark your shots as miss, hit or sunk on a 10×10 board. The solver enumerates every legal placement of each remaining ship, builds a probability-density heatmap and suggests the next shot.

Heuristic
2 playersHeuristic
🧭

Barricade

Alpha-beta + shortest-path heuristic.

Race-and-block game on the 9×9 grid (à la Quoridor / barricade.gg). Place barricades to lengthen your opponent's route while keeping your own path open. Iterative-deepening negamax with the Glendenning shortest-path-difference heuristic suggests the best move.

Alpha-BetaHeuristic
2 playersHeuristic
🕵️

Guess Who?

Information-theoretic half-split solver.

The classic 24-character deduction game. The engine ranks every encoded question by worst-case eliminations (greedy half-split = proven optimum for binary questions) and you can also toggle characters manually for homemade clues the solver can't encode.

Heuristic
2 playersSolved
💣

Minesweeper

CSP solver with frontier enumeration.

Set up any Minesweeper position on a grid of your choice. The helper enumerates every consistent mine assignment on the constraint frontier and reports per-cell mine probabilities — including which clicks are provably safe and which cells are provably mines.

SAT SolverHeuristic
1 playerHeuristic
🎯

Perudo

Liar's Dice — exact binomial helper with CFR-backed advice.

Enter every player's dice count, your own hand and the current bid. The engine computes the exact binomial probability of every legal raise, plus Dudo and Calza, and recommends the action with the highest survival probability — the same expected-count rule that converged CFR policies for Dudo settle on.

Monte-CarloHeuristic
2–6 playersHeuristic
🟩

Wordle

Selby’s proven-optimal minimax solver.

Enter your guesses and the colours Wordle returned. A minimax partition solver (Selby 2022) finds the optimal next guess, guaranteeing a solve in at most 5 moves with an average of 3.4212 from the opener SALET.

MinimaxHeuristic
1 playerSolved

Why BoardSolve

Understand every move, not just the score.

BoardSolve turns post-game frustration into insight. Import a position, watch the engine reason about it, and walk away knowing what you would have played — and why.

Import a saved game

Paste an exported JSON game or upload a log file. We restore the exact position so you can analyse it instantly.

Replay move by move

Step through the timeline and see how each move shifted the evaluation, with blunders and inaccuracies flagged.

Best moves with reasons

Every suggestion comes with the engine's evaluation and a short, plain-English rationale — not just a number.

Probabilities & odds

Monte-Carlo sampling and exact expectation give you per-card, per-outcome odds for dice and imperfect-information games.

A solver per game

Minimax, alpha-beta with bitboards, expectimax, SAT and probability-density — each game uses the technique that fits, and we tell you which.

Spot your mistakes

Each replay highlights your blunders and inaccuracies move by move, so the next game goes better.

Under the hood

The right solver for every game.

Perfect-information games use minimax with alpha-beta pruning. Stochastic games like Yahtzee use expectimax on a precomputed table. Imperfect-information games like Cluedo (Clue) combine a SAT solver for hard constraints with Monte-Carlo sampling for marginal probabilities. Every suggestion is explained, every score is traceable.