Diep
团队成员
人 | 职位 | 评论 |
---|---|---|
Vincent Diepeveen | engine programmer | |
Carlos Pesce | book author | in 2001 |
Arturo Ochoa | book author | 2002-2005, 2007-current |
Eros Riccio | book author | for Turin'2006 |
参赛
赛 | 参赛者 | 得分 | 对局 |
---|---|---|---|
国际象棋, 2007, 阿姆斯特丹 | 12 | 4.5 | 11 |
国际象棋, 2006, 都灵 | 18 | 6.5 | 11 |
国际象棋, 2005, 雷克雅未克 | 12 | 5.5 | 11 |
国际象棋 (Blitz), 2005, 雷克雅未克 | 8 | 2.5 | 7 |
国际象棋, 2004, Ramat-Gan | 14 | 7.5 | 11 |
国际象棋 (Blitz), 2004, Ramat-Gan | 8 | 2.0 | 7 |
国际象棋, 2003, Graz | 16 | 6.0 | 11 |
国际象棋, 2002, Maastricht | 18 | 5.0 | 9 |
国际象棋 (Blitz), 2002, Maastricht | 12 | 3.0 | 9 |
国际象棋, 2001, Maastricht | 18 | 4.0 | 9 |
国际象棋 (Blitz), 2001, Maastricht | 14 | 6.0 | 9 |
国际象棋, 2000, 伦敦 | 14 | 4.0 | 9 |
国际象棋 (Blitz), 2000, 伦敦 | 10 | 3.5 | 9 |
国际象棋, 1999, Paderborn | 30 | 3.0 | 7 |
国际象棋, 1997, 巴黎 | 34 | 6.0 | 11 |
国际象棋 (Blitz), 1997, 巴黎 | 22 | 5.5 |
介绍
- 介绍来源于 1999:
Started winter 1994 with DIEP. But now i'm busy with this experimental parallel program, it's called DIEP. Still using the same huge evaluation, from which as far as i know it's the most extensive chess evaluation that any chessprogram contains (although mainly middlegame/opening heuristics).
The search of DIEP is however very very selective currently. I plan to join Paderborn with a complete new search. Not only parallel, but it's closer to best first search than the depth limited alfabeta search, although it's still using the iteration to expand nodes.
- 介绍来源于 1997:
Diep is a classical chess playing program with this exception that I try to incorporate as much chess knowledge as possible. This is hard work, but in the end I hope it will give Diep a lot.