September 13, 2010
It is always interesting to see computing power used to completely solve a game such as Connect Four or Checkers.
Now, it has been proven that every position of a Rubik’s Cube can be solved in 20 moves or less.
“It took fifteen years after the introduction of the Cube to find the first position that provably requires twenty moves to solve; it is appropriate that fifteen years after that, we prove that twenty moves suffice for all positions.”
December 6, 2008
[Very busy at work right now, so posts will taper off until I get to the holiday at the end of the month. That said, I do have some 20+ posts drafted. Rest assured, more content is on the way.]
Being a member of the IEEE, I regularly browse the latest issue of IEEE Spectrum. The most recent issue (December 2008) includes an article entitled “Bots Get Smart” by Jonathan Schaeffer, Vadim Bulitko, and Michael Buro. The main topic of the article is the improving of game AI in order to provide better experiences for players.
One of the parts that stood out to me was this paragraph:
Read the rest of this entry »