Peg Solitaire With Python and MongoDB
David Taylor:
Anyway to cut a long story short my attempt eventually failed because my mathematical naivety hid the fact that a brute force attack would result in far too many hours of computation and a database that was simply too vast. I gave up after running it for three hours and it was showing that it had computed 24 million board states, it still had 18 million un-computed child boards to investigate and had a 23Gig database. I think it is still possible to do this almost completely with brute force if I remove symmetrical board states (apparently if done right there are only 23 million possible board states when symmetry is considered) but that is way beyond just investigating the technology and object orientation.
Peg Solitaire sounds like a good excuse to look into Python and MongoDB.
Original title and link: Peg Solitaire With Python and MongoDB (©myNoSQL)
via: http://davidandrewtaylor.blogspot.co.uk/2012/05/python-and-nosql-after-listening-to.html
