ããã¯ãã©ããã³ã°ã¢ã«ãŽãªãºã Intermediate
Nã¯ã€ãŒã³åé¡
Nåã®ãã§ã¹ã®ã¯ã€ãŒã³ãNÃNã®ãã§ã¹ç€ã«ãã©ã®ã¯ã€ãŒã³ãä»ã®ã¯ã€ãŒã³ãè ãããªãããã«é 眮ããŸããå€å žçãªããã¯ãã©ããã³ã°ã¢ã«ãŽãªãºã ã§ãã
#backtracking#constraint-satisfaction#recursion#chess
Complexity Analysis
Time (Average)
O(N!)Expected case performance
Space
O(N)Memory requirements
Time (Best)
O(N!)Best case performance
Time (Worst)
O(N!)Worst case performance
How it works
- ⢠Place N queens on NÃN chessboard
- ⢠No two queens can attack each other
- ⢠Uses backtracking algorithm
- ⢠O(N!) time complexity
- ⢠Classic constraint satisfaction problem
Step: 1 / 0
500ms
SlowFast
Keyboard Shortcuts
Space Play/Pauseâ â StepR Reset1-4 Speed
Real-time Statistics
Algorithm Performance Metrics
Progress0%
Comparisons
0
Swaps
0
Array Accesses
0
Steps
1/ 0
Algorithm Visualization
Step 1 of 0
Initialize array to begin
Default
Comparing
Swapped
Sorted
Code Execution
Currently executing
Previously executed
Implementation