Sunday, October 21, 2007

Sudoku

Open question:
Is there an algorithm to find the solvability of a Sudoku that is computationally faster than the algorithm to actually solve it?

3 comments:

Hobbes said...

nope. thats mathless i guess so its without basis... but i see it like the amount of time it would take to find the algorithm equals waaay longer than it would take to solve the puzzle manually... or i think i learned this term yesterday and i hope im applying it right.... enough elipsies.

but uhm, brute forcing it would take infinitely less time than finding the algorithm. and if you found one, eventually, i think implementing it will basically generate so many possible... well wait. tangent.

the real comment: no. the algorithm will be like a brute force solution... except with more steps. maybe fewer misteps but once the puzzles reach a certain square squarage the misteps wont even matter. brute force will just be faster.

Hobbes said...

also, circle strafing in gta san andreas is impossible. whoever invented circle strafing needs to die, or needs to have died recently enough for me to derive some sort of satisfaction from his not being with us now.

Jieren Chen said...

Circle strafing in GTAaaaaaaaa Saaaaaaaaaaa is not impossible, only extremely difficult, largely because you can't really move back while side-stepping. Good thing GTAaaaaa SAaaaaaa is the complete opposite of reality, where you don't find giant hearts lying around that restore nasty bullet wounds and shank holes.

Speaking of skank holes, the homosexual tendencies of circle strafing pale in comparison to the tactic of com-dancing in Supreme Commander. Whoever invented that needs to be fed 500 dextroamphetamine pills (30mg only, of course) so that their ADHD, communism-loving, 14-year old hearts will fucking explode. ede edd ed.