Browser game example
The player searches a ten-by-ten grid for an opponent's hidden fleet of five ships. Both boards remain visible at once, letting the player compare discoveries with the opponent's hunt.
After a hit, the computer opponent follows a hunt pattern but cannot inspect the player's board. A fewest-shots leaderboard rewards efficient searching rather than merely surviving longer.
Cleo is opening to founders in small batches. Join the waitlist and we'll save your spot.
Updated
The player searches a ten-by-ten grid for an opponent's hidden fleet of five ships. Use the sample to name the audience, the main action, and the smallest useful first version. Cleo HQ then helps turn your own brief into a product plan and a working build.
No. The opponent's search logic is built so it cannot inspect the player's board. After a hit, it hunts nearby locations, but it still has to discover ships through its own guesses. That keeps the match fair while letting the computer react to evidence.
Both players use a ten-by-ten grid, and each fleet contains the classic five ships. Both grids stay visible during the game, making it easy to track which locations have been searched and where a ship may still be hiding. The turn changes only after a shot, so the board stays focused on deduction rather than reflexes.
The board ranks players by the fewest shots used to find the opposing fleet. That favours careful search patterns over firing at random. A founder could adapt the same idea to another hidden-object contest where players benefit from learning from each result.