Author: Ricardo Gibert
Date: 04:19:44 09/24/04
Go up one level in this thread
On September 23, 2004 at 09:15:41, Dann Corbit wrote:
>On September 23, 2004 at 05:54:57, Peter Fendrich wrote:
>
>>No, but by also counting in the pieces weight they are a good starting point.
>>With weight I mean that higher valued pieces are more vulnerable on squares
>>where the opposite colored pieces have high PST-values.
>>BTW wouldn't it make more sence to set zeroes for the 1st and 8th rows in the
>>pawn table?
>
>No. If you move a pawn to that rank, that is how many squares it affects on the
>next move. (Q+N)
Any ideas on why the programmer thought such information would be useful? Never
mind. I don't think I want to know.
>
>>
>>On September 22, 2004 at 21:02:16, Dann Corbit wrote:
>>
>>>static const unsigned rook_reach[64] = {
>>> 14, 14, 14, 14, 14, 14, 14, 14,
>>> 14, 14, 14, 14, 14, 14, 14, 14,
>>> 14, 14, 14, 14, 14, 14, 14, 14,
>>> 14, 14, 14, 14, 14, 14, 14, 14,
>>> 14, 14, 14, 14, 14, 14, 14, 14,
>>> 14, 14, 14, 14, 14, 14, 14, 14,
>>> 14, 14, 14, 14, 14, 14, 14, 14,
>>> 14, 14, 14, 14, 14, 14, 14, 14
>>>};
>>>
>>>static const unsigned bishop_reach[64] = {
>>> 7, 7, 7, 7, 7, 7, 7, 7,
>>> 7, 9, 9, 9, 9, 9, 9, 7,
>>> 7, 9, 11, 11, 11, 11, 9, 7,
>>> 7, 9, 11, 13, 13, 11, 9, 7,
>>> 7, 9, 11, 13, 13, 11, 9, 7,
>>> 7, 9, 11, 11, 11, 11, 9, 7,
>>> 7, 9, 9, 9, 9, 9, 9, 7,
>>> 7, 7, 7, 7, 7, 7, 7, 7
>>>};
>>>
>>>static const unsigned knight_reach[64] = {
>>> 2, 3, 4, 4, 4, 4, 3, 2,
>>> 3, 4, 6, 6, 6, 6, 4, 3,
>>> 4, 6, 8, 8, 8, 8, 6, 4,
>>> 4, 6, 8, 8, 8, 8, 6, 4,
>>> 4, 6, 8, 8, 8, 8, 6, 4,
>>> 4, 6, 8, 8, 8, 8, 6, 4,
>>> 3, 4, 6, 6, 6, 6, 4, 3,
>>> 2, 3, 4, 4, 4, 4, 3, 2
>>>};
>>>
>>>static const unsigned pawn_reach[64] = {
>>> 23, 24, 25, 25, 25, 25, 24, 23,
>>> 1, 2, 2, 2, 2, 2, 2, 1,
>>> 1, 2, 2, 2, 2, 2, 2, 1,
>>> 1, 2, 2, 2, 2, 2, 2, 1,
>>> 1, 2, 2, 2, 2, 2, 2, 1,
>>> 1, 2, 2, 2, 2, 2, 2, 1,
>>> 1, 2, 2, 2, 2, 2, 2, 1,
>>> 23, 24, 25, 25, 25, 25, 24, 23
>>>};
>>>
>>>static const unsigned king_reach[64] = {
>>> 3, 5, 5, 5, 5, 5, 5, 3,
>>> 5, 8, 8, 8, 8, 8, 8, 5,
>>> 5, 8, 8, 8, 8, 8, 8, 5,
>>> 5, 8, 8, 8, 8, 8, 8, 5,
>>> 5, 8, 8, 8, 8, 8, 8, 5,
>>> 5, 8, 8, 8, 8, 8, 8, 5,
>>> 5, 8, 8, 8, 8, 8, 8, 5,
>>> 3, 5, 5, 5, 5, 5, 5, 3
>>>};
>>>
>>>static const unsigned queen_reach[64] = {
>>> 21, 21, 21, 21, 21, 21, 21, 21,
>>> 21, 23, 23, 23, 23, 23, 23, 21,
>>> 21, 23, 25, 25, 25, 25, 23, 21,
>>> 21, 23, 25, 27, 27, 25, 23, 21,
>>> 21, 23, 25, 27, 27, 25, 23, 21,
>>> 21, 23, 25, 25, 25, 25, 23, 21,
>>> 21, 23, 23, 23, 23, 23, 23, 21,
>>> 21, 21, 21, 21, 21, 21, 21, 21
>>>};
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.