[info] [Beowulf] Go-playing machines

[Eugen Leitl]

----- Forwarded message from "Peter St. John" <peter.st.john at gmail.com> -----

From: "Peter St. John" <peter.st.john at gmail.com>
Date: Tue, 24 Jun 2008 12:20:25 -0400
To: Beowulf Mailing List <Beowulf at beowulf.org>
Cc: 
Subject: [Beowulf] Go-playing machines


   Programming a computer to play Go (an Asian strategy boardgame) has
   been difficult; some people say it's proof that Go is better or harder
   than chess, since computers can beat masters at chess but struggle at
   Go. (I think that statistically a game of go is about equivalent to a
   two-game match of chess; both games empty your brain quickly of
   course). My view is that while go may be somewhat harder to reduce to
   tree-searching, the main advantage of computer chess was an early
   start, e.g. von Neumann.
   This article:
    [1]http://www.usgo.org/resources/downloads/CogApdx%20II-2.pdf
   describes recent trends in computer Go and mentions a 32-node cluster,
   8 cores per node. Apparently MPI parallelization is recent for them
   and they are making good progress.
   Peter
   The game Go: [2]http://en.wikipedia.org/wiki/Go_%28game%29
   AGA (American Go Association): [3]http://www.usgo.org

References

   1. http://www.usgo.org/resources/downloads/CogApdx%20II-2.pdf
   2. http://en.wikipedia.org/wiki/Go_%28game%29
   3. http://www.usgo.org/

_______________________________________________
Beowulf mailing list, Beowulf at beowulf.org
To change your subscription (digest mode or unsubscribe) visit http://www.beowulf.org/mailman/listinfo/beowulf


----- End forwarded message -----
-- 
Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org
______________________________________________________________
ICBM: 48.07100, 11.36820 http://www.ativel.com http://postbiota.org
8B29F6BE: 099D 78BA 2FD3 B014 B08A  7779 75B0 2443 8B29 F6BE