Logic Masters Deutschland e.V.

Mining for Super Indexers

(Eingestellt am 27. Dezember 2021, 21:27 Uhr von mathpesto)

This is my second puzzle featuring what I call "Super Indexers", which is related to 159 Sudoku. Comments and ratings are much appreciated, and please be sure to check out my other puzzles here.


Rules:

Normal sudoku rules apply.

Odd/Even: A digit in a gray square must be even. A digit in a gray circle must be odd.

Super Indexer: A digit in a white square must be a Super Indexer. A “Super Indexer” is a digit z located at RxCy which tells us digit y is in RxCz and digit x is in RzCy.

Minesweeper: A digit in a white circle must be the number of surrounding Super Indexers, not including itself. (In other words, the amount of Super Indexers orthogonally and diagonally adjacent to the white circle.)

Not all white squares/circles are necessarily given.

(Note: Another way to think of Super Indexer cells is like 159 clues, except they can be in any column or row, and they simultaneously give a digit in the zth position of that row as well as the zth position of that column.)

Solve on F-Puzzles

Solve on Cracking the Cryptic


Puzzle:

Lösungscode: Enter rows 1 and 3 (18 digits, no spaces)


Gelöst von CastleSheepside, Seb_, marcmees, MagnusJosefsson, jgreenfield, Bellsita, Vebby, fjam, tuturitu, Mikemerin, StephenR
Komplette Liste

Kommentare

Zuletzt geändert am 30. August 2023, 20:58 Uhr

am 30. August 2023, 20:58 Uhr von StephenR
A real head-wrecker for me (in the nicest possible way). Took me ages to get my head round the rules and then once my safety lamp was guiding me forwards I finished with a deadly pattern and eventually realised I had wrongly marked a super indexer. Was definitely motivated to backtrack though and sort it all out.

am 28. Dezember 2021, 21:55 Uhr von MagnusJosefsson
Very nice puzzle, I enjoyed it!

am 28. Dezember 2021, 15:15 Uhr von marcmees
Very nice mindbender. thanks.

Schwierigkeit:4
Bewertung:91 %
Gelöst:11 mal
Beobachtet:3 mal
ID:0008NS

Variantenkombination Neu Online-Solving-Tool

Lösung abgeben

Lösungscode:

Anmelden