
www.Usenet.com
| <-- __Chronological__ --> | <-- __Thread__ --> |
Last time I read about it a few years ago, I learned that one of the obstacles to using Conway's theory of games to study the game of Go is the difficulty of dealing with ko fights, since they screw up well foundedness. I wondered whether one might be able to do better by dealing with non-well founded models of set theory to set up Conway's theory of games and maybe apply it to Go. I don't claim that it would let one decide how to win a ko fight, but it might at least let one talk about it. Maybe someone has figured out another way to apply Conway's stuff to ko? Ignorantly, Allan Adler [EMAIL PROTECTED] **************************************************************************** * * * Disclaimer: I am a guest and *not* a member of the MIT Artificial * * Intelligence Lab. My actions and comments do not reflect * * in any way on MIT. Moreover, I am nowhere near the Boston * * metropolitan area. * * * ****************************************************************************
| <-- __Chronological__ --> | <-- __Thread__ --> |