Solution to Hidoku no 6

Hidoku no 6 (7 by 7)

I created the solution to this puzzle using a C program which I wrote myself.

I created the puzzle from the solution using a Python program written by Rainhard Findling 

I rendered the image below using Amit Kuba's Online Hidoku Solver If you enjoy my puzzle, you will find many more to try there.

Here is a reminder of the rules:

I arranged the numbers 1 through 49 in ascending order on the grid below before removing some of them at random. Your job is to replace the numbers I have removed. When you have finished, the grid must contain all the numbers 1 through 49 exactly once and cells with consecutive numbers must be joined horizontally, vertically or diagonally:

See answer

Solution to Hidoku no 5

Hidoku no 5 (6 by 6)

I ran my C program to create a 6 by 6 hidoku solution. Then I used Rainhard Findling's Python solver to create a puzzle from this, as described in earlier posts. I keyed it into an online solver here to produce the image you can see below. Since I last used this, I have written to the site's owner, Amit Kuba, to ask his permission to continue using it for this purpose. He agreed and pointed out a couple of useful points.

Firstly, once you have typed in a puzzle and pressed Solve, you can then press Solve again. If the puzzle has a unique solution, the same answer will reappear. If the puzzle has multiple solutions, a different one will be shown.

Secondly, if you enjoy this puzzle, Amit's solver has many more for you to work through.

Here is a reminder of the rules. I arranged the numbers 1 through 36 in ascending order on the grid below before removing some of them at random. Your job is to replace the numbers I have removed. When you have finished, the grid must contain all the numbers 1 through 36 exactly once and cells with consecutive numbers must be joined horizontally, vertically or diagonally:

See answer

Solution to Hidoku no 4

Here is the solution created by my program:
  
andrew@LUBUNTU-Laptop:~/Hidoku$ cat answer
022 021 020 019 018
023 025 016 017 007
024 015 009 008 006
014 010 001 005 003
013 012 011 002 004
andrew@LUBUNTU-Laptop:~/Hidoku$

...and here is the solution created by the online solver I used:

Hidoku no 4 (5 by 5)

In previous hidoku puzzles I have created the grids in a Google Docs document. Then I have used the snipping tool from my browser to cut out the puzzle and answer as images. This produces quite a pleasing effect but it runs the risk that I could copy the puzzle incorrectly and publish one with zero or multiple solutions. I need to avoid that so for this puzzle I am trying a different approach. Here is the puzzle as I created it on my Lubuntu laptop:

andrew@LUBUNTU-Laptop:~/Hidoku$ cat nxnpuzzle.txt
__,__,__,19,__
__,25,__,__,__
__,15,__,__,__
__,__,01,__,03
__,__,__,__,__
andrew@LUBUNTU-Laptop:~/Hidoku$

I keyed it into a hidoku solver I found here and produced the image below. Then I pressed the Solve button and checked that the answer matched the one I had on my laptop. This confirmed that I had entered the puzzle correctly.

Here is a reminder of the rules. I arranged the numbers 1 through 25 in ascending order on the grid below before removing some of them at random. Your job is to replace the numbers I have removed. When you have finished, the grid must contain all the numbers 1 through 25 exactly once and cells with consecutive numbers must be joined horizontally, vertically or diagonally:

See answer

Solution to Hidoku no 3

Hidoku no 3 (4 by 4)

Now I need to try out various puzzle sizes to see if my program can create them successfully. This is a 4 by 4 puzzle, which is also quite easy.

Here is a reminder of the rules. I arranged the numbers 1 through 16 in ascending order on the grid below before removing some of them at random. Your job is to replace the numbers I have removed. When you have finished, the grid must contain all the numbers 1 through 16 exactly once and cells with consecutive numbers must be joined horizontally, vertically or diagonally:

See answer

Solution to Hidoku no 2

Hidoku no 2 (3 by 3)

Last night I changed my hidoku creation program so that it could produce puzzles from 3 by 3 up to 12 by 12. Here is a 3 by 3 puzzle, which is clearly very easy. You could perhaps work through it with a young child.

Here is a reminder of the rules. I arranged the numbers 1 through 9 in ascending order on the grid below before removing some of them at random. Your job is to replace the numbers I have removed. When you have finished, the grid must contain all the numbers 1 through 9 exactly once and cells with consecutive numbers must be joined horizontally, vertically or diagonally:

See answer

Solution to Hidoku no 1

Hidoku no 1 (8 by 8)

I wrote a C program to arrange each of the numbers 1 through 64 in ascending order on the 8x8 grid below. Then I removed numbers at random and tested the remaining clues to see if they made up a hidoku puzzle with a unique solution. I did this using a Python program written by Rainhard Findling, which you can see here. If the puzzle was still valid I carried on. If it was not, I replaced the number I had just removed.

Your job is to replace the numbers I have removed. When you have finished, the grid must contain each of the numbers 1 through 64 exactly once and each number must be horizontally, vertically or diagonally adjacent to the numbers immediately above or below it: 

See answer