Chess 2 Skills
Home
You are Here »
Home
»
Solve This
» A Knight Problem
0
A Knight Problem
Solve This
A knight standing on a center square (e4, e5, d4, d5) has eight different squares it can move to in one move. How many can it reach on the second move?
◄ Newer Post
Older Post ►
Popular Posts
The Opera Game
H.R.H. the Duke of Brunswick is a thorough devotee to Caissa; we never saw him but he was playing chess with some one or other. We were freq...
The Sentinel
A lonely sentinel stands on the forward point of a fortress. He cannot be removed by the enemy, but nor can he retreat. As long as he stands...
Hitting the Books
Context A distinctive element of GM-RAM: Essential Grandmaster Knowledge (2000) draws in some readers and pushes many others away. Rashid Z...
The New Informants
Long a publication that crosses language barriers, in recent years Chess Informant has been expanding its front sections with articles writ...
Problem Solving Contest
At today's Groundhog's Shadow youth chess tournament, participants may attempt to win a chess book. One entry will be drawn from all...
Calculation
Working through a random set of combinations from the Anthology of Chess Combinations , third edition, I find that I need the patience to sl...
Perceiving Threats
Lesson of the Week Youth chess students in the after school clubs that I coach will be looking at a position from a game played by a young p...
One Game
The past few weeks I have been trying to avoid long strings of online blitz games. It's not always easy . Instead, I try to play a sing...
Initiative
Morphy -- Lowenthal, London 1858 The fourteenth match game between Paul Morphy (1837-1884) and Johann Jacob Lowenthal (1810-1876) is an inst...
Decoy Sacrifice
Lesson of the Week Young players in my school clubs, as well as those receiving individual instruction, are presented with a position from a...
Powered by
Blogger
.
Copyright 2011
Chess 2 Skills
is proudly powered by
blogger.com
