Schrödinger's Minesweeper
(Eingestellt am 30. März 2024, 02:48 Uhr von starwarigami)
- Place the digits 0-9 in the grid so that every row, column, and 3x3 box contains every digit exactly once.
- To enable this, there is a single Schrödinger cell in each row, column, and box, that contains two digits.
- A digit is a mine if it is "friendly", i.e. it matches its row, column, or box number.
- The sum of the digits in a circle is the number of mines seen in the 8 surrounding cells.
- Circles may also contain mines, but they will not be included in that cell's count.
- The sum of the digits along an arrow equals the sum of the digits in the connected circle.
- All valid circle are given, but not all mines are necessarily seen.
Lösungscode: Row 6 (left to right) - 10 digits, no spaces
Gelöst von redgecko, BHUNTER47, tuturitu, SKORP17, Vodakhan
Kommentare
am 30. März 2024, 14:19 Uhr von BHUNTER47
Excellent puzzle with great logic regarding the arrows to even get broken in.
