Re: computer-go: unmake move?

["Tristan Cazenave" <cazenave@xxxxxxxxxxxxxxxxx>]

>
(B>I may be missing something, but: isn't this simply a ladder problem?
(B>
(B> Martin
(B>
(BYes, it is quite simple if you consider the capturing of adjacent strings
(Bin atari in the ladder computations.
(BI realize now that this example was not good because I did not use
(Bcapturing adjacent strings moves in my quiescence search.
(BSo here are the results with these moves being considered in the
(BQS (i.e. ladder) search.
(BAs david suggested, I refer to problems by numbers.
(BI still do not use Go specific knowledge for move ordering except
(Bfor simple ladders.
(BYou may note that pb 163 is now solved by both methods due to
(Bthe improvement cited above :°)
(BAbstract Proof search is still clearly superior, and I suspect that
(Bmaking further improvements to the search algorithm will not
(Bchange much the comparison (even if the superiority may be seen
(Bonly on some harder problems as heuristics become better),
(Bbecause the improvements benefit the same way to both
(Bsearch methods.
(BMoreover, the answers given by APS are always true :)
(B(when it does not solve a problem, it knows it has not found
(Bthe answer, and when it gives an answer it is always correct)
(B
(BAbstract Proof Search :
(B
(B144 Problemes
(B128 Problemes Resolus
(B16 Problemes Non Resolus
(BTaux=88.89%
(BTempsTotal=34.58
(BNombreTotalNoeuds=39527
(BNombreNoeudsProblemesResolus=29060
(BProblemes non resolus :
(Bggv2_131.gob Prendre GI i53 i34
(Bggv2_136.gob Prendre GI i349 i348
(Bggv2_137.gob Prendre GI i226 i321
(Bggv2_140.gob Prendre GI i326 i249
(Bggv2_158.gob Prendre GI i117 i119
(Bggv2_164.gob Prendre GI i310 i309
(Bggv2_189.gob Prendre GI i52 i33
(Bggv2_219.gob Prendre GI i27 i8
(Bggv2_222.gob Prendre GI i340 i341
(Bggv2_225.gob Prendre GI i293 i308
(Bggv2_225.gob Vivre IP i309 i308
(Bggv2_30.gob Vivre IP i345 i347
(Bggv2_305.gob Vivre IP i117 i116
(Bggv2_319.gob Prendre GI i132 i76
(Bggv2_321.gob Vivre IP i330 i353
(Bggv2_327.gob Prendre GI i315 i334
(B
(B
(BHeuristic search with same knowledge and same search algorithm :
(B
(B144 Problemes
(B118 Problemes Resolus
(B26 Problemes Non Resolus
(BTaux=81.94%
(BTempsTotal=117
(BNombreTotalNoeuds=599130
(BNombreNoeudsProblemesResolus=422063
(BProblemes non resolus :
(Bggv2_131.gob Prendre GI i53 i34
(Bggv2_136.gob Prendre GI i349 i348
(Bggv2_137.gob Vivre IP i302 i321
(Bggv2_137.gob Prendre GI i226 i321
(Bggv2_140.gob Prendre GI i326 i249
(Bggv2_164.gob Prendre GI i310 i309
(Bggv2_189.gob Prendre GI i52 i33
(Bggv2_219.gob Prendre GI i27 i8
(Bggv2_222.gob Prendre GI i340 i341
(Bggv2_225.gob Prendre GI i293 i308
(Bggv2_225.gob Vivre IP i309 i308
(Bggv2_305.gob Vivre IP i117 i116
(Bggv2_306.gob Vivre IP i322 i342
(Bggv2_307.gob Vivre IP i35 i54
(Bggv2_308.gob Vivre IP i40 i39
(Bggv2_309.gob Vivre IP i279 i260
(Bggv2_318.gob Vivre IP i340 i355
(Bggv2_319.gob Prendre GI i132 i76
(Bggv2_32.gob Prendre GI i332 i351
(Bggv2_32.gob Vivre IP i347 i351
(Bggv2_320.gob Vivre IP i78 i58
(Bggv2_321.gob Vivre IP i330 i353
(Bggv2_323.gob Vivre IP i97 i77
(Bggv2_327.gob Prendre GI i315 i334
(Bggv2_46.gob Vivre IP i290 i289
(Bggv2_78.gob Prendre GI i62 i81