Changes

Jump to: navigation, search

Yan Radovilsky

3,168 bytes added, 10:11, 15 May 2020
Created page with "'''Home * People * Yan Radovilsky''' FILE:YanRadovilsky.jpg|border|right|thumb|200px|link=https://www.cs.bgu.ac.il/~yanr/| Yan Radovilsky <ref>[https://ww..."
'''[[Main Page|Home]] * [[People]] * Yan Radovilsky'''

[[FILE:YanRadovilsky.jpg|border|right|thumb|200px|link=https://www.cs.bgu.ac.il/~yanr/| Yan Radovilsky <ref>[https://www.cs.bgu.ac.il/~yanr/ Yan's homepage]</ref> ]]

'''Yan Radovilsky''',<br/>
an Israeli chess player <ref>[http://ratings.fide.com/card.phtml?event=2803739 Radovilsky, Yan FIDE Chess Profile]</ref>,
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]].
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>,
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.
A rudimentary system employing these ideas for chess was implemented with promising empirical results.

=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/r/Radovilsky:Yan dblp: Yan Radovilsky]</ref>
* [[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''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>[http://www.talkchess.com/forum/viewtopic.php?t=57560&start=14 Re: Interesting ideas] by [[Karlo Balla|Karlo Bala Jr.]], [[CCC]], September 09, 2015</ref>
* [[Yan Radovilsky]], [https://dblp.uni-trier.de/pers/hd/s/Shattah:Guy Guy Shattah], [[Solomon Eyal Shimony]] ('''2006'''). ''[https://ieeexplore.ieee.org/document/4274255 Efficient Deterministic Approximation Algorithms for Non-myopic Value of Information in Graphical Models]''. [https://dblp.uni-trier.de/db/conf/smc/smc2006.html SMC 2006]
* [[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2008'''). ''Observation Subset Selection as Local Compilation of Performance Profiles''. [https://dblp.uni-trier.de/db/conf/uai/uai2008.html 24. UAI 2008] [https://arxiv.org/abs/1206.3283 arXiv:1206.3283]

=External Links=
* [https://www.cs.bgu.ac.il/~yanr/ Yan's homepage]
* [http://ratings.fide.com/card.phtml?event=2803739 Radovilsky, Yan FIDE Chess Profile]
* [http://netanyachess.com/Player/5365/en Yan Radovilsky] from [http://netanyachess.com/Index.aspx?Language=en Netanya Chess Club]

=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Player|Radovilsky]]
[[Category:Researcher|Radovilsky]]

Navigation menu