We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
and it takes forever. I would appreciate if someone could shed a light on me.
EDIT: After modifying the preemptive set method to include sets of elements, more progress can be made from deductive reasoning. Also, in each recursion level, employ every deductive techniques could reduce the guessing space significantly.
The only test cases bothering me are #8 and #9. When the candidate list is not sorted by length, #9 could pass with some luck (guessed the right candidate early in the recursion), but I tend to still sort the list for more stable performance (guessing from out of is better than guessing from out of ).
EDIT 2: Finally passed all test cases. Two more techniques added are X-wing and block-column/row interaction. Some references which could be useful:
Project Euler #96: Su Doku
You are viewing a single comment's thread. Return to all comments →
Could not pass all test cases in Python yet. Here are my techniques so far:
I tried with certain input such as:
100920000 524010000 000000070 050008102 000000000 402700090 060000000 000030945 000071006
and it takes forever. I would appreciate if someone could shed a light on me.
EDIT: After modifying the preemptive set method to include sets of elements, more progress can be made from deductive reasoning. Also, in each recursion level, employ every deductive techniques could reduce the guessing space significantly.
The only test cases bothering me are #8 and #9. When the candidate list is not sorted by length, #9 could pass with some luck (guessed the right candidate early in the recursion), but I tend to still sort the list for more stable performance (guessing from out of is better than guessing from out of ).
EDIT 2: Finally passed all test cases. Two more techniques added are X-wing and block-column/row interaction. Some references which could be useful: