Difference between revisions of "Yan Radovilsky"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 7: Line 7:
 
computer scientist, computer software professional and lecturer at [https://en.wikipedia.org/wiki/Ben-Gurion_University_of_the_Negev Ben-Gurion University of the Negev].  
 
computer scientist, computer software professional and lecturer at [https://en.wikipedia.org/wiki/Ben-Gurion_University_of_the_Negev Ben-Gurion University of the Negev].  
 
The main areas of his interest is [[Artificial Intelligence|AI]], [[Chess|chess]] and [[Psychology|psychology]].  
 
The main areas of his interest is [[Artificial Intelligence|AI]], [[Chess|chess]] and [[Psychology|psychology]].  
Along with [[Solomon Eyal Shimony]]  <ref>[[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''Generalized Model for Rational Game Tree Search''. [https://www.cs.bgu.ac.il/~yanr/Publications/smc04.pdf pdf]</ref>,  
+
Along with [[Solomon Eyal Shimony]]  <ref>[[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''[https://www.semanticscholar.org/paper/Generalized-model-for-rational-game-tree-search-Radovilsky-Shimony/47a32301e705acdc46856d4b29bfc4f50d5ce000 Generalized Model for Rational Game Tree Search]''. [https://dblp.uni-trier.de/db/conf/smc/smc2004-2.html  SMC 2004], [https://www.cs.bgu.ac.il/~yanr/Publications/smc04.pdf pdf]</ref>,  
 
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 <ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-part-Baum-Warren/5838432c92c8905c7066962400c55ddc8803f11a Best Play for Imperfect Players and Game Tree Search]''. Part I - theory, with pseudocode appendix by [[Charles Garrett]]</ref>  
 
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 <ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-part-Baum-Warren/5838432c92c8905c7066962400c55ddc8803f11a Best Play for Imperfect Players and Game Tree Search]''. Part I - theory, with pseudocode appendix by [[Charles Garrett]]</ref>  
 
to allow for [[Planning|planning]] steps, as well as [[Search|game tree search]] steps.   
 
to allow for [[Planning|planning]] steps, as well as [[Search|game tree search]] steps.   

Latest revision as of 09:29, 15 May 2020

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.

Selected Publications

[5]

External Links

References

Up one level