The 5 Queens Problem originates from the 8 Queens Problem that asks the question of how 8 queens can be placed on an 8x8 chess board without any of them being able to attack each other. This derivation uses 5 queens on a 5x5 chessboard. In Chess, a queen can attack other pieces if they are in the same row, column, or diagonal as the queen. (Learn more about the n-non attacking queens problem [url=https://medium.com/@miodragpetkovic_24196/problem-of-n-non-attacking-queens-i-98ea37f282a0]here[/url]).[br][br]Your goal is to find as many solutions to the 5 queens problem on the board below. Drag and drop the queens to a square on the 5x5 board. As you are solving, think about what algorithms you are using to help solve the problem.[br][br]You can use the "Show Attacks" checkbox to show the ways queens can attack each other. Check Solution to see if your answer is a solution and see what solutions you have found so far. [br][br]For a 5x5 board with 5 queens, there are 10 possible solutions. Can you find them all? [br][br]