25,161
edits
Changes
no edit summary
=Learning to Play Chess Selectively=
Several researchers have noted that human chess players do not perceive a position as a static entity, but as a collection of potential actions. Indeed, it looks as if human chess players are able to follow promising moves without considering all the alternatives. This work studies the possibility of incorporating such capabilities into chess programs.
* [[Lev Finkelstein]], [[Shaul Markovitch]] ('''1998'''). ''Learning to Play Chess Selectively by Acquiring Move Patterns.'' [[ICGA Journal#21_2|ICCA Journal, Vol. 21, No. 2]], [http://www.cs.technion.ac.il/%7Eshaulm/papers/pdf/Finkelstein-Markovitch-icca1998.pdf pdf]
* [[Lev Finkelstein]], [[Shaul Markovitch]] ('''1998'''). ''A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 8, [https://arxiv.org/abs/cs/9806102 arXiv:cs/9806102]
* [[Lev Finkelstein]], [[Shaul Markovitch]], [https://dblp.uni-trier.de/pers/hd/r/Rivlin:Ehud [Mathematician#ERivlin|Ehud Rivlin]] ('''2003'''). ''Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 19, [https://arxiv.org/abs/1106.5269 arXiv:1106.5269]
* [[Lev Finkelstein]] ('''2005'''). ''[http://www.graduate.technion.ac.il/Theses/Abstracts.asp?Id=10988 Offline Scheduling of Anytime Algorithms]''. Ph.D thesis, [https://en.wikipedia.org/wiki/Technion_%E2%80%93_Israel_Institute_of_Technology Technion - Israel Institute of Technology], advisor [[Shaul Markovitch]]
=External Links=
* [https://www.linkedin.com/in/lev-finkelstein-2836b3/ Lev Finkelstein | LinkedIn]
* [https://www.mathgenealogy.org/id.php?id=102950 Lev Finkelstein - The Mathematics Genealogy Project]
=References=
