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

• John L. Jerz (2008, 2013). A Proposed Heuristic for a Computer Chess Program.
• John L. Jerz (2009, 2012). A Concept of Strategy Useful for Computer Game Playing.
• John L. Jerz (2012). The Case for Using Probabilistic Knowledge in a Computer Chess Program.

External Links

• Welcome to my web site by John L. Jerz
• Computer Chess
• Computers, Chess and Long-range Planning by Botvinnik » Mikhail Botvinnik
• Edward Lasker on Computer Chess
• Chess Skill in Man and Machine (Frey, 1977) » Chess Skill in Man and Machine
• Computer Chess by David E. Welsh » David E. Welsh
• Principles of War
• Rybka Explained? » Rybka
  Does Rybka Properly Count Positions Evaluated? ^[4]
  The chess program Rybka as a Rational Agent
• The Robert I. Reynolds Challenge (1986) » Robert I. Reynolds

References

1. ^ About Me
2. ^ Welcome to my web site by John L. Jerz
3. ^ John L. Jerz (2008, 2012). A Proposed Heuristic for a Computer Chess Program. pdf, November 17, 2012
4. ^ What Strelka tells about Rybka's nodecount and depth by Ernest Bonnem, CCC, July 09, 2007

What links here?

Up one level