From b38d194ebde0143109cba38420abf4057feb1b14 Mon Sep 17 00:00:00 2001 From: Petr Baudis Date: Sat, 26 Jun 2010 15:48:23 +0200 Subject: [PATCH] HACKING: Add uct/slave.* and uct/dynkomi.* --- HACKING | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/HACKING b/HACKING index 8696eee..0cece50 100644 --- a/HACKING +++ b/HACKING @@ -96,6 +96,7 @@ The UCT engine has non-trivial structure by itself: tree.[ch] minimax move tree with success statistics walk.[ch] filling the tree by walking it many times and running MC simulations from leaves + slave.[ch] engine interface for the distributed engine * "node prior-hinter" assigns newly created nodes preliminary success statistics ("prior values") to focus the search better @@ -109,6 +110,10 @@ The UCT engine has non-trivial structure by itself: policy/ucb1 the old-school original simple policy policy/ucb1amaf the AMAF/RAVE-based policy gathering statistics rapidly +* "dynkomi driver" dynamically determines self-imposed extra virtual komi + + dynkomi.[ch] + Board Implementation ==================== -- 2.11.4.GIT