Images of newer times


#41

Who needs stones?


#42

@: https://www.theguardian.com/science/2017/oct/18/its-able-to-create-knowledge-itself-google-unveils-ai-learns-all-on-its-own


#43


#44

Clearly a beginner, look how he’s holding the stone :wink:


#45

Lol!!


#46


#47

(stolen somewhere on the Web … can’t remember the sources)


#48

Awesome!


#49

Photoshop :wink:


#50

Great pic!


#51

“Meanwhile, in Russia…”


#52

No Vodka? A game without Russian Antifreeze? Unthinkable.


#53

Nope, that was from the first Google DeepMind Challege – the game which Lee Sedol won against AG :slight_smile:


#54

Small section of the combinatorial game tree for the game of Go. The branching factor, or the number of possible moves in any position is about 200 for Go, which is an order of magnitude more complex than the 20 found in the game of chess.

see: https://blogs.loc.gov/maps/2016/04/alphago-neural-networks-and-toblers-first-law/


#55

Are you sure about 20 for chess? I would have thought it would be more than that.


#56

Cho and Shida contemplate their game on a recording from Japanese TV.


#57

From Branching Factor, on Wikipedia:

For example, in chess, if a “node” is considered to be a legal position, the average branching factor has been said to be about 35. This means that, on average, a player has about 35 legal moves at his disposal at each turn. By comparison, the branching factor for the game Go is 250.

giphy


#58

35, that sounds more like it.

Magnetic Go set, advertised in the BGJ #50 (1980).

Magnetic Go set, advertised in the BGJ #52 (1980).


#59


#61