A Google computer program just beat one of the world masters at the game of Go. There’s a lesson in that for us.
Go is an ancient (2,500 years old) board game that is both simple in theory and incredibly complex in execution. It has been described as “a non-chance, combinatorial game with perfect information, non-cooperative and zero-sum.” That sounds a lot like litigation. According to Wikipedia, the possible number of moves is 10,761 compared, for example, with the estimated 10,120 in chess.
This content has been archived. It is available through our partners, LexisNexis® and Bloomberg Law.
To view this content, please continue to their sites.
Not a Lexis Subscriber?
Subscribe Now
Not a Bloomberg Law Subscriber?
Subscribe Now
LexisNexis® and Bloomberg Law are third party online distributors of the broad collection of current and archived versions of ALM's legal news publications. LexisNexis® and Bloomberg Law customers are able to access and use ALM's content, including content from the National Law Journal, The American Lawyer, Legaltech News, The New York Law Journal, and Corporate Counsel, as well as other sources of legal information.
For questions call 1-877-256-2472 or contact us at [email protected]
