25,161
edits
Changes
Created page with "'''Home * People * Markian Hlynka''' FILE:markian.jpg|border|right|thumb|link=http://webdocs.cs.ualberta.ca/~darse/Photos/Friends/ | Markian Hlynka <ref>..."
'''[[Main Page|Home]] * [[People]] * Markian Hlynka'''
[[FILE:markian.jpg|border|right|thumb|link=http://webdocs.cs.ualberta.ca/~darse/Photos/Friends/
| Markian Hlynka <ref>[http://webdocs.cs.ualberta.ca/~darse/Photos/Friends/ Photo Gallery: Friends and Peers] by [[Darse Billings]]</ref>
]]
'''Markian Hlynka''',<br/>
a Canadian computer scientist and systems analyst at [[University of Alberta]]. Along with [[Jonathan Schaeffer]] et al., Markian Hlynka researched and published on [[Search|search]] enhancements and [[Temporal Difference Learning|temporal difference learning]].
=Pre-Search=
<span id="PreSearching"></span>''Abstract'' <ref>[[Markian Hlynka]], [[Jonathan Schaeffer]] ('''2004'''). ''Pre-Searching''. [[ICGA Journal#27_4|ICGA Journal, Vol. 27, No. 4]]</ref>
This paper introduces the idea of pre-searching a position — searching it before αβ determines that it needs to be searched. Consider the case where an iteration of αβ search comes across a position p that needs to be searched to depth d1, and the transposition table reveals that p will likely need to be searched later in that iteration to depth d2 greater than d1. Pre-searching involves speculatively searching p to depth d2, even though it has not been demonstrated that search to this depth is needed. If the gamble is successful, then additional accuracy is introduced to the search (using a result with extra search depth d2 − d1). While any search extension scheme is not without some risk, empirical results indicate that the impact on the αβ search tree size is small, but the additional accuracy that is introduced improves program performance.
=Selected Publications=
<ref>[https://dblp.org/pers/hd/h/Hlynka:Markian dblp: Markian Hlynka]</ref>
* [[Jonathan Schaeffer]], [[Markian Hlynka]], [[Vili Jussila]] ('''2001'''). ''Temporal Difference Learning Applied to a High-Performance Game-Playing Program''. [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2001.html#SchaefferHJ01 IJCAI 2001]
* [[Markian Hlynka]], [[Jonathan Schaeffer]] ('''2004'''). ''Pre-Searching''. [[ICGA Journal#27_4|ICGA Journal, Vol. 27, No. 4]], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/PreSearch.pdf pdf]
* [[Markian Hlynka]], [[Jonathan Schaeffer]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007/11922155_3 Automatic Generation of Search Engines]''. [[Advances in Computer Games 11]]
=External Links=
* [https://ist.ualberta.ca/blog/culture/full-circle Markian Hlynka Full Circle | Information Services and Technology UoA]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:markian.jpg|border|right|thumb|link=http://webdocs.cs.ualberta.ca/~darse/Photos/Friends/
| Markian Hlynka <ref>[http://webdocs.cs.ualberta.ca/~darse/Photos/Friends/ Photo Gallery: Friends and Peers] by [[Darse Billings]]</ref>
]]
'''Markian Hlynka''',<br/>
a Canadian computer scientist and systems analyst at [[University of Alberta]]. Along with [[Jonathan Schaeffer]] et al., Markian Hlynka researched and published on [[Search|search]] enhancements and [[Temporal Difference Learning|temporal difference learning]].
=Pre-Search=
<span id="PreSearching"></span>''Abstract'' <ref>[[Markian Hlynka]], [[Jonathan Schaeffer]] ('''2004'''). ''Pre-Searching''. [[ICGA Journal#27_4|ICGA Journal, Vol. 27, No. 4]]</ref>
This paper introduces the idea of pre-searching a position — searching it before αβ determines that it needs to be searched. Consider the case where an iteration of αβ search comes across a position p that needs to be searched to depth d1, and the transposition table reveals that p will likely need to be searched later in that iteration to depth d2 greater than d1. Pre-searching involves speculatively searching p to depth d2, even though it has not been demonstrated that search to this depth is needed. If the gamble is successful, then additional accuracy is introduced to the search (using a result with extra search depth d2 − d1). While any search extension scheme is not without some risk, empirical results indicate that the impact on the αβ search tree size is small, but the additional accuracy that is introduced improves program performance.
=Selected Publications=
<ref>[https://dblp.org/pers/hd/h/Hlynka:Markian dblp: Markian Hlynka]</ref>
* [[Jonathan Schaeffer]], [[Markian Hlynka]], [[Vili Jussila]] ('''2001'''). ''Temporal Difference Learning Applied to a High-Performance Game-Playing Program''. [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2001.html#SchaefferHJ01 IJCAI 2001]
* [[Markian Hlynka]], [[Jonathan Schaeffer]] ('''2004'''). ''Pre-Searching''. [[ICGA Journal#27_4|ICGA Journal, Vol. 27, No. 4]], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/PreSearch.pdf pdf]
* [[Markian Hlynka]], [[Jonathan Schaeffer]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007/11922155_3 Automatic Generation of Search Engines]''. [[Advances in Computer Games 11]]
=External Links=
* [https://ist.ualberta.ca/blog/culture/full-circle Markian Hlynka Full Circle | Information Services and Technology UoA]
=References=
<references />
'''[[People|Up one level]]'''
