Making a MIPS program, which can solve the n-Queens problem? The user will input the number of queens, n > 3, to set on the n x n chess board and the program will determine how to place them in such a way that they are not able to capture one another.