Algorithm Vision
λ°±νŠΈλž˜ν‚Ή μ•Œκ³ λ¦¬μ¦˜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

Back to λ°±νŠΈλž˜ν‚Ή μ•Œκ³ λ¦¬μ¦˜
N-Queens Problem - Algorithm Vision