Chess Puzzles with Density Option (mate-in-2)
Density | |||||||||
|
|
||||||||
|
|
Background
Back in the 90's, The Hindu news paper used to run a weekly chess column on Saturdays. It was called Chess Problem Corner and the author was CGS Narayanan. Every edition would publish a few chess problems and ask the readers to send solutions. These puzzles were mostly Mate-in-Two problems. I have collected several of these as newspaper clippings. I have also submitted several solutions and got a certificate too :)
Later, in around 1999, I came across a text file from internet which had several thousands of these puzzles stored in PGN format. I have cleaned up the data, categorized with density and scripted up a parser and viewer for these puzzles. Since this is a static page, I have limited it to only about 1000 puzzles here.
If you like chess end game strategies, I recommend the book "2545 End Game Studies" by Gary Kasparyan. This book used to be in my hands whenever I go to country-side in villages :)
What is a Mate-in-Two?
For those unfamiliar with these puzzles, the posiiton dispalyed is a hypothetical chess scenario composed by an author, who devised it in such a way that White makes the first move and then, irrespective what move black makes, the White would check-mate in the next move. White's first move is called the solution and the reader is asked to find it.
I wrote this page originally for IE4 browser using DHTML which was all the rage those days. Recently I have made some minor changes to make it work with latest browsers and CSS versions, while retaining its minimality and simplicity.
Note: This is only a viewer and doesn't support moving of the pieces (which is not really needed for these puzzles). You can only navigate through the puzzles.
A fun fact - the pieces on the boards are actually Unicode characters, and not icons or images!