Logic Masters Deutschland e.V.

Battleship Prime Redux

(Eingestellt am 20. April 2023, 22:18 Uhr von SenatorGronk)

This is a modified version of a puzzle I launched a few months ago. I really enjoyed the central conceit of the puzzle but never liked the extra lines I added to disambiguate the second half of the grid. This one is cleaner with a more thematic additional constraint (buoys). The key to the break-in is identical to the original -- things are a lot more constrained than they may seem.

Rules

  • Standard sudoku rules apply
  • The grid has 10 ships in orthogonal lines: 1 that is 1x4 cells, 2 that are 1x3, 3 that are 1x2 and 4 that are 1x1. The digits in each ship sum to a different prime number (1 is not prime).
  • Diamonds are land cells and indicate the combined number of ship cells in their row and column. Ships do not touch land cells or each other -- even diagonally.
  • Circles are buoys and equal the number of ship cells in the surrounding cells (8 in the middle of the grid, 5 on the edge, 3 in a corner). All possible circles are given.
  • Note: the two diamonds in Box 8 should be considered separately. They both see all the ship cells in Column 6.

SudokuPad (CtC)



The original version didn't get as much traction as I expected, so here are a few hints to get you started:

Hint 1

How many total ship cells are there?

Hint 2

Which ships have a digit composition that is forced by the prime sum constraint?

Hint 3

How many ship cells do not share a row or column with the 7, 8 or 9 diamonds?

Lösungscode: Row 5 + Column 2

Zuletzt geändert am 21. April 2023, 18:31 Uhr

Gelöst von halakani, bodemeister, Jesper, sourcedecay, TrollErgoSum, SquaringSquirrel
Komplette Liste

Kommentare

am 21. April 2023, 18:31 Uhr von SenatorGronk
Clarifying adjacency constraint

am 21. April 2023, 05:42 Uhr von bodemeister
Great idea relating ships to prime numbers. Enjoyable smooth solve! Watch out for negative constraints!

am 21. April 2023, 04:43 Uhr von SenatorGronk
Typo

Schwierigkeit:4
Bewertung:N/A
Gelöst:6 mal
Beobachtet:8 mal
ID:000DO2

Lösung abgeben

Lösungscode:

Anmelden