[computer-go] 19x19 CGOS

[Jason House]

While I don't own a copy of Many Faces (and probably won't for a while),
what you suggest would be a big help to my use of it.

On Sun, 2007-10-28 at 09:27 -0700, David Fotland wrote:
> Would anyone be interested in a highly configurable version 11 with gtp
> interface?
> 
> Version 11 has a set of parameters that control the searching that I can
> easily read from a file.  
> 
> /* LEVELS:    1  2  3  4  5  6  7  8   9  10  */
> int maxmoves[NUMLEVELS] =   /* maximum number of moves to try on full board
> */
>         {  0, 2, 4, 5, 6, 8,10,12, 15, 20, 28 };  /* lots, so in endgame can
> look at lots of moves */
> int maxvariations[NUMLEVELS] =  /* max number of leafs per move tried */
>         {  0, 1, 1, 2, 2, 3, 4, 5, 7,  10,  13 };
> char maxscorebrdepth[NUMLEVELS] =	/* max depth for any branches in
> getscore scorebestmove */
> 		{  0, 0, 0, 1, 1, 2, 2, 2, 2,  3,  3 }; 
> char maxscoredepth[NUMLEVELS] = /* max depth for getscore */
>         {  0, 0, 0, 1, 1, 2, 2, 3, 3,  3,  4 };
> int maxlifecalls[NUMLEVELS] =  /* total evaluations, should be around
> maxmoves*maxvariations */
>         {  0, 5, 9,13,20,30,45,65,95,200,400 };
> 
> /* LEVELS:    1  2  3  4  5  6  7  8   9  10  */
> unsigned char taclibs[NUMLEVELS] =     /* max liberties in a tactical fight
> */
>         {  0, 2, 2, 3, 3, 3, 3, 4, 4,  4,  4 };
> unsigned char eyetaclibs[NUMLEVELS] =     /* max liberties for eye diagonal
> */
>         {  0, 2, 2, 2, 2, 2, 3, 3, 3,  3,  3 };
> int cancapsize[NUMLEVELS] = /* size of search in canbecaptured */
>         {  0, 7,10,15,20,30,40,60,80,110,150 };
> unsigned char eyecapsize[NUMLEVELS] = /* size of search for eyes diags */
>         {  0, 2, 3, 4, 5,10, 15,20,25,30, 40 };
> unsigned char eyecapdepth[NUMLEVELS] = /* depth of search for eyes diags */
>         {  0, 2, 2, 3, 3, 4, 5, 6, 6,  6,  6 };
> unsigned char conncapsize[NUMLEVELS] = /* size of search for connections */
>         {  0, 4, 6, 8,10, 20,30,40,55,80,100 };
> unsigned char conncapdepth[NUMLEVELS] = /* depth of search for connections
> */
>         {  0, 2, 3, 4, 5, 7, 8, 9,10, 12, 14 };
> char mvmost[NUMLEVELS] =    /* number of moves considered for ladder at each
> ply */
>         {  0, 1, 1, 2, 2, 2, 2, 3, 3,  3,  3 };
> char eyemost[NUMLEVELS] =    /* number of moves considered for ladder at
> each ply */
>         {  0, 1, 1, 1, 2, 2, 2, 2, 2,  3,  3 };
> char connmost[NUMLEVELS] =    /* number of moves considered for ladder at
> each ply */
>         {  0, 1, 1, 1, 2, 2, 2, 2, 2,  3,  3 };
> int maxbranchdepth[NUMLEVELS] = /* maximum depth for branches in tactical
> move tree (unless move values are close) */
>         {  0, 1, 2, 2, 3, 3, 4, 4, 4,  4,  4 };
> int maxtacdiff[NUMLEVELS] =  /* maximum difference between best tac move and
> this move*/
>         {  0,16,16,16,32,64,64,96,120,180,250 };
> int mintacval[NUMLEVELS] =   /* minimum value move has to be considered
> tacticaly */
> 		{  0, 0, 0, 0, 0,-10,-10, -10,-16,-20,-31 };
> int numpotmoves[NUMLEVELS] =   /* Number of moves to read for adpot() to
> capture group */
> 		{  0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 2 };
> 
>         
> /* LEVELS:    1  2  3  4  5  6  7  8   9  10 */
> int maxjosvariations[NUMLEVELS] =  /* max number of joseki variations -
> endpoints per first level joseki move */
>         {  0, 1, 1, 1, 1, 1, 2, 3, 3,  4,  6 }; 
> int maxpatvariations[NUMLEVELS] =  /* max number of pattern variations per
> move */
>         {  0, 1, 1, 1, 2, 2, 2, 3, 4,  5,  6 }; 
> int maxjosbranches[NUMLEVELS] =  /* max number of joseki variations per move
> at depth 1 */
>         {  0, 1, 1, 1, 1, 1, 2, 2, 2,  2,  3 }; 
> unsigned char mdist[NUMLEVELS] =      /* distance to radiate influence from
> live groups */
>         {  0, 7, 8, 9, 10, 11, 11, 12, 12,  13,  13 };
> 
> 
> /* Fights: no fight reading below level 5 */
> /* LEVELS:    1  2  3  4  5  6  7  8   9  10 */
> int maxfightbranches[NUMLEVELS] =  /* max number of fight variations per
> move */
>         {  0, 1, 1, 1, 1, 1, 2, 2, 2,  3,  3 }; 
> char maxfightdepth[NUMLEVELS] = /* max depth for reading fight */
>         {  0, 0, 0, 1, 1, 2, 3, 4, 6,  7,  9 };
> int maxfightbrdepth[NUMLEVELS] = /* max depth for branches in reading fight
> */
>         {  0, 0, 0, 1, 1, 1, 2, 3, 4,  5,  5 };
> int maxsemdiff[NUMLEVELS] =  /* maximum difference between best semeai move
> and this move*/
> 		{  0, 8,16,24,32,40,50,60,80,90,100 };
> 
> 
> > > 
> > > i have a copy of 11. is there any way to crank it up other 
> > than level
> > > 10. maybe a config file somewhere? have you considered a highly 
> > > configurable version 12 for some of us on the list?
> > > 
> 
> 
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/