”Invented over 2500 years ago in China, Go is a pastime beloved by emperors and generals, intellectuals and child prodigies. Like chess, it’s a deterministic perfect information game — a game where no information is hidden from either player, and there are no built-in elements of chance, such as dice.1 And like chess, it’s a two-person war game. Play begins with an empty board, where players alternate the placement of black and white stones, attempting to surround territory while avoiding capture by the enemy. That may seem simpler than chess, but it’s not. When Deep Blue was busy beating Kasparov, the best Go programs couldn’t even challenge a decent amateur. And despite huge computing advances in the years since — Kasparov would probably lose to your home computer — the automation of expert-level Go remains one of AI’s greatest unsolved riddles.”
Citerat ur ”The Mystery of Go, the Ancient Game That Computers Still Can’t Win” av Alan Levinovitz i Wired, 12 maj 2014. Datorer kan matcha eller överglänsa människor i schack, Othello, Alfapet, backgammon, poker och Jeopardy. Men inte i Go. Vad kan man dra för slutsatser av det?