The Knights Who Say GCD
(Eingestellt am 2. Juli 2023, 19:29 Uhr von ymhsbmbesitwf)
Rules:
- Normal sudoku rules apply.
- Digit in a white circle is the greatest common divisor of all digits in cells it can see via a knight's move.
- Along thermometers digits must increase from the bulb end.
Example:
- GCD(2, 4, 4, 6) = 2
- GCD(5, 7) = 1
Lösungscode: Last column of the sudoku.
Gelöst von StefanSch, SKORP17, OutOfMyMindBRB, jalebc, liushong, TaeChi
Kommentare
am 3. Juli 2023, 11:06 Uhr von liushong
nice puzzle, it's just that the knightly constraint of CTC doesn't feel very good
Zuletzt geändert am 3. Juli 2023, 17:33 Uhr
am 3. Juli 2023, 08:31 Uhr von liushong
nice puzzle, it's just that the knightly constraint of CTC doesn't feel very good
@liushong thanks :) i think i know the problem (to me about half the time ctc app said the solution is wrong - probably because it reads "knight" in description and app is guessing classic knight variant) and i just don't know how to get around it, sorry about that. ymh
