Some will be quite easy; some will be quite difficult.

A thread for chess players of all abilities.

Chess Art is welcome too.

An easy one to start:

Some will be quite easy; some will be quite difficult.

A thread for chess players of all abilities.

Chess Art is welcome too.

An easy one to start:

A thread for chess players of all abilities.

Chess Art is welcome too.

An easy one to start:

The spectacle is not a collection of images, but a social relation among people, mediated by images. - Guy Debord

- Cuchulainn
**Posts:**64120**Joined:****Location:**Drosophila melanogaster-
**Contact:**

Latin Square./Cayley Table

- katastrofa
**Posts:**9921**Joined:****Location:**Alpha Centauri

Came up with four more. It feels like my brain developed a greedy search algorithm.

Great! Only one image of four is showing, but clearly you have found several ways to distribute the queens so they can rule the board together harmoniously. : )

I will rummage around my chess archives and come up with another brainteaser for the weekend.

I will rummage around my chess archives and come up with another brainteaser for the weekend.

The spectacle is not a collection of images, but a social relation among people, mediated by images. - Guy Debord

Here is a classic dating back to 1512! I will not give you its formal name yet, so let's just call it

**Switching Knights**

There are 4 knights on a 3×3 chessboard: two white knights at the lower corners and two black knights at the upper corners.

What is the*minimum* number of moves for the white knights to wind up at the upper corners and the black knights to wind up at the lower corners?

There are 4 knights on a 3×3 chessboard: two white knights at the lower corners and two black knights at the upper corners.

What is the

The spectacle is not a collection of images, but a social relation among people, mediated by images. - Guy Debord

If that is quite easy for you, you can also try this: same thing - all of the knights switch places - what is the minimum number of moves?

Here are sample solutions to Guarini's Puzzle (or "Problem"), using graph theory and mapping the progress of the knights (or frogs, as the case might be).

Obviously, the Knights are constrained in their move pattern and for them, the answer is 16.

Here is a discussion of the puzzle, with a little proof you can check out: Switch the Knights - Puzzling - Stack Exchange.

Obviously, the Knights are constrained in their move pattern and for them, the answer is 16.

Here is a discussion of the puzzle, with a little proof you can check out: Switch the Knights - Puzzling - Stack Exchange.

- katastrofa
**Posts:**9921**Joined:****Location:**Alpha Centauri

I solved both on this website: http://dm.compsciclub.ru/app/quiz-guarinis-puzzle

But I couldn't prove my result!

But I couldn't prove my result!