Binary Trees
(Eingestellt am 2. März 2025, 17:29 Uhr von Azvaril)
Hello. I've been explaining binary trees as a data structure at work recently, and since then I've had the idea of translating it into a Sudoku variant. I've simplified the rules, so don't be afraid to give it a try.
Have a good time solving!
Solve on SudokuPad
Normal sudoku: Every row, column and 3x3 box must have all numbers from 1 to 9 exactly once.
Circles and lines form binary trees. One tree is a min binary tree and the other is a max binary tree. The solver determines which is min and which is max.
Min binary tree: each parent node is smaller than its children.
Max binary tree: each parent node is larger than its children.
Digits on the tree do not repeat.
Kropki dots: A black dot between two cells indicates that one of the digits is twice as big as the other digit.
ALL possible black dots are given.
Examples:
Lösungscode: Row 5, 9 digits left to right.
Kommentare
am 2. März 2025, 23:49 Uhr von Tinnifer
This was a very nice and fun puzzle even though I made the classic mistake of forgetting the negative constraint for longer than I care to admit. Thank you for setting!
am 2. März 2025, 22:26 Uhr von askaksaksask
This is a fun novel constraint, and I'd love to see it explored more. The logic around the trees is very accessible. In this week's episode of 'i need to read rules better' it is quite important to note that digits cannot repeat on trees! Otherwise, a fresh entry, thank you!
