The game of go as a complex network

Computer Science – Computer Science and Game Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 9 figures, final version

Scientific paper

10.1209/0295-5075/97/68002

We study the game of go from a complex network perspective. We construct a directed network using a suitable definition of tactical moves including local patterns, and study this network for different datasets of professional tournaments and amateur games. The move distribution follows Zipf's law and the network is scale free, with statistical peculiarities different from other real directed networks, such as e. g. the World Wide Web. These specificities reflect in the outcome of ranking algorithms applied to it. The fine study of the eigenvalues and eigenvectors of matrices used by the ranking algorithms singles out certain strategic situations. Our results should pave the way to a better modelization of board games and other types of human strategic scheming.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The game of go as a complex network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The game of go as a complex network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The game of go as a complex network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-497094

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.