Hi all. I'm looking at some graph theory approaches to Go, and wondering if anyone has come up with a workable adjacency matrix representation for the board? It's not entirely clear what "adjacent" means with regards to the interface between black & white stones, stones at a distance, etc. Same color stones next to each other is quite different from opposite color stones next to each other. Any thoughts?
Steve.
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
