Yan Radovilsky, an Israeli chess player [1], computer scientist, computer software professional and lecturer at Ben-Gurion University of the Negev. The main areas of his interest is AI, chess and psychology. Along with Solomon Eyal Shimony [2], Yan Radovilsky proposed a generalization of the BPIP-DFISA (Best play for imperfect players - Depth free independent staircase approximation) search control model introduced by Eric B. Baum and Warren D. Smith in 1995 [3] to allow for planning steps, as well as game tree search steps. A rudimentary system employing these ideas for chess was implemented with promising empirical results.
Yan Radovilsky [4]

Selected Publications

• Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. pdf ^[6]
• Yan Radovilsky, Solomon Eyal Shimony (2008). Observation Subset Selection as Local Compilation of Performance Profiles. 24. UAI 2008 pdf

External Links

• Yan's homepage
• Mr. Yan Radovilsky
• Radovilsky, Yan FIDE Chess Profile
• Yan Radovilsky from Netanya Chess Club

References

1. ^ Radovilsky, Yan FIDE Chess Profile
2. ^ Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. pdf
3. ^ Eric B. Baum, Warren D. Smith (1995). Best Play for Imperfect Players and Game Tree Search. with pseudocode appendix by Charles Garrett, ps
4. ^ Yan's homepage
5. ^ dblp: Yan Radovilsky
6. ^ Re: Interesting ideas by Karlo Bala Jr., CCC, September 09, 2015

What links here?