Fritz
チームメンバー
| 人 | 役割 |
|---|---|
| Frans Morsch | engine programmer |
| Mathias Feist |
参加回数
| Version | トーナメント | タイトル | 参加者 | 得点 | 試合数 |
|---|---|---|---|---|---|
| チェス, 2004, ラマット・ガン | 14 | 7.0 | 11 | ||
| Deep Fritz | チェス, 2003, グラーツ | 16 | 9.5 | 11 | |
| チェス (Blitz), 2003, グラーツ | 9 | 6.5 | 8 | ||
| Quest | チェス, 2002, マーストリヒト | 18 | 6.0 | 9 | |
| Quest | チェス (Blitz), 2002, マーストリヒト | 12 | 5.0 | 9 | |
| Quest | チェス, 2001, マーストリヒト | 18 | 6.0 | 9 | |
| Quest | チェス (Blitz), 2001, マーストリヒト | 14 | 6.5 | 9 | |
| チェス, 2000, ロンドン | 14 | 6.5 | 9 | ||
| チェス (Blitz), 2000, ロンドン | World Microcomputer Speed-Chess Champion | 10 | 8.5 | 9 | |
| チェス, 1999, パーダーボルン | 30 | 5.0 | 7 | ||
| チェス, 1997, パリ | 34 | 6.0 | 11 | ||
| チェス (Blitz), 1997, パリ | 22 | 7.0 | |||
| チェス, 1996, ジャカルタ | 27 | 6.5 | 11 | ||
| チェス (Blitz), 1996, ジャカルタ | 5 | ||||
| Quest | チェス, 1995, パーダーボルン | 34 | 7.0 | 11 | |
| チェス, 1995, シャーティン | World Computer Chess Champion | 24 | 4.0 | 5 | |
| Quest | チェス, 1993, ミュンヘン | 28 | 5.5 | 9 | |
| Fritz 2 | チェス, 1992, マドリッド | 22 | 3.5 | 5 | |
| Quest X | チェス, 1989, エドモントン | 24 | 2.5 | 5 |
Descriptions
- Description given in 1999:
Fritz is build around a selective search technique known as the null-move search. As part of its search, Fritz allows one side to move twice (the other side does a null-move). This allows the program to detect weak moves before they are searched to their full depth. Move generators, evaluation functions and data structures have been designed to maximize the effectiveness of the null-move search. Fritz is the winner of the previous computerchess world championship in Hong Kong 1995. 1993 Fritz tied for 1st place in a Blitz tournament in Munich with the complete world elite. It scored the best computer result in the 1996 man-computer Aegon tournament. In 1998 Fritz was leading the prestigious Swedish rating list. It won an active chess tournament Frankfurt 1998 with a full point ahead of 36 grandmasters.
- Description given in 1997:
Fritz won the ICCA chess computer world championship in Hong Kong 1995 beating a prototype of the Deep Blue chess computer. It obtained the best computer result in the 1996 man-computer Aegon tournament. Fritz is build around a selective search technique known as the null-move search. Move generators, evaluation functions and data structures have been designed specially to maximise the effectiveness of the null-move search. If anything, Fritz is fast. The search engine is written in highly optimised assembly language. The present version searches at a rate of one thousand processor cycles per position. The openings book was constructed from grandmaster games. Fritz learns from his games and adjusts the probability weights in the openings book automatically.
- Description given in 1995:
Fritz is built around a selective search technique known as null-move search. As part of its search, Fritz allows one side to move twice (the other side does a null-move). If the position after the null-move does not return a high value in the evaluation function, then clearly the first of the two moves did not contain a threat. This applies to 95% of the moves in a search. Detecting such moves before they are searched to the full depth is an excellent method to speed-up the search. In its latest version, Fritz manages a 10-times speed-up over a version without the null-move search. Selective search unavoidably introduces oversights, but these are few. In tournaments against humans and other programs, Fritz has proven to be a tough opponent when defending difficult positions.