Computer Chess

I have been involved in Computer Chess since 2002, when I was 14. I have been programming since I was in seventh grade (2000), when I took a C++ class.

My main project is ZCT, Zach's Chess Test. It has its own page.

I also did some work on Toga, implementing parallel search. Here are the sources of the latest beta.

One place to get good computer chess info, though it's a little incomplete now, is the Chess Programming Wiki. I am an organizer there. You are encouraged to read and contribute!

I concentrate on several areas in computer chess:

• Bitboards, including progressive attacks
• Unconventional evaluation
• SMP search, particularly Dynamic Tree Splitting
• Unconventional move ordering
• Automatic Tuning, eventually leading to learning new features (someday...)

Here's some ideas that I've come up with, some of them being stupid and trivial:

• A new testing/versioning system
• Progressive Granulation
• A nice unrotated bitboard indexing scheme
• A move generation scheme that is an extension of bitboards to ternary--titboards!
• Storing an incremented counter in history tables, rather than just incrementing the entry. This makes history local rather than global. This doesn't seem to work though.
• Storing in different killer move slots for PV and non-PV nodes (but accessing both in each node)