MatPlus.Net

 Website founded by
Milan Velimirović
in 2006

16:25 UTC
ISC 2024
 
  Forum*
 
 
 
 

Username:

Password:

Remember me

 
Forgot your
password?
Click here!
SIGN IN
to create your account if you don't already have one.
CHESS
SOLVING

Tournaments
Rating lists
1-Jan-2024

B P C F





 
 
MatPlus.Net Forum General The history of A-to-B-Chess
 
You can only view this page!
Page: [Previous] [Next] 1 2
(21) Posted by Kevin Begley [Monday, Oct 17, 2011 17:43]; edited by Kevin Begley [11-10-17]

Err, my PDB count was way off... some modifications were required.

Here's a more 'refined' (if you dare use this term for such a mess) search, for PDB:
stip='A nach B' or stip='A->B' or (stip='OST' and not stip='-ost' and not stip='post' and not stip='host' and not stip='ostr' and not stip='ost-' and not stip='osta')

PDB:
Total A->B: 50 (or less)
B=A: 46 (or less)
B!=A: 4 (two of which are cooked).

WC:
Total A->B: 161
B=A: 64
B!=A: 97 (two of which are cooked).
 
 
(Read Only)pid=7490
(22) Posted by Hauke Reddmann [Monday, Oct 17, 2011 18:18]

@Cornel - sorry, I overlooked the ".5" at the end of the
number. That explains all :-)
So a tempo must be lost. Can the "how" described in a
fairly short, human-understandable manner? (I.e. copy
and paste the solution comment from the original
magazine and make me a happy Panda :-)

@Kevin - I could show you a task problem of mine which is
exactly guilty as accused by you - dumb, mechanic, cheating.
But I could as well show stuff I'm really proud of.
Everest - because it's there. Same for tasks.

Hauke
 
   
(Read Only)pid=7493
(23) Posted by Kevin Begley [Monday, Oct 17, 2011 21:06]

@Hauke,

I'd rather avoid this subject, in this thread... so, I'll just reply in another thread.
 
   
(Read Only)pid=7495
(24) Posted by Jacques Rotenberg [Tuesday, Oct 18, 2011 09:53]

As far as I am concerned by the problem of Trillon, I may add a few words :
1) to seetharaman kalyan : this problem has been made without any computer.
2) The mechanism is relatively simple, but the exact reckoning of the moves needs concentration.
3) The solution has been published in Rex Multiplex with some intermediate diagrams.
4) The author aimed a problem as long as possible with as much orthodoxy as possible. He kept the following conditions :
- 8x8 board
- no fairy pieces, no fairy condition
- no pawn on the 1st or the 8th rows
5) To look at such a problem represents certainly a (small) investment, so everyone has to evaluate if he is interested or not.
6) it seems till now to be the longest problem ever published - far longer than the longest theoretical game (with the 50 moves rule)
 
   
(Read Only)pid=7499
(25) Posted by seetharaman kalyan [Tuesday, Oct 18, 2011 21:57]

I was not able to understand the word "exactly" in the stipulation. Is it that solutions in lesser number of moves do not count?
 
   
(Read Only)pid=7505
(26) Posted by Jacques Rotenberg [Wednesday, Oct 19, 2011 01:56]

I think the word "exactly" is only for the ",5".
The aim should be understood as follow:

White to play, white and black cooperate to come back to the same position but with black to play. What is the shortest way, and how long is it ?
 
   
(Read Only)pid=7506
(27) Posted by Per Olin [Friday, Oct 21, 2011 21:24]

Thank you to all, who contributed to this thread! Special thanks to Cornel for the old problems and the Trillon grotesque (I like it!) and to Kevin for, after having been on a sidetrack, found his way back to the right track!

Having myself an interest in A-to-B-proofgames, I have had a look into the databases. The problem form seems to suit well for seriemovers. Traditional proofgames are a young problem form and yet has not been much done outside proofgames starting from the standard initial position. But as composers we should remember that, in addition to the standard initial position, a proofgame can start from any Chess960 (FischerRandomChess) position or any position!
 
 
(Read Only)pid=7517

No more posts
Page: [Previous] [Next] 1 2

MatPlus.Net Forum General The history of A-to-B-Chess