i have written compute program to solvethis puzzle. it shows all thw 92 solutions. ha ha it took my 1 hour to find all 92 solutions

Go on Coolmath.com and play the bridge puzzle. Kinda difficult.

Awesome! I never thought about putting 8 queens with having them attack each other.

Also, summitwei, coolmath is the best math website ever!

http://www.coolmath4kids.com/math_puzzles/Logic-eightqueens/index.html

another website to play the eight queens!

nice :)

1.82  2.1204

1. = 82

1.64 2.414

I love it. You are really not only a good chess player but also a great mathematician. Cool! Fantastic! Marvelous!

I got some math problems for you.. solve this:

1. (7-5x4) + (40+34)=          2. 400+6x3 - (40-26)=

I'm gonna be so happy if you answer it correctly...

Yeah...good problem. I can't think anymore, I spent my energy in playing chess this evening.. No other things inside my head thanks to Abe4869, I knew what to tell you...thanks by the way I learned techniques...

Thanks OBIT for the solution. By the way, about the maharajahs on the 10X10 chessboard- 7 of the moves between the pieces are called wizard's moves in omega chess terminology (another chess variant).

For the symmetrical solution, place the queens on a3, b5, c2, d8, e1, f7, g4, h6.  I found this by writing a computer program that generated the 92 solutions.   (As has already been pointed out, there are 12 if rotations and reflections are excluded.)

Here another interesting one, which I found by expanding the computer program: Imagine a piece that combines the moves of the queen and the knight.  Let's call this piece a "maharajah", as it is known in at least one chess variant.   It is possible to place 10 maharajahs on a 10x10 chessboard such that none of them are attacking each other.  What's more, there is only one distinct solution, and the solution is symmetrical!  The solution is (call the new files i and j): a3, b6, c9, d1, e4, f7, g10, h2, i5, j8.

This is another solution: Qf1, Qd2, Qb3, Qh4, Qe5, Qg6, Qa7, Qc8: The solution is to put first a queen in every row. then verify that any of the queens are in differents files. Finally you have to verify the diagonals: 4 black and 4 white.

This is not good diagram  jonatz_elise for 7 queens because Qc6 & Qh1 are attacking each other and also Qe2 & Qe7.

Wow! I thought that there's no solution to that puzzle!!! Once my classmates are trying to solve that puzzle......not one of us solved it. Here is one of the diagrams that we only put 7 queens

You say there are 12 solutions. Can you show the most simetrical one? It would be pretty.

good

Wow!