Figure 6 Classical Logical flow of Min- Conflict Algorithm
Related Figures (7)
The Classically N-Queen problem is a placement of predefined number of Queens over nxn chessboard in such way no queen can come into attacking range of other. In other words, two or more Queens cannot share the same row, column or both diagonal. Figure 1 is illustrating the state space of nrahlam Figure 1: Queen Attacking Search Space. Figure 3: Logical Flow of Backtracking Re- cursive Search Figure 4: Backtracking Logic Flow Although the list of placements is an array of strings but backtracking method traverse as tree in recursive order along with pruning test. The BTS algorithm used here is improved with “looking ahead” capability. Figure 5: Min-Conflict Logic Flow Table 1 Backtracking experimental Results Table 3 Outcome of 20x20 chessboard using Min-Conflict
