In case you are interested

來源: hqw2000 於 2011-10-24 18:23:06 [] [舊帖] [給我悄悄話] 閱讀數 : (680 bytes)
回答: sort of 由 品茗99 於 2011-10-24 18:05:02

I recently discover an algorithm that solves every sudoku, i think, without T&E. (WHich is inspired by BDD-based set operation.) I planned to submit to some journal, but I now decide to post it online instead. You can access it in this way. Search for sudoku programmers forum on internet, go to the "programming sudoku" board. In the thread "Solving Every Sudoku Withoug Guessing" thread (the 2nd or the 3rd thread), click the link in the first post.

There are some discussion in that thread too, mostly I am defending that this is not bruteforcing T&E method others are using; but the algorithm need to be exhaustive in a way to be logical.

 

所有跟帖： 

• Very nice work! -品茗99- ♀ 給 品茗99 發送悄悄話 (306 bytes) () 10/26/2011 postreply 17:41:30

• 謝謝，不想證明什麽了。估計改用c++實現的話，可以快一百倍。 -hqw2000- ♀ 給 hqw2000 發送悄悄話 (0 bytes) () 10/28/2011 postreply 18:50:59

• 您的軟件放在網上了嗎。用什麽寫的。 -wxcfan123- ♂ 給 wxcfan123 發送悄悄話 (0 bytes) () 10/29/2011 postreply 16:21:41

• 用python 實現的，不打算放在網上。 -hqw2000- ♀ 給 hqw2000 發送悄悄話 (281 bytes) () 10/29/2011 postreply 17:13:27

請您先登陸，再發跟帖！