-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1
Christoph Birk wrote: > On Tue, 2 Oct 2007, Don Dailey wrote: >> He wasn't talking about reading at all. I was being nice when I said >> he wasn't talking about that kind of reading - giving you the benefit of >> the doubt. > > Please explain what he meant by "calculating about as deeply". Hsu thinks in terms of chess programming and from the article he was comparing the depth of the search of Chess to Go, trying to make a case that with modern hardware you would be able to search to the same depths that Deep Blue used to search in chess. So a chess search normally iterates until it runs out of time - searching 1 ply, then 2, then 3 etc. So when he says "as deeply" he means that if Deep blue did a 12 ply search (for instance) he thought a Go program might manage a 12 ply search (I disagree, but that's beside the point.) Of course 12 ply doesn't really mean exactly 12 ply - it means a highly selective search where you might look up to 20 or 30 ply with extensions and quiescence. I'm using 12 ply as an example, I don't know how deep Deep Blue actually searched. In Chess it is very common for good players to look very deeply in tactical situations and endgames. There is nothing special about searching this deeply in chess, it's done in most 2 player games of perfect information and of course in Go it's called "reading." - - Don > Thank you, > Christoph > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ > -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFHAuq9DsOllbwnSikRAt3nAKCudyGRKCuMmYgQggfBZc5Pfvd73wCfeWtF A3Gi4fb4yx7PoQetLSB7Mhg= =ylAl -----END PGP SIGNATURE----- _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
