MatPlus.Net

 Website founded by
Milan Velimirović
in 2006

15:33 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 Internet and Computing Using Popeye for very quick testing of long help problems
 
You can only view this page!
(1) Posted by Geoff Foster [Wednesday, May 27, 2009 11:35]

Using Popeye for very quick testing of long help problems


Popeye can solve a=>b proof games (see "Another Popeye mystery" thread). This can be used to do very quick testing of help problems. For example, consider the following problem.

Imre Telkes, 1 Prize, Magyar Sakkvilag, 1943
(= 5+14 )

H#15
1.S*f6 e*f6 2.Rd2 e5 3.Rd6 e*d6 4.e5 d7 5.e4 d8=S 6.e3 Se6 7.f*e6 f7 8.e5 f8=S 9.e4 Sg6 10.h*g6 h7 11.g5 h8=Q 12.g4 Qb2 13.e2+ Q*e2 14.e3 Q*f3 15.Qg2+ Q*g2#

In the Popeye input file you need to specify the initial and final positions. In this case the input would be as follows:

begin
protocol telkes.txt
pieces
white kf1 pf6 ph6 pe5 pe4
black kh2 qh1 rh3 re2 bg3 sg1 sg4 pf7 ph7 pe6 pf4 ph4 pf3 pf2
stipulation a=>b15
pieces
white kf1 qg2
black kh2 rh3 bg3 sg1 pf4 pg4 ph4 pe3 pf2
endproblem

Popeye solves this in 0.1 seconds! Of course this does not guarantee soundness, because there could be cooks which have a different final position, but it is a very quick way for a composer to test for cooks. This method can also be used for helpselfmates, but because White moves first, you must switch the white and black pieces. Here is an example:

Unto Heinonen, 2 Prize, The Problemist, 2004
(= 1+7 )

HS#21
1.Ka8 c3 2.Kb8 Ba2 3.Kc8 Kf6 4.Kd7 c5 5.Kd6 c4 6.Kd5 h3 7.Ke4 h2 8.Kf3 h1=B+ 9.Ke2 Be4 10.Kd1 Beb1 11.Kc1 c2 12.Kb2 Ke5 13.Ka3 Kd4 14.Ka4 Kc3 15.Kb5 Kb2 16.K*b6 Ka1 17.Kc5 b5 18.Kd4 b4 19.Ke3 b3 20.Kd2 c3+ 21.Kc1 b2#

The Popeye input would be as follows:

begin
protocol heinonen.txt
pieces
white ke2 bb3 be3 pb2 pc3 pc5 ph5
black kb1
stipulation a=>b21
pieces
white ka8 ba7 bb8 pb7 pc7 pc6
black kc8
endproblem

Popeye solves this in 1.7 seconds! You can also solve series-movers, but if Black plays the series then you must switch the white and black pieces. Here is an example:

Zdravko Maslar, in memoriam A H Kniest, 1 Prize, feenschach, 1985
(= 1+10 )

SH=21
1.a1=B 2.Bb2 3.Ra1 4.f1=R 5.Rfb1 6.Kf1 7.g1=S 8.Se2 9.Qe1 10.h4 11.h3 12.h2 13.h1=Q 14.Qa8 15.Qa2 16.Ba3 17.Rb2 18.Qeb1 19.Ke1 20.Kd1 21.Kc1, K*e2=

The Popeye input would be as follows:

begin
protocol maslar.txt
pieces
black ke6
white kg8 qh5 rf8 ph4 pb5 pb6 pa7 pc7 pf7 pg7
stipulation ser-a=>b21
pieces
black ke6
white kc8 qb8 qa7 ra8 rb7 ba6 se7 pb5 pb6 pc7
endproblem

Popeye solves this in 5.6 seconds!
 
(Read Only)pid=3740

No more posts


MatPlus.Net Forum Internet and Computing Using Popeye for very quick testing of long help problems