Logic Masters Deutschland e.V.

Tiny Knight

(Eingestellt am 26. September 2023, 02:33 Uhr von DigitalFlaw)

Tiny Knight

Stumbled across this pattern while working on another sudoku and figured it needed to be its own puzzle.

Rules:

1. Fill each row and column with the numbers 1-4 so that they have exactly one of each digit

2. Cells may not contain the same digit as other cells that are a chess knight's move from them (Antiknight)

3. Digits along a thermometer must strictly increase starting from the bulb

4. Digits separated by a black dot must have a ratio of 1:2

F-Puzzles

Sudoku Pad

Lösungscode: Every digit read left to right, top to bottom.


Gelöst von Hajuhn, JohanW, RussKozerski, radium, Viola canadensis, Rex, ozy169, Dermerlin, fuxia, m_busuttil, Starlight, LehanLehan, Greg, Artsy, vorash00, MarkSud, rictech, marcmees, roscommon, happyteo, ... RickiFerrara, hirassy, permafrostyx, NumaPompilius, Zedarflight , wildstarjl, richliaofs, Jowser, yasmim.nat, FireRide, Supertaster, Kachow, Eepowiz, ArmagedDan, Evan, Uattanscethe09, bereolosp
Komplette Liste

Kommentare

am 6. September 2024, 17:21 Uhr von permafrostyx
yay 1:09

am 3. Dezember 2023, 11:03 Uhr von KingIsulgard
Got any more of them tiny puzzles?

am 9. Oktober 2023, 06:30 Uhr von Tingo
Fun bite sized puzzle. Took me 2 minutes and 58 seconds. Very enjoyable! Thanks for setting and sharing!

am 27. September 2023, 23:25 Uhr von DigitalFlaw
Dreamy4Vada: type row 1 in order, then row 2 in order, then row 3 in order, and finally, row 4 in order.

am 27. September 2023, 17:46 Uhr von BakBak
Fascinating litte snack

am 27. September 2023, 13:30 Uhr von Kirra
Nice Sudoku Snack :)

am 26. September 2023, 11:49 Uhr von anyeyeball
Nice, This would be a good SnackDoku on the CtC Discord.
---
Which knight is the protector of foods? :
Sir Anwrap

am 26. September 2023, 02:49 Uhr von RussKozerski
Tiny knight: Sir Cumcision

Schwierigkeit:1
Bewertung:78 %
Gelöst:397 mal
Beobachtet:7 mal
ID:000FAI

Variantenkombination Online-Solving-Tool Klein

Lösung abgeben

Lösungscode:

Anmelden