RE: computer-go: perfect play

[<Michael.Collins@xxxxxxx>]

Isn't there still a problem?

People play in different ways....
The game works in different ways..,....

Surely there's a possibility that a tree gives two equal solutions ( it
happens quite often depending how you do the analysis... there's more than
just the binary tree )...

Sorry...
That didn't explain anything...

Depending upon your opponent there are different 'better' moves...

Who/How are you playing...
( another point for consideration being as I'm a ludicrous amateur, doesthe
progression ever change and is there ever anything that's perfect..? )...

Yet another side issue would be if we had a computer version that was
apparently 'perfect' then surely it should play different moves based on
the ability and style of the opponent...

Is there a perfect move?

Regards,
Mike...



|--------+----------------------------------->
|        |          "TMCooper"               |
|        |          <tmcooper@xxxxxxxxxxxxxxxxx|
|        |          >                        |
|        |          Sent by:                 |
|        |          owner-computer-go@lists.u|
|        |          oregon.edu               |
|        |                                   |
|        |                                   |
|        |          26-09-00 18:35           |
|        |          Please respond to        |
|        |          computer-go              |
|        |                                   |
|--------+----------------------------------->
  >-------------------------------------------------------------------------------------------------------------------------------|
  |                                                                                                                               |
  |       To:     <computer-go@xxxxxxxxxxxxxxxxx>                                                                                 |
  |       cc:                                                                                                                     |
  |       Subject:     RE: computer-go: perfect play                                                                              |
  >-------------------------------------------------------------------------------------------------------------------------------|






>
<snip>
> *** First, I think it is obvious that perfect play is not possible
without
> knowledge of the full game tree. This knowledge can be explicit
> or implicit
> (as in "my dad analyzed the position from here and told me this is the
> winning sequence"). Even if some shortcut may exist, for it to
indubitably
> be "perfect" it has to be based on someone's analyze of the full tree.
>
<snip>

Isn't alpha-beta pruning a refutation of this?

Tom.