10
$\begingroup$

A SIKAKU puzzle consists of a square or rectangular grid in which some of the cells contain a one or two digit number. To complete the puzzle, a Solver must divide the puzzle into a number of rectangles so that each rectangle contains exactly one of the numbers, and that number must be equal to the area of the rectangle which contains it. Each puzzle has a unique solution which does no require any guesswork to achieve.

Example :
enter image description here

Solve This
enter image description here

$\endgroup$
4
  • $\begingroup$ It seems like an easier version of nurikabe $\endgroup$ – justhalf Oct 16 '17 at 11:40
  • $\begingroup$ @justhalf It's quite different. The regions have to be rectangular, and the divisions are made with edges, instead of blocks. $\endgroup$ – Matthew Jensen May 4 at 4:37
  • $\begingroup$ Yep, the extra restriction is what made me say it is an easier version of nurikabe. $\endgroup$ – justhalf May 4 at 5:28
  • $\begingroup$ Why nurikabe? Shikaku has been an existing genre for a long time, plus, nurikabe requires shading cells $\endgroup$ – Anonymus 25- Reinstate Monica May 4 at 8:48
6
$\begingroup$

It was really fun!!

The solution to puzzle is:

enter image description here

$\endgroup$
10
$\begingroup$

Step 1:

Some trivial deductions based on numbers which must be part of 1×N rectangles, and the fact that each rectangle can only have one number.
Step 1

Step 2:

The 25 must be 5×5, and there's only one way to let it be. This forces the 5 above it to stretch to the corner as no other number can reach. It also squeezes the 7, 4, and 10 below it and lets them be resolved.
Step 2

Step 3:

The 16 must be 4×4; 2×8 is impossible. This ends up forcing a nearby 12 and 10.
Step 3

Step 4:

Various reachability deductions in the bottom-left corner. Only the 8 can get to the corner, so it must stretch all the way there. Then only the 4 can get to the square above the 8, so we can resolve it. Finally only the 12 can stretch to R11C1, so it does so.
Step 4

Step 5:

More reachability, along the top this time: the 8 to R1C1, and the 12 to both R1C5 and R1C8.
Step 5

Step 6:

The 9 now needs to be 3×3. This lets us resolve the 3 and 8 near it.
Step 6

Step 7/solution:

The rest is trivial packing logic.
Step 7

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.