Yan Radovilsky

Home * People * Yan Radovilsky



Yan Radovilsky, an Israeli chess player , 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 , 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 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.

=Selected Publications=
 * Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. SMC 2004, pdf
 * 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= Up one level