Download presentation

Presentation is loading. Please wait.

Published byKarin Fletcher Modified about 1 year ago

1
p Chapter 6 introduces the stack data type. p Several example applications of stacks are given in that chapter. p This presentation shows another use called backtracking to solve the N-Queens problem. Using a Stack Data Structures and Other Objects Using Java

2
The N-Queens Problem p Suppose you have 8 chess queens... p...and a chess board

3
The N-Queens Problem Can the queens be placed on the board so that no two queens are attacking each other ?

4
The N-Queens Problem Two queens are not allowed in the same row...

5
The N-Queens Problem Two queens are not allowed in the same row, or in the same column...

6
The N-Queens Problem Two queens are not allowed in the same row, or in the same column, or along the same diagonal.

7
The N-Queens Problem The number of queens, and the size of the board can vary. N Queens N rows N columns

8
The N-Queens Problem: Observation It seems hard to generate one valid placement. But it is easy to check whether a placement is valid or not.

9
The N-Queens Problem: Brutal Force Algorithm Generate possible placements and check for their validity until find one solution or all of them. until find one solution or all of them. Naïve brutal force: choose N out of N^2 positions -- the numbers of combinations and thus the time complexity of the algorithm grow exponentially in N^2 e.g. 64 choose 8 = 4,426,165,368 Assuming each placement takes 1 ms to check, (64 choose 8)/(1000*3600*24)=51.23 days

10
The N-Queens Problem: Brutal Force Algorithm o Note that each row has one queen. o So to find on valid placement for N queens in N rows, one needs to find a valid column for each queen o An improved brutal force algorithm : consider N column positions for each of the N queens: N^N possible combinations o e.g. 8^8= 16,777,216 Assuming each placement takes 1 ms to check, (8^8)/(1000*3600) = 4.66 hours

11
The N-Queens Problem: Brutal Force Algorithm o Note that each row has one queen. o each column has one queen. o An improved brutal force algorithm : consider all possible N different column positions for the N queens in N rows: N factorial (N!) possible combinations o Assuming each placement takes 1 ms to check, o e.g. 8!= , (8!)/(1000*60) = 0.67 minutes o 10!= , (10!)/(1000*60) = minutes

12
The N-Queens Problem: Brutal Force Algorithm o In general, the brutal force algorithms for N queens deal with exponential numbers of possibilities and become intractable for some N. o Not many valid placements, compared to the numbers of possibilities n12, unique distinct

13
The N-Queens Problem We will write a program which tries to find a way to place N queens on an N x N chess board. If you can run ega or vga graphics, you can double click on this icon with the left mouse button:

14
How the program works The program uses a stack to keep track of where each queen is placed.

15
How the program works Each time the program decides to place a queen on the board, the position of the new queen is stored in a record which is placed in the stack. ROW 1, COL 1

16
How the program works We also have an integer variable to keep track of how many rows have been filled so far. ROW 1, COL 1 1 filled

17
How the program works Each time we try to place a new queen in the next row, we start by placing the queen in the first column... ROW 1, COL 1 1 filled ROW 2, COL 1

18
How the program works...if there is a conflict with another queen, then we shift the new queen to the next column. ROW 1, COL 1 1 filled ROW 2, COL 2

19
How the program works If another conflict occurs, the queen is shifted rightward again. ROW 1, COL 1 1 filled ROW 2, COL 3

20
How the program works When there are no conflicts, we stop and add one to the value of filled. ROW 1, COL 1 2 filled ROW 2, COL 3

21
How the program works Let's look at the third row. The first position we try has a conflict... ROW 1, COL 1 2 filled ROW 2, COL 3 ROW 3, COL 1

22
How the program works...so we shift to column 2. But another conflict arises... ROW 1, COL 1 2 filled ROW 2, COL 3 ROW 3, COL 2

23
How the program works...and we shift to the third column. Yet another conflict arises... ROW 1, COL 1 2 filled ROW 2, COL 3 ROW 3, COL 3

24
How the program works...and we shift to column 4. There's still a conflict in column 4, so we try to shift rightward again... ROW 1, COL 1 2 filled ROW 2, COL 3 ROW 3, COL 4

25
How the program works...but there's nowhere else to go. ROW 1, COL 1 2 filled ROW 2, COL 3 ROW 3, COL 4

26
How the program works When we run out of room in a row: p pop the stack, reduce filled by 1 p and continue working on the previous row. ROW 1, COL 1 1 filled ROW 2, COL 3

27
How the program works Now we continue working on row 2, shifting the queen to the right. ROW 1, COL 1 1 filled ROW 2, COL 4

28
How the program works This position has no conflicts, so we can increase filled by 1, and move to row 3. ROW 1, COL 1 2 filled ROW 2, COL 4

29
How the program works In row 3, we start again at the first column. ROW 1, COL 1 2 filled ROW 2, COL 4 ROW 3, COL 1

30
Pseudocode for N-Queens ŒInitialize a stack where we can keep track of our decisions. Place the first queen, pushing its position onto the stack and setting filled to 0. Žrepeat these steps p if there are no conflicts with the queens... p else if there is a conflict and there is room to shift the current queen rightward... p else if there is a conflict and there is no room to shift the current queen rightward...

31
Pseudocode for N-Queens Žrepeat these steps p if there are no conflicts with the queens... Increase filled by 1. If filled is now N, then the algorithm is done. Otherwise, move to the next row and place a queen in the first column.

32
Pseudocode for N-Queens Žrepeat these steps p if there are no conflicts with the queens... p else if there is a conflict and there is room to shift the current queen rightward... Move the current queen rightward, adjusting the record on top of the stack to indicate the new position.

33
Pseudocode for N-Queens Žrepeat these steps p if there are no conflicts with the queens... p else if there is a conflict and there is room to shift the current queen rightward... p else if there is a conflict and there is no room to shift the current queen rightward... Backtrack! Keep popping the stack, and reducing filled by 1, until you reach a row where the queen can be shifted rightward. Shift this queen right.

34
Pseudocode for N-Queens Žrepeat these steps p if there are no conflicts with the queens... p else if there is a conflict and there is room to shift the current queen rightward... p else if there is a conflict and there is no room to shift the current queen rightward... Backtrack! Keep popping the stack, and reducing filled by 1, until you reach a row where the queen can be shifted rightward. Shift this queen right.

35
Watching the program work You can double click the left mouse button here to run the demonstration program a second time:

36
p Stacks have many applications. p The application which we have shown is called backtracking. p The key to backtracking: Each choice is recorded in a stack. p When you run out of choices for the current decision, you pop the stack, and continue trying different choices for the previous decision. Summary

37
T HE E ND Presentation copyright 2012, Pearson Education, For use with Data Structures and Other Objects Using Java by Michael Main. Some artwork in the presentation is used with permission from Presentation Task Force (copyright New Vision Technologies Inc) and Corel Gallery Clipart Catalog (copyright Corel Corporation, 3G Graphics Inc, Archive Arts, Cartesia Software, Image Club Graphics Inc, One Mile Up Inc, TechPool Studios, Totem Graphics Inc). Students and instructors who use Data Structures and Other Objects Using Java are welcome to use this presentation however they see fit, so long as this copyright notice remains intact.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google