Sudoku question
- From: "Frank Palmer" <F_L_Palmer@xxxxxxxxx>
- Date: 12 Jul 2006 09:19:07 -0700
In the June Scientific American, there was an article on Sudoku. The
puzzle has attracted me for some time. One statement in the article
puzzled me. The author, Jean-Paul DeLahaye, identifies one full grid as
"strangely familiar." He tells that there are 29 clue sets of 17 digits
each. Anyone of those can be solved.
The problem is that if a particular grid can be solved by a particular
clue set, than so can a remarkable number of other grids. In the first
place, onoe can replace the integers by any other ordering of integers,
that's 9! [factorial] grids.
Then, instead of suc algebraic transforms, one can look at geometrical
ones. Call a row of nine digits a "minor row" and a row of three boxes
(what the author calls "smaller squares") a "major row." Then any
exchange of two minor rows within a particular major row will be a
solution (if you start with a solution); so will an exchange of major
rows. That gives 6^4 [exponentiation] transforms. And a sufficient clue
set is transformed into another one. Moreover, the transform is
identified by what happens to the 9s (or any other particular digit).
So, there are 6^4*8! grids which each has 29 inequivalent sufficient
clue sets.
Clearly, the argument I gave for rows can be given word-for-word for
columns. But I can't see whether this generates any more grids with
this particular quality. In particular, any exchange of rows can be
matched by an exchange of columns which puts all the 9s in the same
positions. Is that possibly followed by an algebraci transform which
yields the same results?
.
- Follow-Ups:
- Re: Sudoku question
- From: Gib Bogle
- Re: Sudoku question
- From: Randy Poe
- Re: Sudoku question
- Prev by Date: Re: A class of special functions
- Next by Date: Re: Attempts to Refute Cantor's Uncountability Proof?
- Previous by thread: Algebra problem
- Next by thread: Re: Sudoku question
- Index(es):
Relevant Pages
|