I started working on a chess engine last summer but I stopped after 2 months. Now I have come back to chess programming and I have implemented the UCI protocol in my engine. It lacks a lot of features for now, but I have been playing some games with it against other engines and I didn't have any stability problems, so I decided to make a first release.
It comes with a linux 64-bit compile and the source. I hope someone can make windows compiles. I would be grateful if someone included my engine in their rating lists.
Thanks Wael and Jim for the kind words and for the logo. I have a question for testers. I was wondering if limited depth per move, nodes per move or time per move are common in testing. I ask this because I don't want to bloat the code.
Currently, those time controls are commented out but I have no problem in including them if someone needs them for testing.
Thanks
Fixed depth searching is FUNDAMENTAL to verify a cleanup change or a change that should not change the functionality in any way, as example a simple optimization, actually does not change anything.
If searched nodes count is the same before and after the change then patch does not have hidden bugs. So you need search at fixed depth on a set of positions.
For Stockfish I use search at depth 13 on 16 positions, it is about 40M nodes.
I started working on a chess engine last summer but I stopped after 2 months. Now I have come back to chess programming and I have implemented the UCI protocol in my engine. It lacks a lot of features for now, but I have been playing some games with it against other engines and I didn't have any stability problems, so I decided to make a first release.
It comes with a linux 64-bit compile and the source. I hope someone can make windows compiles. I would be grateful if someone included my engine in their rating lists.
