BrainKing - 讨论板 (Chess variants (10x8))

监管者:

Chess variants (10x8)

Sam has closed his piano and gone to bed ... now we can talk about the real stuff of life ... love, liberty and games such as
Janus, Capablanca Random, Embassy Chess & the odd mention of other 10x8 variants is welcome too

For posting:
- invitations to games (you can also use the New Game menu or for particular games: Janus; Capablanca Random; or Embassy)
- information about upcoming tournaments
- disussion of games (please limit this to completed games or discussion on how a game has arrived at a certain position
... speculation on who has an advantage or the benefits of potential moves is not permitted while that particular game is in progress)
- links to interesting related sites (non-promotional)

讨论板列表

状态: 所有人能发表

先显示最旧的消息。

26. 三月 2003, 03:30:30

Grim Reaper

显示此用户所有帖子 | 显示索引 | 链接

题目: The database + a contest!!

I can start working on the code for the BN vs K database tonight. It will not be slick, nor fast to execute, but I can get it up and running in no time. I think the longest win is about 38 moves (for one side) so it will need to loop around 75 times (38 times for the winning side, 37 for the losing side) and I am not sure how long each iteration will take to complete.

If I generalize the code to solve any db configuration, I would need to spend at least a week making it very fast.

OK, now for a contest:

Try to set up the most difficult position for a knight and bishop to mate a lone king.

So, tell me the location of:

White King
White Bishop
White Knight
Black King

For the longest white to move and win position you think there is. The winner I will give a free stainless steel Gothic Chess commuter mug, complete with thermal lid.

Post your submissions, one per customer, with the subject heading "B+N vs. K Contest"

OK?