25,161
edits
Changes
Created page with "'''Home * People * John L. Jerz''' '''John L. Jerz''',<br/> an American electrical engineer and programmer. He holds a BS in [https://en.wikipedia.org/wiki..."
'''[[Main Page|Home]] * [[People]] * John L. Jerz'''
'''John L. Jerz''',<br/>
an American electrical engineer and programmer.
He holds a BS in [https://en.wikipedia.org/wiki/Electrical_engineering electrical engineering] (1988), a M.Sc. in EE (1995),
and a M.Sc. in [https://en.wikipedia.org/wiki/Systems_engineering systems engineering] (2000), all degrees from [https://en.wikipedia.org/wiki/Virginia_Polytechnic_Institute_and_State_University Virginia Tech]
<ref>[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id1.html About Me]</ref>.
John L. Jerz maintains a web site which contains a collection of information relating to chess, computers, problem solving, [[Artificial Intelligence|artificial intelligence]] and other subjects
<ref>[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/index.html Welcome to my web site] by [[John L. Jerz]]</ref>.
=Future Mobility=
In his article ''A Proposed Heuristic for a Computer Chess Program'' <ref>[[John L. Jerz]] ('''2008, 2013'''). ''[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id80.html A Proposed Heuristic for a Computer Chess Program]''. [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/myfiles/jerz.pdf pdf]</ref>,
John L. Jerz suggests to maintain a database of [[Mobility#ProgressiveMobility|potential mobility]] for each chess [[Pieces|piece]] three [[Moves|moves]] into the future and to [[Evaluation|evaluate]] positions accordantly.
Progressive mobility is applicable via [[Fill Algorithms|fill algorithms]], where a [[Bitboards|bitboard]] of (safe) piece attacks of a [[Sliding Pieces|sliding piece]],
a [[Knight|knight]] or a [[King|king]] is fed to appropriate set-wise attack generators, f.i. [[Dumb7Fill]] or [[Kogge-Stone Algorithm|Kogge-Stone algorithm]] for sliders.
=Selected Publications=
* [[John L. Jerz]] ('''2008, 2013'''). ''[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id80.html A Proposed Heuristic for a Computer Chess Program]''.
* [[John L. Jerz]] ('''2009, 2012'''). ''[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id461.html A Concept of Strategy Useful for Computer Game Playing]''.
* [[John L. Jerz]] ('''2012'''). ''[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id309.html The Case for Using Probabilistic Knowledge in a Computer Chess Program]''.
=External Links=
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/index.html Welcome to my web site] by [[John L. Jerz]]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id83.html Computer Chess]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id128.html Computers, Chess and Long-range Planning by Botvinnik] » [[Mikhail Botvinnik]]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id177.html Edward Lasker on Computer Chess]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id17.html Chess Skill in Man and Machine (Frey, 1977)] » [[Chess Skill in Man and Machine]]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id125.html Computer Chess by David E. Welsh] » [[David E. Welsh]]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id68.html Principles of War]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id7.html Rybka Explained?] » [[Rybka]]
: [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id18.html Does Rybka Properly Count Positions Evaluated?] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=14959 What Strelka tells about Rybka's nodecount and depth] by [[Ernest Bonnem]], [[CCC]], July 09, 2007</ref>
: [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id22.html The chess program Rybka as a Rational Agent]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id372.html The Robert I. Reynolds Challenge (1986)] » [[Robert I. Reynolds]]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Programmer|Jerz]]
'''John L. Jerz''',<br/>
an American electrical engineer and programmer.
He holds a BS in [https://en.wikipedia.org/wiki/Electrical_engineering electrical engineering] (1988), a M.Sc. in EE (1995),
and a M.Sc. in [https://en.wikipedia.org/wiki/Systems_engineering systems engineering] (2000), all degrees from [https://en.wikipedia.org/wiki/Virginia_Polytechnic_Institute_and_State_University Virginia Tech]
<ref>[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id1.html About Me]</ref>.
John L. Jerz maintains a web site which contains a collection of information relating to chess, computers, problem solving, [[Artificial Intelligence|artificial intelligence]] and other subjects
<ref>[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/index.html Welcome to my web site] by [[John L. Jerz]]</ref>.
=Future Mobility=
In his article ''A Proposed Heuristic for a Computer Chess Program'' <ref>[[John L. Jerz]] ('''2008, 2013'''). ''[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id80.html A Proposed Heuristic for a Computer Chess Program]''. [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/myfiles/jerz.pdf pdf]</ref>,
John L. Jerz suggests to maintain a database of [[Mobility#ProgressiveMobility|potential mobility]] for each chess [[Pieces|piece]] three [[Moves|moves]] into the future and to [[Evaluation|evaluate]] positions accordantly.
Progressive mobility is applicable via [[Fill Algorithms|fill algorithms]], where a [[Bitboards|bitboard]] of (safe) piece attacks of a [[Sliding Pieces|sliding piece]],
a [[Knight|knight]] or a [[King|king]] is fed to appropriate set-wise attack generators, f.i. [[Dumb7Fill]] or [[Kogge-Stone Algorithm|Kogge-Stone algorithm]] for sliders.
=Selected Publications=
* [[John L. Jerz]] ('''2008, 2013'''). ''[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id80.html A Proposed Heuristic for a Computer Chess Program]''.
* [[John L. Jerz]] ('''2009, 2012'''). ''[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id461.html A Concept of Strategy Useful for Computer Game Playing]''.
* [[John L. Jerz]] ('''2012'''). ''[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id309.html The Case for Using Probabilistic Knowledge in a Computer Chess Program]''.
=External Links=
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/index.html Welcome to my web site] by [[John L. Jerz]]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id83.html Computer Chess]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id128.html Computers, Chess and Long-range Planning by Botvinnik] » [[Mikhail Botvinnik]]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id177.html Edward Lasker on Computer Chess]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id17.html Chess Skill in Man and Machine (Frey, 1977)] » [[Chess Skill in Man and Machine]]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id125.html Computer Chess by David E. Welsh] » [[David E. Welsh]]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id68.html Principles of War]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id7.html Rybka Explained?] » [[Rybka]]
: [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id18.html Does Rybka Properly Count Positions Evaluated?] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=14959 What Strelka tells about Rybka's nodecount and depth] by [[Ernest Bonnem]], [[CCC]], July 09, 2007</ref>
: [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id22.html The chess program Rybka as a Rational Agent]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id372.html The Robert I. Reynolds Challenge (1986)] » [[Robert I. Reynolds]]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Programmer|Jerz]]
