misc

Doskey


Bishops Puzzle: 

I hope you will forgive my algebraic notation, but I found it easier
to read (since we know every move is a bishop).

White bishops start at b1 and d1, 
Black bishops start at b5 and d5.

01. b1-c2
02. d5-a2
03. b5-c4
04. c2-a4
05. a2-b1
06. c4-d3
07. a4-b3
08. b3-d5
09. d3-b5 (board is symmetrical)
10. b1-d3
11. d1-b3
12. b3-a2
13. d3-c2
14. b5-a4
15. a2-c4
16. c2-b1
17. a4-d1
18. c4-b5

This was not the first solution that I found, but I liked it because
it was symmetrical.  Once you get to step 9 you are basically 

ECO codes

Exeter Chess Club: Complete ECO codes
Complete ECO codes, from ECO A-E first edition
-- as posted on rec.games.chess: Revised 7 Feb 97 -- DR

Summer Coaching 2010

26th_May_2010: Summer Coaching 2010

With the close of the club championship (congratulations Graham) I am thinking about organising some coaching sessions over the summer (the latest phase of the blind leading the wossname).  If people would like this, I would like suggestions, and perhaps even volunteers, for sessions.

Knight's Tour

Gunno Toernberg tells me he has been working on a computer approach to the problem: you can see his endeavours at: http://w1.859.telia.com/~u85905224/knight/eknight.htm where you can have ago on his Java board.
Comments on: Martin Loebbing and Ingo Wegener, The Number of Knight's
Tours Equals 33,439,123,484,294 --- Counting with Binary Decision
Diagrams

Comment by the authors, May 15, 1996:

The number of knight's tours given in the paper is incorrect, since

Stone Soup

From the FRACTINT documentation

Appendix B Stone Soup With Pixels: The Authors

THE STONE SOUP STORY

Once upon a time, somewhere in Eastern Europe, there was a great famine. People jealously hoarded whatever food they could find, hiding it even from their friends and neighbors. One day a peddler drove his wagon into a village, sold a few of his wares, and began asking questions as if he planned to stay for the night.

  [No! No! It was three Russian Soldiers! - Lee Crocker]
[Wait! I heard it was a Wandering Confessor! - Doug Quinn]

Semi-Random Baseline Chess

Semi-Random Baseline Chess

(wild style 1 on Free Internet Chess Servers)

  White and Black play with piece arrangement, where each side's pieces are shuffled separately at random subject to two constraints:

  (1) because castling is such a big part of the game and adds so much more to planning ("I'll provoke a2-a3 so they won't castle queen's-side") the possibility of castling on either side should be preserved. After that, the pieces are randomly shuffled, subject to
(2) there being bishops of either colour square.

Credits

2010

Biggest hat-tip in the world to Simon Waters for getting this baby afloat on his tame Drupal server, and thanks also to Tim P for fixing some tiresome CSS.

Argh 2006

Equally enormous hat-tip to Tryfon Gavriel of www.LetsPlayChess.com for finding a place for us to shelter when Exeter University went through a bout of indigestion.

Sadly, one of the consequences of moving from Exeter University was dropping a couple

Pages

Subscribe to RSS - misc