TalkChess.com

I agree with you HG but I also think the idea of Bill is really interesting. I have thought of a related idea. My idea is a way of overcomming some of the problems with the history heuristics. The basic idea is to store a type of history heuristics for all (???) positions with a locked pawn structur...

Hi Michael!

I think you have a point
I have to fix my engine and test my ideas in code before I say too much.

/Pio

Hi Lucas! I do not have a working chess engine right now so I have not been able to implement my ideas. I think an outpost should only be counted as an outpost if it cannot be threatened by a pawn. What I think is important is that you should give the knight outpost higher value the more pieces the ...

Hi Joona and Ma Chao! The big problem as I see it, trying to minimize the absolute value of difference between a shallow and a deep search, is that doing so IMO will lead to a simplification of the evaluation function. IMO It might help though if you can determine if the deeper search is a win, draw...

Hi to all of you! Daniel Shawul, I thank you so much for wellcomming me to CC and I can assure you I very much enjoy this forum. Heiner Marxen, you are completely right that I "try to shape the tree not by depth but rather by an estimation of the size" and I am happy you do not think the idea is stu...

Hi all of you! This is my first post here even though I have read and enjoyed most of the threads in this forum for at least half a year. First of all I apologize that I do not know the computer chess terminology very well. I hope my idea is not too stupid. It has to do with how to count the depth o...