MatPlus.Net

 Website founded by
Milan Velimirović
in 2006

11:55 CET
 
  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

Rating lists
01-Jul-2019

B P C F





 
 
MatPlus.Net Forum Internet and Computing A forgotten Popeye option?
 
You can only view this page!
(1) Posted by shankar ram [Tuesday, Sep 2, 2014 04:48]

A forgotten Popeye option?


Unless I'm mistaken, older Popeye versions used to have this option:

- For problems taking a long time to solve, you could start the solving with this option enabled
- You could interrupt the solving at any time with Ctrl-C
- Popeye outputs a number
- You could then restart Popeye by feeding in the same problem along with the number
- Popeye would resume solving from the interrupted point (and... obviously, avoid solving from scratch)

This would be a form of "distributed computing".. only the same PC is used at different times..

Is this option still available in the latest versions?
 
(Read Only)pid=12628
(2) Posted by Joost de Heer [Tuesday, Sep 2, 2014 08:28]

You mean 'Option StartMoveNumber'?
 
 
(Read Only)pid=12629
(3) Posted by shankar ram [Tuesday, Sep 2, 2014 11:23]

Yes, indeed..
"Movenumbers" and "Startmovenumber"..
These options are very much there still..
Thanks, Joost..!
 
   
(Read Only)pid=12630
(4) Posted by shankar ram [Tuesday, Sep 2, 2014 14:36]

By the way..
Would the following also be possible?
- Popeye generates the total number of moves first; E.g: say, 1000
- Popeye is then run on 4 different PCs with a different "startmovenumber" ; E.g: PC A - 1; PC B - 251; PC C - 501; PC D - 751
- You would also need a new option to restrict Popeye to trying out only a specified number of moves; E.g: 250 in the above case

For those problems which take a long time, this would help in getting a solution more quickly by splitting the work among different Popeye instances.
 
   
(Read Only)pid=12631
(5) Posted by Linden Lyons [Tuesday, Sep 2, 2014 18:55]

Slightly off topic, but is there a way for Popeye to search for first moves that are defeated by two black moves, i.e. almost but not quite a try?

This makes me wonder if any interesting problem themes can be developed around a key, a try, and a 'semi-try'.
 
   
(Read Only)pid=12632
(6) Posted by Nikola Predrag [Tuesday, Sep 2, 2014 19:18]

Option Try Variation Defence 2
 
 
(Read Only)pid=12633
(7) Posted by Joost de Heer [Tuesday, Sep 2, 2014 21:57]

 QUOTE 

This makes me wonder if any interesting problem themes can be developed around a key, a try, and a 'semi-try'.

Gerhard Maleika has done things with cyclic multiple defences (1. A? X!/Y!, 1. B? Y!/Z!, 1. C? Z!/X!). Whether that's interesting is beyond me, I know nothing about direct mates and interestingness.
 
   
(Read Only)pid=12634
(8) Posted by Geoff Foster [Wednesday, Sep 3, 2014 00:48]

In reply to Shankar Ram's question, I have done this myself and it works well. If you have a modern PC with multiple processors then it can all be done on the one PC. There is no need to restrict Popeye to trying only a specified number of starting moves, because solving can always be interrupted, and there is no harm in trying extra moves anyway.

To find out the total number of starting moves, simply do a "dummy" run first with a very low stipulation. For example, if you want to test a ser-h#50, then first run Popeye with "stipulation ser-h#2" to get a numbered list of all the starting moves.
 
   
(Read Only)pid=12637
(9) Posted by shankar ram [Wednesday, Sep 3, 2014 14:44]

Thanks, Geoff!
Nice tip..
Who will write the book.. "Dummy's guide to Popeye"? ;-)
 
 
(Read Only)pid=12638

No more posts


MatPlus.Net Forum Internet and Computing A forgotten Popeye option?