This is a program I wrote back in 2005 playing what was once deemed in the media to be "the world's hardest sudoku puzzle" ─ as though, somehow, that phrase makes any sense ─ which I chose solely to give the program at least some sort of crude benchmark. What's happening in this video usually takes between 650 - 850 ms in realtime depending on how many other jobs I had my computer working on at the time. The program was able to accomplish this after I had only written 3 aggressive strategies, i.e. deduction algorithms, and 1 passive strategy, i.e. trial-and-error, brute force, to use to solve the puzzle. I was so shocked at how fast it could solve any sudoku puzzle I put into it that once this happened I just thought, "Alright, then, looks like I'm done coding the engine." Last month, I came upon the program again and found myself getting very curious of what the sudoku board looked like when it was playing it. So, I wrote an offshoot version and had it redraw its workspace ─ which was actually a 6-dimensional array with 2 dynamic dimensions and 4 constant dimensions ─ onto the UI and scrrencap it every time it made or rolled back a deduction and assembled the screencaps in Blender.

Loading more stuff…

Hmm…it looks like things are taking a while to load. Try again?

Loading videos…