Pure random guessing in Battleship takes an average of 96 shots to sink all five ships on a 10x10 grid. An optimal algorithm using probability density maps can finish in roughly 42-45 shots. That's not a minor edge — it's cutting the game nearly in half through math alone.
If you enjoy games where logic beats luck, you'll find similar thinking in Minesweeper — another grid where every click is a calculated risk.
The Probability Density Method
The core idea is simple: for every empty cell on the board, calculate how many different ways any unsunk ship could overlap that cell. Cells that can accommodate more ship placements have a higher probability of containing a ship. Shoot the highest-probability cell first.
At the start of a standard game, the center of the board has the highest density. A cell like E5 can be part of a 5-cell carrier in 8 different orientations (4 horizontal, 4 vertical), while a corner cell like A1 can only fit the carrier in 2 orientations. This is why experienced players instinctively avoid corners in their opening salvos.
After each shot, the map updates. A miss eliminates that cell from all future ship placements. A hit does something more powerful — it constrains the orientations of whichever ship you struck, dramatically shifting probabilities to adjacent cells.
Hunt Mode vs. Target Mode
Strong Battleship play uses two distinct phases. In hunt mode, you fire at cells with the highest baseline probability to find your first hit. Once you score a hit, you switch to target mode — systematically probing adjacent cells to determine the ship's orientation, then following it to both ends.
The transition between modes is where most players lose efficiency. A common mistake is getting a hit and then randomly guessing nearby cells instead of testing systematically. The optimal approach: after a hit, try the cell directly above. If that misses, try below. If that misses, try left. Each result gives you information that narrows the possibilities.
This two-phase approach mirrors how you'd play strategy games like checkers — the opening is about positioning and information gathering, the endgame is about precise execution.
The Parity Strategy (Checkerboard Pattern)
Here's a technique that dramatically improves hunt mode: only fire at cells of one color on a checkerboard pattern. Since the smallest ship (the destroyer) occupies 2 cells, it must cover at least one cell of each color. By only targeting, say, "black" squares during hunt mode, you cut the number of cells you need to search in half — from 100 to 50 — while guaranteeing you'll still find every ship.
Advanced players refine this further. Once the destroyer is sunk, the smallest remaining ship is 3 cells long. You can switch to every-third-cell spacing, reducing your search space even further. The math gets increasingly favorable as ships go down.
How AI Plays Optimally
The best Battleship algorithms go beyond simple probability density. They maintain a full distribution of all possible board states consistent with observed hits and misses, then select the shot that maximizes expected information gain — essentially asking "which cell will teach me the most regardless of the outcome?"
This is computationally expensive. The number of possible ship arrangements on a 10x10 board is enormous — over 30 billion valid configurations for the standard five-ship fleet. Algorithms use Monte Carlo sampling to approximate the true distribution, generating thousands of random valid boards and counting how often each cell is occupied.
The perfect Battleship player doesn't just maximize hit probability — they maximize the information extracted from every single shot, including misses.
This concept of information-maximizing decisions shows up everywhere, from game theory in Rock Paper Scissors to the thousands of decisions you make daily.
Expected Shots to Win
Under perfectly optimal play against a random ship placement, simulations suggest the expected number of shots to clear all ships is around 42. Human experts typically average 55-65 shots in competitive play — still vastly better than random, but short of algorithmic perfection.
The reason humans fall short isn't usually bad strategy. It's inconsistency. We correctly apply parity and hunt/target logic for a while, then get impatient or forget to update our mental probability map after a sequence of misses. The algorithm never gets bored or distracted.
Put Your Strategy Skills to the Test
Minesweeper uses the same probability-based thinking — every click is a decision between risk and information.
Play MinesweeperThe beautiful thing about Battleship strategy is that it's learnable. You don't need to run Monte Carlo simulations in your head. Just remembering to use checkerboard parity, center your opening shots, and switch cleanly between hunt and target modes will put you ahead of 90% of casual players. The math is on your side — you just have to use it. For more strategy games that train this kind of thinking, check out our best free brain games roundup.