By Which algorithm, the 8 queens problem is solved?
- 1 Answers
- 1003 Views
- I also Faced
- E-Mail Answers
Answer / Sanjeev Kaur
The N-Queens problem can be solved using backtracking algorithms. For the specific case of placing 8 queens on a chessboard without attacking each other, various backtracking solutions exist such as recursive backtracking, iterative deepening depth-first search (IDDFS), and breadth-first search (BFS).
| Is This Answer Correct ? | 0 Yes | 0 No |
What are linked lists most commonly used for?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
What do you mean by collision in hashing?
What is pivot in quicksort?
Why is data structure important?
What is the maximum size of array?
What is worst case complexity algorithm?
When would you use a tuple?
What is data structure and why it is important?
Can you store different types in an array?
Can binary tree have 1 child?
What is the difference between sorting and classifying?
Windows 
