Solving Sudoku with SQL
Okay, time to really geek out. Declarative languages are really the way to go if you're trying to teach a computer
how to solve a puzzle, and though Prolog is the king of the declarative playground, it's equally geeky to do it in SQL,
and that's what Samuel Aina did. His article Solving Sudoku
with SQL describes what his title suggests: finding the unique solution to a Sudoku puzzle using T-SQL in SQL
Server 2000. While the code isn't short (compare to, e.g., Chris Neukirchen's Prolog version), it's very clear
and well-commented and really shows off the power of declarative programming.[Via Digg]
So, just how good at time waster games are you? Think you've got the stuff? Well, The World's Hardest Game 2.0 doesn't think you do.
Yes, amazingly, it's possible to have a sequel to a game called "The World's Hardest Game". It doesn't seem logically possible, since if the first one was actually the world's hardest, how could another one come along and share the moniker? It made me doubt the name in the first place. That is, until I tried the game.
The mechanics of the game are very simple. You are a small red square, ...
