not really, like tic-tac-toe, where complete analysis is possible.

送交者: steven 于 2007-10-27, 01:52:32:

回答: The problem is that you may not be able to decide one move ... 由 xinlihuaxys 于 2007-10-27, 01:43:23:

You can always make the best move. Of course, for all non-trivial combinatoric games, complete analysis is not possible with the currently computing power.

所有跟贴:

加跟贴