RE: computer-go: perfect play

["Johan Roos (QCS)" <Johan.Roos@xxxxxxxxxxxxxxxxxxx>]

I think the definition of GoDevil is non-deterministic is not so interesting. It's hard to analyse his play ;-)

Think of the player A who will win a tournament(all againt all counting won matches) where all possible deterministic players are competing, including GoGod.

If the non-deterministic term GoDevil is already taken I think considering player A is interesting.
(There are surely several players of A's quality, though)

/Johan

-----Original Message-----
From: Nick Wedd [mailto:Nick@xxxxxxxxxxxxxxxxx]
Sent: den 28 september 2000 22:37
To: computer-go@xxxxxxxxxxxxxxxxx
Subject: Re: computer-go: perfect play


Mark Boon <tesuji@xxxxxxxxxxxxxxxxx> writes
>Sorry, I don't understand the definition of the GoDevil here at all. Can you
>elaborate?

GoGod plays the best move.  Given a choice of winning moves, or of
losing moves, He chooses the one that maximises his score, assuming
perfect play.

GoDevil does not assume perfect play.  He knows of all his opponent's
weaknesses and misconceptions, and plays to take advantage of these.

Nick
-- 
Nick Wedd    nick@xxxxxxxxxxxxxxxxx