Queem – open source computer chess in C#

I had an interview long time ago when I was young and just started programming. I had been showing my badly written battleship game to a skilled guy in his office. It was written in Delphi but with Pascal one-big-function style and it wasn’t double buffered so it has known rendering problems. I said then “You see, it is not a chess, but..”.

In a few weeks I started writing my own chess. After 2 years they were rewritten 3 times and now they are implemented in C# using bitboards (chessboard in 64-bit integer).
There’re some tests for AI engine, graphics in WPF, svg’s for chess figures and a lot more.

Checkout at a GitHub page!

I have found a lot of interesting materials while writing Queem which have one leader – chessprogramming wikipedia. It contains everything you want to begin write your own chess.

There is also nice web page about Rebel, great chess program.

And a list of materials about chess programming.

YaCE contester engine

This is not-a-success story about one of my projects, YaCE (Yet another Contester Engine). It’s a system, written in Ruby and Bash which can check ACM problems solution validity. It can be scaled on a number of nodes, accessible via network (VMs or real machines).

The main reason to create it was to rewrite existing system which we used to train for ACM contests. “ACM Contester” was not scalable enough and it didn’t have precise enough measurements of used memory and cpu time, which is crucial for testing our solutions.

I wanted to make it scalable and predictable. I wanted to write it in Ruby on Linux and for Linux.
YaCE has been started 2 years ago and last commit was made 11 months ago.

Continue reading YaCE contester engine