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.|| toc =Selected Publications=
 * Home * People * Yan Radovilsky**
 * [[image:YanRadovilsky.jpg link="http://www.cs.bgu.ac.il/~yanr/"]] ||~  || **Yan Radovilsky**,
 * Yan Radovilsky ||~   ||^   ||
 * Yan Radovilsky, Solomon Eyal Shimony (**2004**). //Generalized Model for Rational Game Tree Search//. [|pdf]
 * 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= =What links here?= include page="Yan Radovilsky" component="backlinks" limit="40"
 * Up one level**