Search found 116 matches
- Fri Aug 03, 2012 11:33 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: An idea I have... "semi-TT"...
- Replies: 7
- Views: 1325
Re: An idea I have... "semi-TT"...
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...
- Sun Mar 18, 2012 9:30 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Outpost evaluation
- Replies: 18
- Views: 4123
Re: Outpost evaluation
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
I think you have a point

I have to fix my engine and test my ideas in code before I say too much.
/Pio
- Sun Mar 18, 2012 7:38 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Outpost evaluation
- Replies: 18
- Views: 4123
Re: Outpost evaluation
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 ...
- Fri Mar 09, 2012 9:51 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: The evaluation value and value returned by minimax search
- Replies: 26
- Views: 4180
Re: The evaluation value and value returned by minimax searc
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...
- Thu Mar 01, 2012 10:48 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Counting depth as a function of number of legal moves
- Replies: 14
- Views: 3962
Re: Counting depth as a function of number of legal moves
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...
- Tue Feb 28, 2012 10:32 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Counting depth as a function of number of legal moves
- Replies: 14
- Views: 3962
Counting depth as a function of number of legal moves
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...