Aart's Blog

With tears in my eyes I read the news and watched the pictures of the senseless attack on the Dutch royal family by a man who crashed his car through the crowd during the annual Queen's Day celebration. I pray for the victims and those who mourn.

Version 1.4 of Chess for Android is now available at the Android Market with the following new features: Two improvements in the engine: removed unnecessary restriction on search depth and fixed bug that could cause an out-of-bounds exception. The engine now detects draw by a simplified form of three fold repetition. The detection is not complete, since only limited game history is kept; but at least this new feature avoids some very annoying repetitions. Draw by the fifty move was already implemented. A new level "Auto-play" has been added (press the Menu button). If this level is selected, then the next time the engine takes control (make either a move or touch "Reverse sides"), the game is played automatically.

Due to all Android distractions, it has been a while since I posted on BikJump. It recently ended at a somewhat disappointing 54th place in OpenWar 5th Edition . Version 2.01 is now playing in the final of the 5th Division WBEC Ridderkerk edition 16 .

I ported the Java source code of the engine in Checkers for Android into C++ and implemented the parts required to form a plug-in engine for Martin Fierz' CheckerBoard application. The result is BikMove (with an obvious wink to my UCI chess engine BikJump). I also added the ability to query checkers endgame databases based on Martin Fierz' probing code (used with his kind permission). The main features of BikMove are listed below: Checkerboard compliant checkers engine. Iterative deepening, alpha-beta pruning. Queries endgame databases during search. The engine needs some more work to become competitive with others checkers engines, but it already plays what looks to me like decent checkers. Give it a try if you are interested!

As can be seen in previous postings, the perft method is useful to verify the correctness of a move generator. The method traverses the game tree up to various, increasing depths to count all leaf nodes. The results are compared with pre-computed values to isolate bugs. Although the method originated in the chess programming community, the same debugging principle can be used for any board game with deterministic rules. So far, I have used perft to verify the move generation of Chess for Android and, thanks to Martin Fierz , also for Checkers for Android. I was unable to find pre-computed perft numbers for reversi, however. Therefore, here is what is probably the debut of perft for reversi from the initial position, hopefully useful data for aspirant reversi programmers (at depths 9 and up, "passing" moves start to occur; at depths 11 and up, higher leaf nodes in which neither player can move start to occur). DEPTH #LEAF NODES ======================== 1