Re: Maximum possible chess moves
- From: denis feldmann <denis.feldmann.sansspam@xxxxxxxxxxxxxxxx>
- Date: Mon, 09 Jan 2006 16:25:33 +0100
Jose Capco a écrit :
Dear NG,
I dont know if this has already been discussed before, but I'll just write the problem here. It could be placed in a more suitable newsgroup, but I only frequently post here and this is still a combinatoric problem.
We were discussing with a few fellow chessmates in the the chess-server (FICS) about the longest possible chess moves
You probably mean "longest sequence of moves"
that can be done
deliberately by two chess player while still following the rules of chess. Most important to note is the 50 move rule, which says that a game is a draw if upon the 50th move there is no pawn move or exchange of pieces and the draw is claimed after the 50th move (and we assume this will be done if it happens).
Without these conventions, you still get draws by repetition, but games can be much longer
Someone came with a wild number 5980
or a few figures higher,
The figure given by Le Lyonnais in his chess Encyclopedia is 6550, IIRC
but I couldnt follow his line of thought.
Not very hard, nevertheless : you use repetitive sequences (lie knights tour) of 49 moves, then advance a pawn, use capture of pieces to change columns and get the pawn promoted, repat with the other pawns, then exchange all the pieces...
I
thought I pose this problem here for the combinatorics and chess enthusiast :)
Sincerely, Jose Capco
.
- References:
- Maximum possible chess moves
- From: Jose Capco
- Maximum possible chess moves
- Prev by Date: Re: Well Ordering the Reals
- Next by Date: Re: Generalized of dominated convergence theorem
- Previous by thread: Re: Maximum possible chess moves
- Next by thread: Re: Maximum possible chess moves
- Index(es):
Relevant Pages
|