Contests in Progress:
The magician above is indeed full of all sorts of tricks and we might well call her a "tricky one" although likely she would rather be known by the more formal designation of prestidigitator.
Often in the early part of each month we present a "speed" problem--- something for you to solve as quickly as you can. Such problems generally fall into the "easy" category. Today, though, we have a "tricky one" sent along (with analysis) by regular contributors Lloyd and "Gosh Josh" Gordon of Toronto. Is it as full of tricks as the magician above? You'll have to decide for yourself.
Although the problem terms are for White to find the draw, see if you can also hold the draw for Black. Unless you're an upper-level player you may not solve this one speedily, but some effort will be well rewarded. When you're ready to see the solution, though, there's no trick; just click on Read More.[Read More]
When traveling abroad, do we change currency or exchange currency? Or do we change currency at a Currency Exchange? We can probably say that's all a matter of semantics.
Not so much so, though, in our game of checkers. If you solve the twin problem below, sent to us by regular contributors Lloyd and "Gosh Josh" Gordon of Toronto, you'll see what we mean.
Black to Play and Win
These are not terribly difficult. The Black win is especially easy, and as for the White win, we've practically given it away. Find the solutions--- time yourself if you want an extra challenge--- and then exchange your mouse position with Read More (or should we say change your mouse position to Read More) to see the solutions.[Read More]
Is there such a thing as too many pictures? Evidently so. The photo above shows an art display that hardly accords with accepted practices. It's overcrowded and the pictures aren't well positioned.
The previous entry in Bill Salot's outstanding series of checker problem composing contests featured problems that had a visual aspect--- they were works of art in both the visual and ludological senses. For our current contest, Mr. Salot has continued with that theme. Too many pictures? Hardly! We're sure everyone will welcome this new trio of dual-artform problem settings.
The contest problems themselves can be found, as always, on the contest page. We hope you'll drop by, give the problems a try, and of course cast your vote for the one you like best.
As a lead-in, we present a problem by the late Roy Little, which he called Mr. X. It was the winner of Contest 11 back in June, 2013.
Solve this one, click on Read More to check your solution, and then visit the contest page![Read More]
Pictures at an Exhibition, composed in 1874 by Modest Mussorgsky, was originally a suite of ten piano pieces linked together by a "Promenade" theme, intended to represent the experience of walking through an exhibition of the paintings of artist Viktor Hartmann at the Imperial Academy of Arts in St. Petersburg, Russia. The compositions were orchestrated in 1922 by Maurice Ravel, and this is the version that is most well known today.
We have something similar in checkers, and in this, the 67th Problem Composing Contest sponsored by Bill Salot, we'll see an exhibition of checker art that is visual as well as artistic in play quality. To illustrate this, here is one that Bill calls WreckTangle and credits to former World Champion Alex Moiseyev, who created it independently. However, it happens that Ed Atkinson was the original composer; he called it Pandora's Box.
Bill notes that there are other famous images on a checkerboard, such as the Picture Frame arising from games in Boland's Famous Positions, Page 187. Bill goes on to remark that there are numerous other patterns published in various checker problem books.
In this month's contest, Bill features three "art works" so to speak (alas, not ten as in the original "Pictures at an Exhibition"). They can be found on the contest page. Be sure to try them out and then vote for your favorite.
The solution to WreckTangle (or Pandora's Box, if you will) can be seen (after you've tried to solve it, of course!) by clicking on Read More. We hope you enjoy it and all of the contest problems.[Read More]
It's quite early for the Easter Bunny (Easter 2023 is on April 9) and somewhat late for Chinese New Year and the Year of the Rabbit (January 22). So let's look at a little math problem instead:
"Chris is training Hoppity, her pet rabbit, to climb stairs. It will hop up one or two stairs at a time. If a flight of stairs has ten steps, in how many ways can Hoppity hop up the this flight of stairs?"
Oh, wait, this is a checker column. Well, in fact regular contributors Lloyd and Josh Gordon have sent along a "speed" problem they call "Hopper" so it seemed like something about a rabbit would be an appropriate lead-in. And no, the problem has nothing to do with the late GAYP master Millard Hopper.
The problem itself is a lot of fun, and of course the layout of the pieces, not to mention the problem's title, give a huge hint. It's certainly not a hard problem and can be quickly solved with just a bit of visualization. As we're fond of saying, top players will see it at once while the rest of us may require a few more seconds, or maybe even a minute or so.
It doesn't matter what category you may fall in, whether top flight professional or enthusiastic novice. See how fast you solve it and then hop your mouse to Read More to jump to the solution.[Read More]
You're likely familiar with the phrase, "quick like a bunny" or "quick as a bunny" meaning, in its imperative form, to tell someone to do something very rapidly. However, that phrase is relatively recent, dating back to only the 1940s according to most sources.
"Quick as a bee" has the same meaning, but is much older; 400 years older, to be exact. It appeared in John Heyward's Proverbs back in 1546. So for today, we'll weigh in on the side of history, and ask you to solve this month's speed problem "quick as a bee." In fact, it's quite easy, and an experienced player will see the solution in about two seconds. Novices should eventually get it as well.
Do you have the solution already? You can always buzz (1546) or hop (1940s) over to Read More to see the solution.[Read More]
The chase is on! The traditional fox hunt, now very much out of favor and considered cruel, has for the most part become illegal, and although especially in England it's a centuries-old amusement for the wealthy, perhaps indeed its time has passed.
But in our game of checkers, the chase is alive and well, and forms the theme of the 66th in Bill Salot's long and outstanding series of checker problem composing contests.
Mr. Salot states that, as in the preceding contest, these original, unpublished, strategic dandies are non-strokes, although a shot may ring out occasionally during a wild "chase." Four new problems await you on the contest page. Be sure to try them all and then don't forget to vote for your favorite.
Here's a teaser problem showing off the contest theme. It's by the late grandmaster composer Ed Atkinson, and it's typical of his genius.
Chase after the solution, but there's no need to hunt down the results, as you can just click on Read More to see how it's done. Then, on to the contest page![Read More]
We're already almost a full week into the new year 2023 at the time of publication of this column. By now surely you're back to work, school, or whatever your regular activities may be. You've had time to recover from any potential excesses of holiday celebration, and we're in that post-holiday letdown period.
So perhaps an easy checker problem will cheer you a bit and get you on your way to another year of checker enjoyment. Here's one from regular contributors Lloyd and "Gosh Josh" Gordon.
The draw is straightforward but ... well, you'll find out. See how you do with this one and then click on Read More to see the solution.[Read More]
There are all sorts of traps in life. You can get trapped into smoking (that's apparently what the photo above is all about, although it's hardly obvious). You can get trapped in a dead-end job. You can get trapped in a bad relationship or social situation.
As we well know, there are traps in checkers, too. Can you get trapped into becoming a checkers addict, if there is such a thing? Maybe. That's beyond our realm of knowledge. But over the board traps? They're legion.
In today's Checker School column, we'll have a look at what John T. Denvir, an older-day checker writer who is either famous or infamous depending on the account you read, calls Trap No. 36 in his book, John T. Denvir's Traps and Shots, published in 1894.
This is quite an interesting one and we hope you'll give it a good try. Will you be trapped into spending a lot of time looking for the solution? We can't really say; all we know for sure is that clicking on Read More will take you to the solution, and not lead you into a trap.[Read More]
There are various meanings and significances for the number 999. For one thing, it's the emergency phone number in Great Britain and some other places. Another UK related but much less important usage was as the name of a London punk-rock band quite some while ago.
Perhaps of greater interest is that 999 is a so-called Kaprekar number. An adapted version of the Wikipedia definition of a Kaprekar number is as follows: "A natural number in a given number base is a Kaprekar number if the representation of its square in that base can be split into two parts that add up to the original number." So, quite trivially 999 squared in base 10 is 998001, which can be split into 998 and 001, which add up to 999. Simple!
We'll omit the more fanciful descriptions of 999 as an "angel number" and instead tell you why we've chosen this title for today's column, which features a very special problem by grandmaster composer Brian Hinkle. It has nine pieces per side, or 9x9, and of those pieces, 9 are kings, hence, 9x9x9 or 999.
Here's the position.
Brian would prefer no spoilers, so we won't say anything further, not even whether it's easy, medium, or hard (although, since it's from Brian, "easy" would surprise us). See how you do with it. Take 999 seconds, 999 minutes, or however long you wish. Try 999 different approaches. But certainly you only need to click your mouse once--- not 999 times--- on Read More to see the solution.[Read More]