Re: [computer-go] cgos viewer feature request

2007-11-02 Thread Don Dailey
Nothing to apologize over!

I probably should have put some kind of column headings or something. 

I thought it more useful to be a count-down timer - it's much easier to
calculate how much time you took by subtraction with the previous entry
than it is to see how much time is left by adding up every entry.

- Don


Hideki Kato wrote:
 Hi Don,

 Now I understand the time is the time left!  So your code is not 
 wrong (_ _). 
 # A Japanese facemark that means I'm sorry. Don't rotate your head.

 Hideki

 Hideki Kato: [EMAIL PROTECTED]:
   
 Hi Don,

 Don Dailey: [EMAIL PROTECTED]:
 
 Hideki Kato wrote:
   
 Hi Don,

 Thank you for the additional feature.

 It seems, however, strange.  Does 04:19 mean 41.9 seconds?

 Hideki
   
 
 Hi Hideki,

 04:19 means 4 minutes and 19 seconds.I don't understand how it could
 mean 41.9 seconds.

 Is this an international thing?Is there a better way that's more
 understood than what I am doing?
   
 If so, all clients on 9x9 should lose by time.  But now 
 I'm sure that the time is completely wrong.  Please check your code.

 Hideki

 
 - Don






   
 Don Dailey: [EMAIL PROTECTED]:
   
 
 I just updated the current viewer to version 0.35.

 I added the remaining time display.

 The default server is the 19x19 server, so if you use it for 9x9 you must
 specify the server and port. You must use the options like this:

cgosview  -server server_name  -port portnum  -games 1,2,3,4,5

 Games is optional, but it will pop up all the specified games.

 - Don




 Jason House wrote:
 
   
 On Thu, 2007-11-01 at 17:05 -0400, Don Dailey wrote:
   
   
 
 The source code is included - even though you probably don't realize
 it.There is a utility that will unpack the kit and reveal the source
 code.   Then you can fix it, pack it back up and run it.Google for
 sdx.kit and tclkit and equi4 and you will find the details.   It's a
 tcl/tk program. 
 
 
   
 For those considering doing this, here's some help... (I hope, I'm just
 figuring this out now)

 You'll need to download tclkit from [1] and sdx from [2].  sdx assumes
 it can find tclkit, so after unpacking, you must rename it.
 Similarly, sdx will download as sdx.kit and the instructions I found say
 to rename it to sdx.

 The sdx unwrap (and wrap) should then be all that's needed to access the
 source.

 [1] http://www.equi4.com/pub/tk/8.4.16/
 [2] http://www.equi4.com/wikis/equi4/206

   
   
 
 I think this would be relatively easy to do and a good feature.While
 you are at it,  add the feature to display the time used for each move 
 :-)

 - Don


 Chris Fant wrote:
 
 
   
 It would be nice to be able to automatically follow all the games for
 a certain bot.
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/

   
   
   
 
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/
 
 
   
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/

   
   
 
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/
 
   
 --
 [EMAIL PROTECTED] (Kato)
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/

   
 
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/
   
 --
 [EMAIL PROTECTED] (Kato)
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/
 
 --
 [EMAIL PROTECTED] (Kato)
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/

   
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/


[computer-go] Rapid action value estimation

2007-11-02 Thread Jason House
I'd like to implement RAVE as described in [1].  I believe I have a very
clear understanding of how to do this at the leaves of the UCT search tree.
What I'm not sure about is how to apply RAVE results higher in the UCT
tree.  Does anyone have any experience with this that they're willing to
share?


[1] http://www.machinelearning.org/proceedings/icml2007/papers/387.pdf
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Re: [computer-go] CGOS on sourceforge

2007-11-02 Thread Heikki Levanto
On Thu, Nov 01, 2007 at 08:57:38PM -0400, Joshua Shriver wrote:
 In that case I stand happily corrected. I once was going to release
 and one of the stipulations what that it had to be reassigned to the
 FSF. Couldn't remember if it was sourceforge, gnu, or what...

GNU Go has this requirement.

-H

-- 
Heikki Levanto   In Murphy We Turst heikki (at) lsd (dot) dk

___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/


[computer-go] 9x9 CGOS

2007-11-02 Thread Christoph Birk

It appears that CGOS (9x9) is down.

Christoph
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/


Re: [computer-go] Rapid action value estimation

2007-11-02 Thread Christoph Birk

On Fri, 2 Nov 2007, Benjamin Teuber wrote:

I don't think there's something different at different depths in the tree..
To update RAVE after a simulation, for each child of a node you visited
during that simulation, you update if the move leading to the child was
played later (until the end of the playout).
Then, always when you calculate the UCT value, you combine that with the
RAVE value with that weighted average formula to give the final score.
Of course, you need to be careful with signs :-)


That means you have one global 'RAVE' table?
Or one at each node in the UCT tree?

Christoph
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/


Re: [computer-go] Rapid action value estimation

2007-11-02 Thread Benjamin Teuber
I don't think there's something different at different depths in the tree..
To update RAVE after a simulation, for each child of a node you visited
during that simulation, you update if the move leading to the child was
played later (until the end of the playout).
Then, always when you calculate the UCT value, you combine that with the
RAVE value with that weighted average formula to give the final score.
Of course, you need to be careful with signs :-)

Btw, I don't really see a point in calculating and adding the confidence
bound for RAVE as well, as all moves will have been played almost equally
often - thus I dropped the term..
Maybe Sylvain or someone else can comment on this..

Another thing - I didn't believe that you need to do RAVE seperately for
both colors (i.e. you should only consider later moves on the point by the
same color), as e.g. Peter Drake mentioned in a paper of his. But after some
experiments I changed my mind and think he is right =)

Cheers,
Benjamin

On 11/2/07, Jason House [EMAIL PROTECTED] wrote:

 I'd like to implement RAVE as described in [1].  I believe I have a very
 clear understanding of how to do this at the leaves of the UCT search tree.
 What I'm not sure about is how to apply RAVE results higher in the UCT
 tree.  Does anyone have any experience with this that they're willing to
 share?


 [1] http://www.machinelearning.org/proceedings/icml2007/papers/387.pdf

 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/

___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Re: [computer-go] Rapid action value estimation

2007-11-02 Thread Benjamin Teuber
I store it in the normal uct tree,
so that each node has variables raveVisits and raveWins besides uctVisits
and uctWins.
So a node in the UCT-DAG can either represent a position or a move.

On 11/2/07, Christoph Birk [EMAIL PROTECTED] wrote:

 On Fri, 2 Nov 2007, Benjamin Teuber wrote:
  I don't think there's something different at different depths in the
 tree..
  To update RAVE after a simulation, for each child of a node you visited
  during that simulation, you update if the move leading to the child was
  played later (until the end of the playout).
  Then, always when you calculate the UCT value, you combine that with the
  RAVE value with that weighted average formula to give the final score.
  Of course, you need to be careful with signs :-)

 That means you have one global 'RAVE' table?
 Or one at each node in the UCT tree?

 Christoph
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/

___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/