Logic Masters Deutschland e.V.

Battleship

(Published on 5. October 2026, 19:26 by berdy)

Rules:

  • Classic Sudoku: Every row, column and 3x3 box must contain every number from 1 to 9.
  • Ships: A ship is an orthogonal line of two or more cells, holding consecutive digits in ascending or descending order.
    • An N-ship is a ship made of N cells in a vertical or horizontal line. For example, a 3-ship could contain 234 or 876 (among other options) in order, vertically or horizontally.
    • The grid contains exactly one 6-ship, one 5-ship, one 4-ship, one 3-ship, and one 2-ship.
    • No other ships can be found on the grid – i.e. orthogonally adjacent cells are consecutive if and only if they belong to one of the listed ships.
    • Ships cannot touch, even diagonally.
  • Givens: Every given digit is a “missed shot” – i.e. no given is part of a ship.

Solve online: SudokuPad

Example: The 6x6 grid below follows the same rules on a smaller scale: boxes are 2x3, the digits are 1 to 6, and the fleet is exactly two 2-ships. Its solution is on the right with the ship cells shaded.

Example Solution

The two ships are 3–4 in column 2 and 4–3 in column 5, both in rows 3 and 4. No other pair of orthogonally adjacent cells holds consecutive digits, the ships do not touch, and none of the four givens is a ship cell.

Try the example in SudokuPad

Solution code: The top-left digit of every ship, from biggest to smallest ship.


Solved by Banana, YoBuggered, StefanSch, Decapod, Pigorithm, Sergiy, Trik126, iamissam, steperlich, rifflter
Full list

Comments

on 5. October 2026, 22:16 by Decapod
Very nice! Fun rules! The non-consecutive constraint outside of ships + ships can't touch is very powerful and made the puzzle feel easier than 3 stars.

on 5. October 2026, 20:43 by YoBuggered
I felt so sure about my ship placement.... until i didn't! Lol
Was a really fun puzzle and carefully well made!

on 5. October 2026, 20:42 by StefanSch
Nice!

Difficulty:3
Rating:N/A
Solved:10 times
Observed:0 times
ID:000VCL

Puzzle variant Online solving tool

Enter solution

Solution code:

Login