Author: Dann Corbit
Date: 15:34:05 12/12/02
Go up one level in this thread
On December 12, 2002 at 18:10:23, J. Wesley Cleveland wrote: [snip] >There is one difference. To write a full, formal proof by induction might take >me a couple days, at which point you have a proof it is won. Your minimax >algorithm would still be running when the universe ended and you would not know >whether or not it is won until it finished. There are other differences as well. We already know that a finite game has a solution. For the subset example, we can easily solve it. We can do a search or we can write an algorithm. The question is: Will the subdivision algorithm be faster than a minimax search where the best move is always chosen (hence delivering the sqrt(n) performance)? It may be that these cases (both solving a subset and blocked position recognizers) may be faster than always choosing the best move first in a search. I do repent in dust and ashes. Even at that, I still think the solution will be close enough to sqrt(n) that any difference will be negligible. However, I do now fully realize that I cannot prove it.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.