Combinatorics and Graph Theory


A Group-Permutation Algorithm to Solve the Generalized SUDOKU

Authors: Florentin Smarandache

Sudoku is a game with numbers, formed by a square with the side of 9, and on each row and column are placed the digits 1, 2, 3, 4, 5, 6, 7, 8, 9, written only one time; the square is subdivided in 9 smaller squares with the side of 3x3, which, also, must satisfy the same condition, i.e. each square to contain all digits from 1 to 9 written only once.

Comments: 3 pages.

Download: PDF

Submission history

[v1] 13 Mar 2010

Unique-IP document downloads: 150 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus