Piece-Square Evaluation
 
Our goal is to release a working chess engine in Java, C++, and C# by April 24, 2003.

Team News:

March 25 Milestone met. (the protoype works!)

Everyone should download the Java code, run, and test it. Just download the newest versions of each of the five files and compile them.

March 20 Milestone met.

March 6 Milestone met.

We have basically started from scratch again as of March 1.

Meetings:

TBA
 
Piece material values:
K = infinity
Q = 900
R = 500
B = 300
N = 300
P = 100

Position values:
Give points for certain pieces in the middle, bish, knight, queen:

0
2
3
4
4
3
2
0
2
3
4
5
5
4
3
2
3
4
5
7
7
5
4
3
4
5
7
10
10
7
5
4
4
5
7
10
10
7
5
4
3
4
5
7
7
5
4
3
2
3
4
5
5
4
3
2
0
2
3
4
4
3
2
0

Give points for certain pawn advancement positions:

0
0
2
3
5
30
50
0
0
0
2
3
4
30
50
0
0
0
2
3
4
30
50
0
0
0
2
3
4
30
50
0
0
0
2
3
4
30
50
0
0
0
2
3
4
30
50
0
0
0
2
3
4
30
50
0
0
0
2
3
4
30
50
0

Give points for controlling these squares:

1
1
1
1
2
2
2
2
1
1
1
1
2
2
2
2
1
1
2
2
3
3
2
2
1
1
2
5
6
3
2
2
1
1
2
5
6
3
2
2
1
1
2
2
3
3
2
2
1
1
1
1
2
2
2
2
1
1
1
1
2
2
2
2

Minimax:
One side's points are all negative one side is positive, so we try to pull
the points as far to one side as possible. i.e. if we are negative side then see lower values as good. positive side sees higher values as good.

We run root-search (a dfs tree search) and calculate the value of each path to a leaf.