Thomas Thomsen,
a Danish computer scientist, mostly developing open-source software for handling of timeseries and solving large economic models[1], and author of the Tesuji Solver MadLab, a Go program for solving capture problems, which applies Lambda-search combined with Proof-number search[2].
Lambda-Search
Lambda-Search in Game Trees - with Application to Go was introduced by Thomsen at the Computer and Games 2000 conference in Hamamatsu[3], also published slightly edited in the ICGA Journal[4], winning the 2001 ICGA Journal Award. Lambda-search is a method for searching two-valued (binary) game trees in games like chess and Go and applies null moves to focus on threats and threat aversions, and still guarantees to find the minimax value, assuming the rules allow passing or that zugzwang is not a issue.
Table of Contents
Thomas Thomsen,
a Danish computer scientist, mostly developing open-source software for handling of timeseries and solving large economic models [1], and author of the Tesuji Solver MadLab, a Go program for solving capture problems, which applies Lambda-search combined with Proof-number search [2].
Lambda-Search
Lambda-Search in Game Trees - with Application to Go was introduced by Thomsen at the Computer and Games 2000 conference in Hamamatsu [3], also published slightly edited in the ICGA Journal [4], winning the 2001 ICGA Journal Award. Lambda-search is a method for searching two-valued (binary) game trees in games like chess and Go and applies null moves to focus on threats and threat aversions, and still guarantees to find the minimax value, assuming the rules allow passing or that zugzwang is not a issue.Publications
[5]External Links
References
What links here?
Up one level