[EMAIL PROTECTED] wrote on 27-10-2008 14:57:54:
>
> On 27-okt-08, at 11:51, terry mcintyre wrote:
>
> > - Original Message
> >
> >> From: Mark Boon <[EMAIL PROTECTED]>
> >
> >
> >> Let me first describe what I did (ar attempted to do): all nodes are
> >> stored in a hash-table using a
computer-go-boun...@computer-go.org wrote on 07-04-2009 18:33:34:
> Thanks. What about linked lists?
> They seem to be both compact and fast to merge and detect duplicates.
> Why have you abandoned them?
Linked lists have a terrible cache behaviour: every pointer (or index)
dereference has a near
computer-go-boun...@computer-go.org wrote on 11-06-2009 23:00:56:
>
> I think one approach to scaling playouts is to subdivide the board,
> stipulate the outcome in a fixed part, and do "norman" playout in
> the interesting part. The trick is to do a reasonable subdivision
> in the first place.
x27;t blame me for the protocol; it's terrible, but we're stuck with it.
NB: My excuses for the Macro-based translation effort. Translation is
bullshit
anyway, since most users use a client and never use the commandline
or read the help pages. It was started because
computer-go-boun...@computer-go.org wrote on 18-01-2010 09:21:43:
>
> Back up a bit - what's your primary interest ? I can readily
> believe that not many "near blind" play Go on the internet now, but
> what makes you believe a properly supportive server would bring them
> out of the woods, or
computer-go-boun...@computer-go.org wrote on 18-01-2010 18:16:28:
> On Mon, Jan 18, 2010 at 05:43:34PM +0100, Adriaan van Kessel wrote:
> > computer-go-boun...@computer-go.org wrote on 18-01-2010 11:34:52:
> > > > (ii) NNGS might be used as possible base of a m
