>>> * Besides... solving a > *>>* pspace-complete problem would require infinite memory... isn't > that correct? > * >> nope. > > I flipped memory and time there. If pspace-complete is not in p, then it > will be a big problem trying to solve it without infinite time. That doesn't > seem like an ideal situation for solving it.
I believe go, on any size board, is already solved (using the minimax algorithm) in both finite time and memory. (At least for a ruleset using super-ko; I'm not so sure about Japanese rules.) Darren -- Darren Cook, Software Researcher/Developer http://dcook.org/mlsn/ (English-Japanese-German-Chinese-Arabic open source dictionary/semantic network) http://dcook.org/work/ (About me and my work) http://darrendev.blogspot.com/ (blog on php, flash, i18n, linux, ...) _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
