 |
|
|
|
|
|
||
|
|
||
|
|
||
|
|
|
|
|
|
||
|
|
||
|
|
||
|
|
|
|
|
|||||||||||||||||
Add Forum to Favorites | Send Topic To a Friend | View Forum FAQ | Track this topic |
Last Thread Next Thread |
| Chess Programming Part VI: Evaluation Functions |
|
 |
Anonymous Poster |
|||
 Posted - 9/20/2003 5:23:04 AM |
||||
| gnbb |
||||
|
||||
|
Anonymous Poster |
|||
Posted - 9/20/2003 5:23:08 AM |
||||
| gnbb |
||||
|
||||
|
Qatal Member since: 12/25/2001 From: New Zealand |
|||
 Posted - 10/25/2005 8:28:49 PM |
||||
| just completed a port of this to C# and noted a few things: - there's one spot where the rank/file extraction code is toast. (square >> 8) should be (square >> 3) - it's REALLY slow! i cant imagine how slow it would have been in java... - in places, the code is difficult to understand, mostly because of poor structure, duplication, etc. most of it is quite fixable, and I will post my set of c# code when all is refactored. |
||||
|
||||
|
TriKri Member since: 3/13/2006 From: Linkoping, Sweden |
|||
 Posted - 3/13/2006 4:35:57 PM |
||||
| Good articles! I think it's really nice finding a complete series of chess program articles, covering the most, inclusive search algorithms and evaluationg functions. |
||||
|
||||
|
Anonymous Poster |
|||
Posted - 3/13/2006 4:44:14 PM |
||||
| I'd say it has more to do with chess theory than the mechanics of chess AI. A very general article without any concrete technical details. |
||||
|
||||
| All times are ET (US) |
Last Thread Next Thread |
|
