John L. Jerz

From Chessprogramming wiki
Revision as of 16:15, 28 September 2020 by GerdIsenberg (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * John L. Jerz

John L. Jerz,
an American electrical engineer and programmer. He holds a BS in electrical engineering (1988), a M.Sc. in EE (1995), and a M.Sc. in systems engineering (2000), all degrees from Virginia Tech [1]. John L. Jerz maintains a web site which contains a collection of information relating to chess, computers, problem solving, artificial intelligence and other subjects [2].

Future Mobility

In his article A Proposed Heuristic for a Computer Chess Program [3], John L. Jerz suggests to maintain a database of potential mobility for each chess piece three moves into the future and to evaluate positions accordantly. Progressive mobility is applicable via fill algorithms, where a bitboard of (safe) piece attacks of a sliding piece, a knight or a king is fed to appropriate set-wise attack generators, f.i. Dumb7Fill or Kogge-Stone algorithm for sliders.

Selected Publications

External Links

Does Rybka Properly Count Positions Evaluated? [4]
The chess program Rybka as a Rational Agent

References

Up one level