Yan Radovilsky

Home * People * Yan Radovilsky

Yan Radovilsky [1] Yan Radovilsky,

an Israeli chess player [2], 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 [3], 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 [4] 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.

[5]

• Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. SMC 2004, pdf [6]
• Yan Radovilsky, Guy Shattah, Solomon Eyal Shimony (2006). Efficient Deterministic Approximation Algorithms for Non-myopic Value of Information in Graphical Models. SMC 2006
• Yan Radovilsky, Solomon Eyal Shimony (2008). Observation Subset Selection as Local Compilation of Performance Profiles. 24. UAI 2008, arXiv:1206.3283

External Links#

• Yan’s homepage
• Radovilsky, Yan FIDE Chess Profile
• Yan Radovilsky from Netanya Chess Club

References#

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

Up one level