BDS
2nd Prize, The Problemist, 1982 (v)
H#2 (b) bPf6->e3
PAO a6
VAOs a7; a4
a) 1.Qg1 VAf2 2.Rb6 Se3# b) 1.Qh6 PAg6 2.Bb6 Sf6#
During my early years composing, I composed lots of fairy problems and, in those days, couldn’t computer test them. This problem was the only one of them to win a prize, but it was also the only one that, in later years, the computer found fault with. There was a cook. This diagram is a version I produced many years after it had won its prize.
Developed and maintained by Brian Stephenson.
Implemented with HTML5, MySQL, Perl (with, inter alia, CGI::Simple, HTML::Template & XML::LibXML) &
CSS/Javascript (jQuery, Bootstrap & DataTables).