maze running in c minor
Post on 19-Mar-2016
41 Views
Preview:
DESCRIPTION
TRANSCRIPT
Maze Running in C Minor
A Series of Slides in 5 PartsMovement 3. IDFS
A B C D EA SBCD E
MAX DEPTH: 1AT: AASTACK: AB
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
A B C D EA SBCD E
STACK:
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 1AT: AB
Note that since we are at depth 1, we do not push any neighbors of AB onto the stack.
A B C D EA SBCD E
MAX DEPTH: 2AT: AASTACK: AB
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
A B C D EA SBCD E
STACK: BBAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 2AT: AB
Note that we push all neighbors except for the node we just came from.
A B C D EA SBCD E
STACK: AC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 2AT: BB
A B C D EA SBCD E
STACK:
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 2AT: AC
A B C D EA SBCD E
MAX DEPTH: 3AT: AASTACK: AB
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
A B C D EA SBCD E
STACK: BBAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 3AT: AB
A B C D EA SBCD E
STACK: CBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 3AT: BB
A B C D EA SBCD E
STACK: BAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 3AT: CB
A B C D EA SBCD E
STACK: AC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 3AT: BA
A B C D EA SBCD E
STACK:
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 3AT: AC
A B C D EA SBCD E
MAX DEPTH: 4AT: AASTACK: AB
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
A B C D EA SBCD E
STACK: BBAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 4AT: AB
A B C D EA SBCD E
STACK: CBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 4AT: BB
A B C D EA SBCD E
STACK: DBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 4AT: CB
A B C D EA SBCD E
STACK: BAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 4AT: DB
A B C D EA SBCD E
STACK: CAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 4AT: BA
A B C D EA SBCD E
STACK: AC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 4AT: CA
A B C D EA SBCD E
STACK:
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 4AT: AC
A B C D EA SBCD E
MAX DEPTH: 5AT: AASTACK: AB
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
A B C D EA SBCD E
STACK: BBAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: AB
A B C D EA SBCD E
STACK: CBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: BB
A B C D EA SBCD E
STACK: DBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: CB
A B C D EA SBCD E
STACK: DEDCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: DB
A B C D EA SBCD E
STACK: DCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: DE
A B C D EA SBCD E
STACK: DABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: DC
A B C D EA SBCD E
STACK: BAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: DA
A B C D EA SBCD E
STACK: CAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: BA
A B C D EA SBCD E
STACK: DAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: CA
Note that we push DA onto the stack even though we’ve already been there. This is an implementation of IDFS where no visit information is kept.
A B C D EA SBCD E
STACK: AC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: DA
A B C D EA SBCD E
STACK:
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 5AT: AC
A B C D EA SBCD E
MAX DEPTH: 6AT: AASTACK: AB
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
A B C D EA SBCD E
STACK: BBAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: AB
A B C D EA SBCD E
STACK: CBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: BB
A B C D EA SBCD E
STACK: DBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: CB
A B C D EA SBCD E
STACK: DEDCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: DB
A B C D EA SBCD E
STACK: ECEADCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: DE
A B C D EA SBCD E
STACK: EADCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: EC
A B C D EA SBCD E
STACK: DCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: EA
A B C D EA SBCD E
STACK: CCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: DC
A B C D EA SBCD E
STACK: DABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: CC
A B C D EA SBCD E
STACK: CCBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: DA
A B C D EA SBCD E
STACK: BAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: CC
A B C D EA SBCD E
STACK: CAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: BA
A B C D EA SBCD E
STACK: DAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: CA
A B C D EA SBCD E
STACK: DBAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: DA
A B C D EA SBCD E
STACK: AC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: DB
A B C D EA SBCD E
STACK:
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: AC
A B C D EA SBCD E
MAX DEPTH: 7AT: AASTACK: AB
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
A B C D EA SBCD E
STACK: BBAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: AB
A B C D EA SBCD E
STACK: CBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: BB
A B C D EA SBCD E
STACK: DBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: CB
A B C D EA SBCD E
STACK: DEDCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: DB
A B C D EA SBCD E
STACK: ECEADCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: DE
A B C D EA SBCD E
STACK: EDEADCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: EC
A B C D EA SBCD E
STACK: EADCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: ED
A B C D EA SBCD E
STACK: DCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: EA
A B C D EA SBCD E
STACK: CCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: DC
A B C D EA SBCD E
STACK: CDBCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: CC
A B C D EA SBCD E
STACK: BCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: CD
A B C D EA SBCD E
STACK: DABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: BC
A B C D EA SBCD E
STACK: CCBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: DA
A B C D EA SBCD E
STACK: BABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: CC
This is a rather comical situation.
A B C D EA SBCD E
STACK: BAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: BA
A B C D EA SBCD E
STACK: CAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: BA
A B C D EA SBCD E
STACK: DAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: CA
A B C D EA SBCD E
STACK: DBAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: DA
A B C D EA SBCD E
STACK: EBDCCBDAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: DB
A B C D EA SBCD E
STACK: DCCBDAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: EB
A B C D EA SBCD E
STACK: CBDAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: DC
A B C D EA SBCD E
STACK: DAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: CB
A B C D EA SBCD E
STACK: AC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 7AT: DA
A B C D EA SBCD E
STACK:
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 6AT: AC
A B C D EA SBCD E
MAX DEPTH: 8AT: AASTACK: AB
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
A B C D EA SBCD E
STACK: BBAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 8AT: AB
A B C D EA SBCD E
STACK: CBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 8AT: BB
A B C D EA SBCD E
STACK: DBBAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 8AT: CB
A B C D EA SBCD E
STACK: DEDCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 8AT: DB
A B C D EA SBCD E
STACK: ECEADCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 8AT: DE
A B C D EA SBCD E
STACK: EDEADCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 8AT: EC
A B C D EA SBCD E
STACK: DDEADCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 8AT: ED
A B C D EA SBCD E
STACK: EADCDABAAC
KEY: GREEN – StartRED – Exit YELLOW – Visited on this iteration
Nodes are taken in the order: UP, LEFT, DOWN, RIGHT
MAX DEPTH: 8AT: DD
top related