1 / 4

MINIPROJECT : Preliminary Design Report

MINIPROJECT : Preliminary Design Report. MAZE PATH GENERATOR Priyanka Jindal 2003cs10180 Snigdha Goyal 2003cs500019 Group 4 Specifications: Inputs: 8 * 8 Matrix Can be loaded Dynamically or can load the stored maze

komala
Download Presentation

MINIPROJECT : Preliminary Design Report

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MINIPROJECT : Preliminary Design Report MAZE PATH GENERATOR Priyanka Jindal 2003cs10180 Snigdha Goyal 2003cs500019 Group 4 Specifications: Inputs: 8 * 8 Matrix Can be loaded Dynamically or can load the stored maze Having loaded the maze Enabling the start signal displays the first possible path that exists between node (0,0) and (7,7)(Depth First search Algorithm)

  2. RTL Description Rom Maze (M): Stores the Maze Rom Stack (S): Keeps the unexplored potential nodes Rom Path (P) : Stores the generated path R1: I R2 : J (i,j) is the co-ordinate of the matrix R3: Keeps the top address of the Stack N: (R3 = 0 :empty stack ,Initialized with (0,0):(R1,R2)) A: If R3 = 0 then exit (No Path) else read : R1= R3.i R2 = R.j if R1 = 7 and R2 = 7 then Exit (Path found) else read and write : N = (R1+1,R2) if M(N) = 1 then write to stack S :(R1+1,R2) write to Path P : (R1,R2) read and write : N= (R1,R2+1) if M(N) = 1 then write to stack S : (R1,R2+1) write to Path P : (R1,R2) (Overwrites the previous one if both satisfies) Go to A

  3. Different Modules • Input Maze : Inputs : Select (2) :Three possible Stored Mazes and One is for loading dynamically Enable : Sets the signal high for loading the maze. Begin : Set it high Once the maze has been loaded Displays the Result FSM for Input Maze : START : Enable and Select (11) is the enable for this FSM MODE OF INPUT : NEED TO GIVE ALL NODES THAT ARE 1 ( *(i)*(j) )* # Path Finder : DATA PART FOR FINDING PATH FSM for Path Finder : Begin : start for this FSM

  4. Few Clarifications Format for storing Maze : Given (i,j) Stores 1 at adrress (8i + j) (Size of Rom : 2 power 6 * 1 Format for storage in Stack (i,j): Rom Size (2 power 6 )* 6) : first three bits refer to i and last three to j. Format for storing path : Rom Size : ((2 power 3)* 8) :direct mapping of (i,j) to 1.

More Related