Battleships Minesweeper
Battleships Minesweeper is a hybrid puzzle combining the mechanics of classic Battleships with the clue logic of Minesweeper.
The earliest known examples of this genre appeared at the 1999 World Puzzle Championship (WPC) in Budapest, in Round 9 as “Battleships varia #2”. These puzzles were constructed by György István. In this version, solvers had to place a standard battleship fleet on the grid such that each numbered cell indicated how many ship segments were adjacent to it, including diagonals—exactly in the style of Minesweeper.
Traditionally, Battleships-style puzzles require that ships must not touch each other, not even diagonally. However, a puzzle in WPC 2017 / Round 4 introduced a rare variant where touching was allowed, demonstrating the flexibility of the hybrid concept.
As a result, Battleships Minesweeper offers a distinctive blend of two classical logic genres:
- placement deduction from Battleships,
- adjacency counting from Minesweeper.
This fusion creates a unique solving experience where spatial reasoning and numeric clues intertwine.
The earliest known examples of this genre appeared at the 1999 World Puzzle Championship (WPC) in Budapest, in Round 9 as “Battleships varia #2”. These puzzles were constructed by György István. In this version, solvers had to place a standard battleship fleet on the grid such that each numbered cell indicated how many ship segments were adjacent to it, including diagonals—exactly in the style of Minesweeper.
Traditionally, Battleships-style puzzles require that ships must not touch each other, not even diagonally. However, a puzzle in WPC 2017 / Round 4 introduced a rare variant where touching was allowed, demonstrating the flexibility of the hybrid concept.
As a result, Battleships Minesweeper offers a distinctive blend of two classical logic genres:
- placement deduction from Battleships,
- adjacency counting from Minesweeper.
This fusion creates a unique solving experience where spatial reasoning and numeric clues intertwine.
Rules
Place the given fleet of ships into the grid so that no two ships are in adjacent squares, not even diagonally. Clues represent the total count of occupied neighbouring cells, including diagonally adjacent cells. Ships cannot be located in cells with numbers.
Click to see the answer.