Simple maze game, Computer Engineering

The following is a requirements specification for a simple game based on a player moving through a maze of connected rooms from an entrance door to an exit door.

The required system has to allow a designer to construct a maze of connected rooms and a player to move through these rooms. A player is only displayed information about the room that they are in. This is basically a trial and error game that involves memory of the layout of the rooms in order to get out of the maze by going through as few rooms as possible. 

Each room has four doors. Corridors connect two doors from the same or different rooms and can be traversed either way (but the player cannot reverse direction in the middle of the corridor). One of the rooms has a door connected to an entrance. Similarly, one of the rooms has a door connected to an exit. The entrance and exit are special, one-way corridors with only one door.  The player moves from the entrance into the first room. For each room, the player chooses a door to go through and travels directly through the door at the opposite end of the corridor to the next room. This continues until the player chooses a door that is the exit. The count of rooms entered by the player is displayed.

A door can have a colour and a pattern. This combination is randomly generated and may not be unique. A room can also have a colour and a pattern for its walls.

Each door has a question associated with it. If the player chooses to go through a door they can answer the question. If they get the question correct they can choose a new colour and pattern for that door.

1216_Simple Maze Game.png

Posted Date: 2/25/2013 5:46:53 AM | Location : United States







Related Discussions:- Simple maze game, Assignment Help, Ask Question on Simple maze game, Get Answer, Expert's Help, Simple maze game Discussions

Write discussion on Simple maze game
Your posts are moderated
Related Questions
Eliminating hazards of pipeline -  computer architecture: We can delegate the work of eliminating data dependencies to the compiler, which can fill up in suitable number of NO

Sixth Generation (1990 - ) This  generation  begun  with  many  gains  in  parallel  computing,  both  in  hardware area and in improved understanding of how to build up algori

The code where all successive numbers differ from their preceding number by single bit is ? Ans. Gray Code, where all successive numbers are different from their preceding nu

Give the solutions for critical section problem? A solution to the critical section problem must specify the subsequent requirements. (a) Mutual exclusion (b) Progress (c)

The Chocolate Delights Candy Company requires to add the following functionality to its cash register: When a customer is checking out, the cash register requires keeping the ne

Bitwise-Inclusive-OR Operator: inclusive-OR-expression : exclusive-OR-expression inclusive-OR-expression | exclusive-OR-expression The  bitwise-inclusive-OR  operator

Perform the - 48 - 23 operations using the 2's complement method. Ans. - 48 - 23 = - 48 + (-23)     -48     =  1 1 0 1 0 0 0 0     -23     =  1 1 1 0 1 0 0 1       = -71


Mating: Therefore once our GA agent has chosen the individuals lucky sufficient as actually there  fit enough to produce offspring then we next determine how they are going to

What are various types of Shift Registers ? Ans: Kinds of Shift Registers: (i) SISO that is Serial-In Serial-Out Shift Register (ii) SIPO that is Serial-In P