“ wrote algorithms without having a computer-many young scientists would never believe that was possible. Afterwards, the victorious Kasparov paid tribute to the legendary programmer, stating: “I suppose you might call it primitive, but I would compare it to an early car-you might laugh at them but it is still an incredible achievement.” The man who many think is the greatest chess player of all time mopped the floor with Turbochamp in just 16 moves. The little program from 1950 was no match for the Russian grandmaster, who had won against IBM’s “Deep Blue” back in 1996, but later lost to an IBM supercomputer in 1997. The algorithm’s opponent that day? Garry Kasparov, of course. In June 2012, as part of the University of Manchester’s Alan Turing Centenary Conference, “Turbochamp” finally got a chance to prove its acumen in front of the world. The British government didn’t declassify the work of Turing and his Bletchley Park colleagues until the 1970s, and Turing’s own record of the cracking of the Enigma code wasn’t published until the 1990s. Turing’s wartime triumphs and early artificial intelligence accomplishments fell in to obscurity. Turing had been prosecuted, and chemically castrated, due to his relationship with another man in 1952. He died from cyanide poisoning in 1954–two weeks shy of what would have been his 42nd birthday. Turing never got to see his program executed by an actual computer. One idea Ive been exploring is how we could potentially use Machine Learning algorithms and structures to build a better chess computer (chess engine).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |