Tripod Sudoku [Serkans Blog]

Post Reply

Is this suitable for a Sudoku competition?

Yes
1
9%
Maybe
0
No votes
No
10
91%
 
Total votes: 11

Realshaggy
Posts: 20
Joined: Sun 29 Apr, 2012 2:21 pm

Tripod Sudoku [Serkans Blog]

Post by Realshaggy » Wed 02 Jan, 2019 11:29 am

Rules: Fill the grid with digits 1-n and divide the grid into some regions, so that each digit appears exactly once in every row, column and region. All points where three lines meet are given. There are no points where four lines meet.

tripod_sudoku_example2-e1339974687429.png
tripod_sudoku_example2-e1339974687429.png (64.37 KiB) Viewed 2662 times

This is a case, I'm not sure about. While the solution is clearly an Irregular Sudoku, the solving process includes finding one of the dissections with the help of additional marks (and the lack thereof) in the grid. The interesting puzzles are probably the ones, that can not be uniquely solved as a latin square and force the solver to work with the (not given) dissection.

The example is taken from Serkan Yureklis' blog where he refers and links to additional puzzles that occured in multiple contests. Google search also gives some additional instances.

https://yureklis.wordpress.com/2012/06/ ... od-sudoku/
Last edited by Realshaggy on Wed 02 Jan, 2019 1:06 pm, edited 1 time in total.

detuned
Posts: 1874
Joined: Mon 21 Jun, 2010 2:25 pm
Location: London, UK
Contact:

Re: Tripod Sudoku [Serkans Blog]

Post by detuned » Wed 02 Jan, 2019 11:51 am

This also featured in the 2011 WSC, but you beat me to it.

In theory this puzzle requires the drawing of regions as well as the placement of numbers

Realshaggy
Posts: 20
Joined: Sun 29 Apr, 2012 2:21 pm

Re: Tripod Sudoku [Serkans Blog]

Post by Realshaggy » Wed 02 Jan, 2019 12:03 pm

Yes sorry, I was not sure if it is better to wait until you finished your review of past WSC, but who knows how long that takes.

detuned
Posts: 1874
Joined: Mon 21 Jun, 2010 2:25 pm
Location: London, UK
Contact:

Re: Tripod Sudoku [Serkans Blog]

Post by detuned » Wed 02 Jan, 2019 12:18 pm

No need to be sorry, it’s a time consuming task and I’m more than glad if people can help me out :-) thanks for posting!

Post Reply