My solution to the N Queens Problem (with Backtracking)
(N_QUEENS_MAIN.vi)
Hello ouadji,
Is there something we can help/assist you with?
Or did you just felt like sharing the code? ![]()
Is it related to a coding challenge that I'm not aware of?
Is there something we can help/assist you with?
no, thank you.
Or did you just felt like sharing the code?
yes, just to show what I did. ![]()
Is it related to a coding challenge that I'm not aware of?
no, I did this just for fun
Could you provide a description of what your code does and waht N Queens (Backtracking) means?
From here:
http://www.roard.com/docs/cookbook/cbsu6.html
"The n-queens problem consists in placing n non-attacking queens on an n-by-n chess board. A queen can attack another queen vertically, horizontally, or diagonally. E.g. placing a queen on a central square of the board blocks the row and column where it is placed, as well as the two diagonals (rising and falling) at whose intersection the queen was placed."
Hehe ![]()
Thank you for(imstuck)
because my english is not very good.
This would not have been easy for me to explain it.
soon, a sudoku solver ![]()
@ouadji wrote:
Thank you for(imstuck)
because my english is not very good.
This would not have been easy for me to explain it.
soon, a sudoku solver
Hi Ouadji,
On this forum "Thank you" is best expressed in Kudos (that star under the avatar). They can only be earned and are welcome by most. No translation required.
Ben
ok Ben, understood ![]()