8 Queens Problem (For people who want a try, not homework$)

  • Context: MHB 
  • Thread starter Thread starter IHateFactorial
  • Start date Start date
  • Tags Tags
    Homework
Click For Summary
SUMMARY

The 8 Queens Problem involves placing 8 queens on an 8x8 chessboard so that no two queens threaten each other. The solution requires an understanding of combinatorial algorithms and backtracking techniques. The discussion references a relevant resource from Math Help Boards, which provides insights into solving this problem. Participants are encouraged to explore various algorithmic approaches to find all possible configurations.

PREREQUISITES
  • Combinatorial algorithms
  • Backtracking techniques
  • Basic chess rules regarding queen movements
  • Mathematical problem-solving skills
NEXT STEPS
  • Research backtracking algorithms for combinatorial problems
  • Explore the use of recursion in solving the 8 Queens Problem
  • Learn about optimization techniques for algorithm efficiency
  • Investigate variations of the N Queens Problem
USEFUL FOR

Computer science students, algorithm enthusiasts, and anyone interested in solving combinatorial optimization problems.

IHateFactorial
Messages
15
Reaction score
0
Imagine an 8x8 chess board. In how many ways can 8 queens be placed on the board such that no queen can "eat" any other queen.
 
Physics news on Phys.org
You might find http://mathhelpboards.com/potw-university-students-34/problem-week-167-june-9-2015-a-15548.html?highlight=queen relevant.
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 20 ·
Replies
20
Views
7K
Replies
7
Views
2K
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
4
Views
5K
  • · Replies 12 ·
Replies
12
Views
3K
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K