Posted on 1 Comment

Hidatoâ„¢ On Sudoku

Hidato On Sudoku

There’s been a significant increase in traffic to this blog ever since I posted the Numbrix puzzle variant at the end of July. For that, I thank you all for visiting.

This week, Barnes and Noble displayed a book by Dr. Gyora Benedek, called Hidato (A Hebrew word meaning: My Puzzle). Dr. Benedek writes an excellent (short) autobiography. The book itself contains variously sized and shaped grids including non-square (and non-quadrilateral) ones. Some web-based 10 x 10 grids have an interesting characteristic in that the middle 4 cells are darkened, indicating that they are not in play, leaving 96 cells to the playing area.

Typically, you’ll be connecting sequence segments based on the starting numbers. Luckily, the connectedness of the overall sequence requires that local neighborhoods of numbers be near in value. What provides a challenge is that It is possible that multiple such sequences may be intermixed.

On the negative side, there’s no facility for saving the current state of the puzzle (without printing it) and when you print the puzzle out, it does not let you return to the puzzle to continue with it.

Have a good time with this variant. This is just the beginning for it.

Posted on

Compact Sudoku

Compact Sudoku

A while back, I created a Cartoon called Double Sudoku. In that variant, there were 2 totally separate Sudoku Puzzles embedded in a single Sudoku Grid with all split cells.

The current cartoon is reminiscent of that one, but has N-1 starting numbers that are the same for both puzzles. (Double Sudoku had all different starting numbers for each puzzle.)

In researching where this variant may exist on the internet, I came across a site called SuBundle.com, by Dr. Chen, which has generalized this concept even further. Provided are puzzles with as many as 256 possible puzzles generated from multiple “Key Cells” in a single grid.

Normally, a “Key Cell” either contains a single digit M, which signifies that there are that (M) many puzzles bundled together (and you must figure out which digits lead to a solution) or the “Key Cell” contains multiple digits, which means that each of those digits leads to a different Sudoku puzzle.

Truly, this is a “Green” website for Sudoku Puzzles, where the number of Sudoku Grids is severely conserved. His site even offers multiple blank Sudoku grids that may be printed from a pdf or png formatted file.

I’ve provided tips for solving the above puzzle in the single grid by splitting blank cells in two parts. Of course, you can write each puzzle out on paper or duplicate electronically and solve each normally (and one after another).

I hope you enjoy solving this example of Sudoku puzzle cousins twice removed!

Posted on

Plain Text Sudoku

Plain Text Sudoku

This cartoon has at its root, a cartoon from 3/4/2007, called Linear Sudoku. For those that wish to describe a Sudoku puzzle to others, particularly by Email, the best way is to create either an 81 character text string or a 9 strings of size 9, where the dot represents the blank cell in both cases.

The site: Sudoku @ Paulspages permits the selection of a Sudoku puzzle, be it random, non-symmetric or from a gallery of puzzles and from that point, it is possible to export it as a text file as shown to the right of the Board in this Cartoon.

There are several benefits for this format, not the least of which is communicating with another puzzler to verify a difficulty or a solution. For those who are visually impaired, they can employ a software program that converts text to speech, thereby permitting the person to hear what the puzzle elements are, so that they can be solved mentally, or transcribed to a braille-writer for reference.

Now that text messaging is becoming most popular, these text strings can convey a puzzle in a minimum of words. This can be useful in timed competitions, where the winning solution is “texted” over to the contest judges for least time and solution correctness. See, for example:
Sudoku Text Challenge sponsored by the TimesOnline and retrieved June 17, 2008.