Comments on: Oracle RDBMS 11gR2 – Solving a Sudoku using Recursive Subquery Factoring

By: Mirek Burnejko

Mirek Burnejko — Sat, 28 Jan 2012 07:35:41 +0000

Great post. Now you can start in an tournament. Anton and his machine.

By: Dora

Dora — Fri, 16 Dec 2011 22:22:05 +0000

Yesssss!! Now my weekly office sudoku challenges will finally start going my way!!!! :]

By: jareeq

jareeq — Fri, 07 Oct 2011 08:40:55 +0000

Anton this is impressive now you are my third after god and mother

By: Tonny

Tonny — Thu, 11 Aug 2011 12:27:12 +0000

set lines 9
before your query you get a nice column like your puzzle.
delete comment #42

By: Ramesh G

Ramesh G — Tue, 06 Jul 2010 09:48:55 +0000

Wow.. Wonderfull.. Excellent post…

By: emil

emil — Tue, 02 Mar 2010 03:39:38 +0000

great post.

By: Anton Scheffer

Anton Scheffer — Mon, 04 Jan 2010 14:53:20 +0000

@c: Maybe it suffices to find one solutions, this query finds all solutions. And that has nothing to do with breadth- or depth-first searching, that’s because there’s no way to stop the recursion after finding a solution.

By: C

Thu, 31 Dec 2009 20:09:06 +0000

It looks to me that what the recursive subquery does is “breadth-first search”, i.e., for each blank square in the sudoku, it considers all possibilities before moving on to the next blank square. That computes all solutions to the sudoku, but I’m wondering if that is a good way of solving a sudoku in practice because it generally suffices to find one solution.

By: Anton Scheffer

Anton Scheffer — Tue, 22 Dec 2009 13:00:25 +0000

@W.G. Nice
@Bijesh K Recursive subfactoring is something Oracle introduced in 11GR2, so you can’t convert this kind of solutions to 10g.

By: Bijesh K

Bijesh K — Tue, 22 Dec 2009 10:12:13 +0000

Its brilliant effort, I tried to convert sudoco query in 10g but I am not getting the correct result..Anybody can help me?????