Search found 405 matches

by Chan Rasjid
Tue Jun 04, 2013 8:42 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Komodo bug?
Replies: 18
Views: 4822

Re: Komodo bug?

The way I resolve search instability, whether at root or within internal nodes, is to take the average of the two fails (soft) as the exact score. It seems to work fine. The exception is when one of the fails is a draw score of -1/0/+1 due to repetition, in which case a research with infinite window...
by Chan Rasjid
Mon Jun 03, 2013 8:23 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Is LMR Sound.
Replies: 102
Views: 18760

Re: Is LMR Sound.

It was about the question: " Almost every chess program uses null move checks or reductions which take a lot of cpu time. Is it safe to apply LMR within these null moves checks or will the variant be reduced too much." So is there something you can do with LMR if alfa = beta or alfa = beta -1 (when...
by Chan Rasjid
Mon May 27, 2013 4:03 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Debian 7
Replies: 31
Views: 10561

Re: Debian 7

I have been using only Linux now for quite some many years. I tried a few and finally settled on Arch Linux with LXDE. I cannot now see myself wanting to try other distro after this. It is about simplicity - installing only the things needed. I don't now get reminders about updates being available, ...
by Chan Rasjid
Sat May 25, 2013 5:38 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On history and piece square tables
Replies: 19
Views: 6318

Re: On history and piece square tables

The idea of dynamic PST tables that are updated with search don't seem correct. PST is like a basic foundation upon which evaluation is founded. As the basic foundation, it should be static - fixed and not changing dynamically. It is exactly within the evaluation routine that we consider the dynamic...
by Chan Rasjid
Sat May 25, 2013 4:24 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On history and piece square tables
Replies: 19
Views: 6318

Re: On history and piece square tables

Hello Evert, It seems you're going the way of 'complexity'. At times, the best way may be the way of simplicity. And the 'experience' of the top engines should tell us the way to go. There is usually no perfect way to do a thing and, in such cases, simplicity may be best. Don gave good pointers on h...
by Chan Rasjid
Tue May 14, 2013 8:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Aspiration windows
Replies: 8
Views: 2142

Re: Aspiration windows

Hello, If, as you said, your aspiration search cause your program to output obvious dumb moves, then there is a simple way to just confirm if there are bugs unrelated to aspiration search. You can try this. Do aspiration for all root moves with an estimated score (est_score) for the move with window...
by Chan Rasjid
Tue May 14, 2013 2:50 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: How to implement KPK ?
Replies: 42
Views: 19588

Re: How to implement KPK ?

The game in pgn :
1. Kb3 Kd7 2. Kc4 Kd6 3. Kd4 Ke6 4. Ke4 Kd6 5. Kf5 Kd5 6. e4+ Kd6 7. Kf6
Kd7 8. e5 Kc6 9. e6 Kc5 10. e7 Kd4 11. e8=Q Kc4 12. Qe3 Kd5 13. Qf4 Kc5 14.
Ke6 Kb6 15. Kd6 Kb5 16. Qe4 Kb6 17. Qb4+ Ka6 18. Kc6 Ka7 19. Qb7#
{White mates} 1-0

Rasjid.
by Chan Rasjid
Tue May 14, 2013 2:45 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: How to implement KPK ?
Replies: 42
Views: 19588

Re: How to implement KPK ?

Hello, This is a difficult KPK position which requires coding for the piece races: [D]4k3/8/8/8/K7/8/4P3/8 w - - 5 1[/D] How can the half move counter be five when the full move number is one? The FEN input scanner should really check for this. Anyways, [d]4k3/8/8/8/K7/8/4P3/8 w - - 0 1[/d] Symbolic...
by Chan Rasjid
Mon May 13, 2013 7:39 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: How to implement KPK ?
Replies: 42
Views: 19588

Re: How to implement KPK ?

Finally, I am able to get my KPK routine to work just as 'perfectly' as how all other programs play the KPK endings. I am using the KPK bitbase which Gert Mueller put up in the public domain. If you use a bitbase, why so much testing before you probe it? Just probe it and if is a win, return a winn...
by Chan Rasjid
Sun May 12, 2013 10:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: How to implement KPK ?
Replies: 42
Views: 19588

Re: How to implement KPK ?

Finally, I am able to get my KPK routine to work just as 'perfectly' as how all other programs play the KPK endings. I am using the KPK bitbase which Gert Mueller put up in the public domain. So it seems all fine - should have no bugs. Many thanks to Gert. It was exasperating trying to get my KPK co...