ICGA Tournaments

Tournaments between computer programs: chess, draughts, checkers, Go, backgammon, and more
Home / Programs / Nightmare (D)

Nightmare (D)


Reinhold Gellnerengine programmer
Gaby von Rekowski


Chess, 1997, Paris343.011
Chess (Blitz), 1997, Paris223.5
Chess, 1996, Jakarta274.011
Chess, 1995, Paderborn343.511
Chess, 1995, Shatin241.55
Chess, 1993, Munich284.59
Chess, 1992, Madrid221.05
Chess, 1991, Vancouver153.57
Chess, 1990, London112.07
Chess, 1990, Lyon122.57
Chess, 1989, Portoro┼ż90.08


Description given in 1995:

Completely written in C, work on Nightmare started in 1989 as a non-commercial project. It is a brute force program searching up to 7-ply in the middle-game with a selective search depth of up to 40 ply. Modified null-move searches, modified singular extensions, part-ply extensions and a new idea of hashing related meaningful subtrees are special features of Nightmare. The program also uses well known techniques like killer-moves, history heuristic, principal variation search and hash tables of 64,000 entries per side. The tournament opening book consists of about 40,000 moves. Endgame databases are NOT used. Last year, Nightmare was transferred to 32-bit under extended DOS and it can now search 12,000 moves per second. The program's rating is about 2000ELO (German) on a 486-50.