Counting and indexing Sudoku solutions

Posted in Uncategorized on Mar 03, 2007

Profesor Watanabe has finalized his method for efficiently index and provide an index number to each Sudoku problem (I wrote about a discussion with him on the topic I had last summer here). The number of different Sudoku problems (and solutions since each problem has only one solution, the reason why it is so interesting) is 6,670,903,752,021,072,936,960 and it was already discovered in 2005 by Bertram Felgenhauer and Frazer Jarvis and now what Watanabe-sensei has discovered is how to efficiently assign a number to each Sudoku problem, a task that obviously cannot be done efficiently looking at each solution due to the huge amount. You can see and try their method here.

 

CD

Share on Facebook

Trackback URI | Comments RSS

Leave a Reply


  • You Avatar
    I am the director for Internet and Multimedia for Telefónica R&D, based in Barcelona where I managed their R&D center. I have been a bit all over the place for the last 15 years, specially in Tokyo, my favorite town, and finally came back in mid 2006 to my home town. I like everything that has to do with the Internet, computers, software and gadgets, not just the geeky aspect but also the business side. I also love reading (business essays mainly) and TV series and movies as well as having a good dinner and night out with my friends.


This site employs the Wavatars plugin by Shamus Young.