Computer Plays Chess without Brute-Forcing Solutions

by Natalie Shoemaker Matthew Lai has developed an AI that approaches the game of chess more like a human.  Until recently, conventional chess-playing computers have won chess match after chess match merely through brute force — that is, considering all possible moves to find which one would most optimal. It’s the method IBM’s Deep Blue used to beat world chess champion, Gary Kasparov. It had to search through somewhere around 200 million positions per second to find the next optimal move. This processing power is beyond human, sure, but it’s a waste of energy. Compare that to Kasparov, who managed to keep up, even though his brain was only able to consider a handful of moves each second. The trick is that Kasparov’s brain was able to narrow the field…

Link to Full Article: Computer Plays Chess without Brute-Forcing Solutions

Pin It on Pinterest

Share This

Join Our Newsletter

Sign up to our mailing list to receive the latest news and updates about and the Informed.AI Network of AI related websites which includes Events.AI, Neurons.AI, Awards.AI, and Vocation.AI

You have Successfully Subscribed!