DBpedia – Linked Data Fragments

Matches in DBpedia 2016-04 for { <http://www.wired.com/2014/05/the-world-of-computer-go/> ?p ?o }

• the-world-of-computer-go accessDate "2015-12-08".
• the-world-of-computer-go accessdate "2014-06-02".
• the-world-of-computer-go accessdate "2014-12-24".
• the-world-of-computer-go at "The Electric Sage Battle".
• the-world-of-computer-go date "2014-05-12".
• the-world-of-computer-go date "2014-12-05".
• the-world-of-computer-go department "Business".
• the-world-of-computer-go first "Alan".
• the-world-of-computer-go isCitedBy Branching_factor.
• the-world-of-computer-go isCitedBy Crazy_Stone_(software).
• the-world-of-computer-go isCitedBy Go_(game).
• the-world-of-computer-go journal "Wired".
• the-world-of-computer-go last "Levinovitz".
• the-world-of-computer-go publisher Wired_(website).
• the-world-of-computer-go quote "The rate at which possible positions increase is directly related to a game’s “branching factor,” or the average number of moves available on any given turn. Chess’s branching factor is 35. Go’s is 250. Games with high branching factors make classic search algorithms like minimax extremely costly.".
• the-world-of-computer-go title "The Mystery of Go, the Ancient Game That Computers Still Can't Win".
• the-world-of-computer-go title "The Mystery of Go, the Ancient Game That Computers Still Can’t Win".
• the-world-of-computer-go url the-world-of-computer-go.
• the-world-of-computer-go url "http://www.wired.com/2014/05/the-world-of-computer-go/".
• the-world-of-computer-go work Wired_(website).