New Chess Engine: Gray Matter
Posted: 13 Jul 2007, 14:35
Greetings, fellow chess engine enthusiasts!
My name is Raj and I'm the primary author of Gray Matter. I started this project to teach myself (and hopefully others) about chess engine programming. I've been documenting my progress on my wiki and blog. I'm in need of some advice.
1. How strong is Gray Matter? I'd appreciate it if someone would estimate its rating.
2. What could make Gray Matter stronger? Currently, Gray Matter uses fail-soft alpha-beta with MTD(f), rotated bitboards, and a simple transposition table. I believe null-move pruning, quiescence search, and a more sophisticated transposition table (which stores both upper and lower bounds) would yield the most dramatic improvements in strength. I'd appreciate it if someone would give me feedback on my analysis.
I host my code on Google and I liberally grant commit privileges - not only to programmers but also to people who may wish to twiddle the wiki. Thanks for allowing me this opportunity to participate in a vibrant community.
My name is Raj and I'm the primary author of Gray Matter. I started this project to teach myself (and hopefully others) about chess engine programming. I've been documenting my progress on my wiki and blog. I'm in need of some advice.
1. How strong is Gray Matter? I'd appreciate it if someone would estimate its rating.
2. What could make Gray Matter stronger? Currently, Gray Matter uses fail-soft alpha-beta with MTD(f), rotated bitboards, and a simple transposition table. I believe null-move pruning, quiescence search, and a more sophisticated transposition table (which stores both upper and lower bounds) would yield the most dramatic improvements in strength. I'd appreciate it if someone would give me feedback on my analysis.
I host my code on Google and I liberally grant commit privileges - not only to programmers but also to people who may wish to twiddle the wiki. Thanks for allowing me this opportunity to participate in a vibrant community.