Presentation is loading. Please wait.

Presentation is loading. Please wait.

DATA STRUCTURE AND ALGORITHM PROJECT Fall2011 Group Members: Asma Rafi BS-3 Fatima Saleem BS-3.

Similar presentations


Presentation on theme: "DATA STRUCTURE AND ALGORITHM PROJECT Fall2011 Group Members: Asma Rafi BS-3 Fatima Saleem BS-3."— Presentation transcript:

1 DATA STRUCTURE AND ALGORITHM PROJECT Fall2011 Group Members: Asma Rafi BS-3 Fatima Saleem BS-3

2  The object of the game is for the player to find their way to the end of the maze.  The program is based on the 2-D array and the graphics(mainly drawLine), represented using Applet.

3 o The goal of our project is to learn the implementation of a Data structure (2-D array). o To learn the inco-opertion of graphics and applets with the code.

4  BUILT-IN CLASSES USED: java.applet.Applet; java.awt.Graphics; java.awt.event.KeyListener; java.swing.* 2-D array for creation of Maze. drawLine() method for walls. fillOval() method for player.

5 CREATION OF MAZE: I. Create a Boolean 2-D array for horizontal and vertical walls of the maze I. Set True for open walls and False for closed walls I. Draw lines using loop where walls are closed. II. Draw a player. 012 345 678 FALSE TRUE FALSE TRUE

6 I. Use keyListener to move the player(Up, Down Left and Right). II. Detect Collision of player with the walls and block using correct positions. RIGHT ARROW KEY: While pressing the right arrow key, if player’s horizontal position is greater than the coordinates of the closed wall, then assign players position to that particular value. LEFT ARROW KEY: While pressing the left arrow key, if player’s horizontal position is less than the coordinates of the closed wall, then assign players position to that particular value.

7 UP ARROW KEY: While pressing the up arrow key, if player’s vertical position is less than the coordinates of the closed wall, then assign players position to that particular value. DOWN ARROW KEY: While pressing the down arrow key, if player’s vertical position is greater than the coordinates of the closed wall, then assign players position to that particular value.

8  The ball starts from the top left corner of the maze.  It moves along the open walls, using the arrow keys, the closed walls block the ball from going through.  Finally reaches the end of the Maze and thus the maze is solved.

9 At player X position(SQ)=26 At player Y position(SL) = 26

10 At player X position(SQ)=186 At player Y position(SL) = 26

11 At player X position(SQ)= 178 At player Y position(SL) = 230

12

13  From this project we learned: I. Key event handling. II. Implementation of 2-D array. III. Collision Detection. IV. Tried different algorithm techniques for creation of the maze(DFS, Tiles, fillRect()). V. Use of Graphics and Applet.

14  http://www.zahniser.net/~russell/computer/in dex.php?title=Maze:%20Third%20Person http://www.zahniser.net/~russell/computer/in dex.php?title=Maze:%20Third%20Person  http://www.mazeworks.com/mazegen/mazet ut/index.htm http://www.mazeworks.com/mazegen/mazet ut/index.htm


Download ppt "DATA STRUCTURE AND ALGORITHM PROJECT Fall2011 Group Members: Asma Rafi BS-3 Fatima Saleem BS-3."

Similar presentations


Ads by Google