[computer-go] Some beginner's questions concerning go bots

Hi, I have been lurking around in this group for sometime and recently have become interested in perhaps doing some coding and data gathering for constructing a simple go bot. I have a few basic questions I was wondering if people in the group could help me answer- 1) How typically do UCT

Re: [computer-go] Some beginner's questions concerning go bots

Thanks everyone for the responses. My go skills are somewhat limited (only 6-7kyu on KGS) so hopefully I am not belaboring the obvious. I have a few followup questions- 1) What mathematically is a seki? I know this is a local draw but can it be determined statically at some point in all cases

Re: [computer-go] Some beginner's questions concerning go bots

Thanks for the responses. 1) I guess for this seki question I was wondering if it was as easy to define as liveness without seki. The reason I am interested in this is I am curious about absolutely correct scoring functions and whether they currently cope well with advanced seki situations or

[computer-go] a few more questions

Thanks for all the comments so far. Hopefully you don't mind a few more questions. 1) Do UCT bots check for atari and urgency? my understanding was that first generation Mogo did this to some extent IIRC. I am curious if anyone does this it seems like it might be important but so far I cannot

Re: [computer-go] 10k UCT bots

How do LD modules generally function? Is this discussed in the literature somewhere? The only open source LD module I am aware of is the one in GNU-go and I am not certain how good or bad it is since my own playing strength isn't that good. I have found some papers on this topic but most do not

Re: [computer-go] a few more questions

Thanks for the help with this. I suspect I will go directly for a heavy playout implementation and avoid writing some of the trickier the light playout code so I probably will be implementing this soon. ___ computer-go mailing list

Re: [computer-go] batch size and impact on strength

I think I being was a bit unclear here. By UCT I meant the combination of UCT+Simulation. I am just curious why simulation based methods of evaluation are thus far found to be superior (are they on 19x19?) to traditional bots which have a different form of evaluation function for a given

Re: [computer-go] batch size and impact on strength

Thanks for the reply. 2) learned pattern weights are not learnt through TD(lambda). RLGO is not used in mogo. It was used a long time ago. Hand-designed heuristics are much more efficient (in particular after heavy cluster-based tuning of coefficients). I am not entirely sure what you

Re: [Fwd: Re: [Fwd: Re: [computer-go] Computer Olympiad registration reminder: 11 days left]]

Thanks Remi. Are standard accommodations being provided by the site organizers or will we have to for the most part make our own arrangements? I guess I have a few more days to decide whether or not to submit a basic program which most likely will not win any games given how stiff the

[computer-go] Basic question concerning the edges of the board

Hi, I have again been considering trying my hand at implementing a simple go program. The question I have pertains to checking for the edge of the board in capture situations and so on. For a modern CPU (given what limited information I have on this) the extra branches might result in

Re: [computer-go] Basic question concerning the edges of the board

and diagonals. David -Original Message- From: computer-go-boun...@computer-go.org [mailto:computer-go- boun...@computer-go.org] On Behalf Of Carter Cheng Sent: Monday, July 13, 2009 8:36 AM To: computer-go@computer-go.org Subject: [computer-go] Basic question concerning the edges

[computer-go] memory management for search trees(basic question)

This is something I have been curious about since I am somewhat new to writing code in languages which require explicit memory management (as opposed to have some sort of garbage collector do it for you). The question is how do most programs manage memory w.r.t. the search nodes? Is the memory

Re: [computer-go] memory management for search trees(basic question)

will see a slowdown and I think there is a memory overhead penality for using this as it probably needs working space. - Don On Tue, Jul 14, 2009 at 11:06 AM, Carter Cheng carter_ch...@yahoo.com wrote: This is something I have been curious about since I am somewhat new

Re: [computer-go] memory management for search trees(basic question)

I have a good number of C++ books but strangely though I use to own Meyers' first 2 books I have sort of misplaced them. Perhaps I should get a couple new copies. I will study the Boost Pool source and see what I can glean from it. The only custom allocator design I have on hand in a book is

[computer-go] gtp which version to implement?

Thanks everyone for the help thus far. I have been looking at the GTP protocol page and I am curious which version of the protocol I should try to implement if I want to communicate with the servers. Should I be looking at the GTP 2.0 draft version? Thanks in advance, Carter.

Re: [computer-go] gtp which version to implement?

version to implement? To: computer-go computer-go@computer-go.org Date: Wednesday, July 15, 2009, 2:44 AM On Wed, 2009-07-15 at 11:24 +0200, Urban Hafner wrote: Carter Cheng wrote: Thanks everyone for the help thus far. I have been looking at the GTP protocol page and I am curious which

Re: [computer-go] gtp which version to implement?

at 9:41 AM, Carter Cheng carter_ch...@yahoo.com wrote: Where can I find information on these bridging protocols or are libraries provided for this (to the 9x9 19x19 servers)? The CGOS protocol is pretty easy to decode from the cgos client script which is written in TCL.   Even if you

[computer-go] Erlang and computer go

I have been considering experimenting with Erlang as a means of prototyping certain aspects of a computer go program and I was curious if anyone has tried this already. How does a system like Erlang compare performance wise to writing something in say C/C++ (fastest) or Java? Thanks in

Re: [computer-go] Erlang and computer go

Thanks both I guess I will stick with C/C++ for now. I have looked at Scala before though not in this particular context. It looks like a pretty compelling language with some pretty nice features (true lambda functions, argument pattern matching among others). JVM performance does concern me

[computer-go] representing liberties

I have been having difficulties selecting a good representation for liberty sets for strings of stones. I am curious how other people might be doing this. I suspect that for heavier playouts one would like to know not only the count of the liberties but also where precisely they might be

Re: [computer-go] representing liberties

: Don Dailey dailey@gmail.com Subject: Re: [computer-go] representing liberties To: computer-go computer-go@computer-go.org Date: Friday, August 14, 2009, 2:33 PM On Fri, Aug 14, 2009 at 5:13 PM, Carter Cheng carter_ch...@yahoo.com wrote: I have been having difficulties selecting

Re: [computer-go] representing liberties

How do these link list of liberties and array of liberties variants work? Are they sorted lists/arrays? I considered bitmaps but it seemed in many ways a bit wasteful i.e. in most cases for a given group the bitmap probably is extremely sparse. Also if you are trying to identify individual