World Champ Problem Composing Contest 38

[Bill Salot]

It is time for a change of pace, major fireworks, bigger than life, impractical, strictly-for-show, eye-popping sweepers in honor of stroke specialist Melvyn Green (England). Critics will say these are easy to compose and easy to solve; we will see!

Prolific composers Atkinson, Little and Salot continue their mutual confrontations by each offering a highly animated pair of original, unpublished examples. Each pair of entries is similar in that their solutions differ in the same way, thus dividing the contest into two categories. You will see!

On other words, the contest simultaneously matches 6 problems, 3 composers, and 2 problem categories. Who will decide the winners of those matches? If willing, you, the readers will do it, each with a single vote for your choice of the most entertaining animation at the link below. Go see!

By disclosing your vote to Salot, at the address under the diagrams, before the polls close, you can climb on the problem evaluation ladder, currently headed by Liam Stephens (Ireland).

[Bill Salot]

All,

I have been asked why the animation of one of the problems in this contest does not consummate the final sweep.

Several years ago, Jason Solan explained to me that the animation program has a glitch that makes it unable to jump a large number of pieces when an alternate jump of fewer pieces is available. It always jumps the fewer pieces.

Please don't hold the animation glitch against the problem. In fact, it is to the composer's credit that his problem was capable of baffling the computer program.

[George Hay]

Critics will say these are easy to compose and easy to solve; we will see!

There is still time to vote for your favorite problem, but the contest time clock is running out!

--George Hay