Sudoku: Perbezaan antara semakan

* [[Wei-Hwa Huang]] created a meta-''Sudoku'', where the object is to finish drawing the 5×5 grid's pentomino-region borders so as to leave a uniquely solvable puzzle with no identically-shaped regions.

 

 

The general problem of solving ''Sudoku'' puzzles on ''n''² x ''n''² boards of ''n'' x ''n'' blocks is known to be [[NP-complete]] [http://www.phil.uu.nl/~oostrom/cki20/02-03/japansepuzzles/ASP.pdf]. This gives some indication of why ''Sudoku'' is difficult to solve, although on boards of finite size the problem is finite and can be solved by a [[deterministic finite automaton]] that knows the entire [[game tree]].