Averno 0.20 test continuation + a question for José C

Archive of the old Parsimony forum. Some messages couldn't be restored. Limitations: Search for authors does not work, Parsimony specific formats do not work, threaded view does not work properly. Posting is disabled.

Averno 0.20 test continuation + a question for José C

Postby Alexandre Côme » 08 Oct 1999, 12:14

Hello,
Here two games, the first one confirms tactical weakness of
Averno. The second is interesting for she shows positional
weaknesses of Averno.
Game one:
[Event "Computer chess game"]
[Site "COME"]
[Date "1999.10.08"]
[Round "-"]
[White "Côme Alexandre"]
[Black "Averno 0.20"]
[Result "1-0"]
[TimeControl "900"]
1. d4 d5 2. e3 Bf5 3. c4 Nc6 4. cxd5 Qxd5 5. Nc3 Qa5 6. Bd2 Nf6 7. e4 Nxe4
8. Nxe4 Qd5 9. Ng3 Nxd4 10. Nxf5 Nxf5 11. Qa4+ c6 12. Nf3 e5 13. Bc4 Qd6
14. O-O Nd4 15. Nxe5 Ne2+ 16. Bxe2 Qxe5 17. Bc3 Qf5 18. Bf3 Qg6 19. Rfe1+
Kd7 20. Rad1+ Kc7 21. Ba5+ b6 22. Rc1 c5 23. Bd2 c4 24. Bf4+ Bd6 25. Re7+
Kb8 26. Rb7+ Kc8 27. Qd7#
1-0
Game two:
[Event "Computer chess game"]
[Site "COME"]
[Date "1999.10.08"]
[Round "-"]
[White "Averno 0.20"]
[Black "Côme Alexandre"]
[Result "0-1"]
[TimeControl "900"]
1. d4 f5 2. Bg5 Nf6 3. Nc3 d5 4. e3 e6 5. Bb5+ c6 6. Bd3 Be7 7. Nf3 O-O 8.
O-O Bd7 9. Ne5 Be8 10. a4 Nbd7 11. Nxd7 Qxd7 12. a5 Bh5 13. Qe1 Bd6 14. a6
b6 15. Na4 e5 16. dxe5 Bxe5 17. Bh4 Rae8 18. Bxf6 Rxf6 19. Qd2 f4 20. c3 f3
21. Qc2 Qg4 22. Bxh7+ Kf8 23. g3 Qh3 24. Rfb1 Qg2#
0-1
Which modifications will have about it you it for the version 21?

Best Regards
Alexandre Côme
Alexandre Côme
 

Re: Averno 0.20 test continuation + a question for Jos&eacut

Postby José Carlos » 09 Oct 1999, 15:51

Hello,
Here two games, the first one confirms tactical weakness of
Averno. The second is interesting for she shows positional
weaknesses of Averno.
Which modifications will have about it you it for the version 21?

Best Regards
Alexandre Côme

Ok, you are too strong for my little baby... You're gonna kill him :)
Version 0.21 won't be released until opening book is ready. Many other little improvements in search funtion to reduce the number of nodes per ply. Next things I'll do are rewrite the evaluation function (it is almost the same from the first versions), improve the HT (I use a too big checksum), improve the move generation if possible, implementing null move... As you see, there are many many things to do yet. This has just started...
Regards,
José C.
José Carlos
 


Return to Archive (Old Parsimony Forum)

Who is online

Users browsing this forum: No registered users and 64 guests