Construct a C program that represents a maze using abstract data types and data structures

timer Asked: May 29th, 2017

Question Description

There are 8 .c program files. 2 of them (assig_three117 and node) are fully completed already, the other 6 are "half" completed and you will have to fill in the missing sections... I'm pretty confident I've fully completed 4 of the 6 "to do" files myself (t_node, stack, square_state and queue) to the best of my knowledge but I'm not certain. The other 2 (game_state and game_tree) I've attempted bits and pieces but can't figure out most of it. Every function that has //COMPLETE ME within it is the only section you can edit, others you cant/or have already been completed. Where I've put "Done" next to COMPLETE ME I'm 90% confident I've fully completed that section, and where I've put "Done I think", well yeah I've tried something that I think makes sense. Youll see whats going on after a little bit of time looking at it. Every section is commented on what it should do, so that helps.

assig_three117.c is the harness file and this runs the whole program.


The assignment is to construct a program that given some representation of a maze will find the path through to the end without you lifting a pencil or getting mud on your shoes!

The challenge is to find a path from the square marked Start to the square marked Stop! by moving forwards, turning left, and turning right (with all directions relative to the current direction of travel) without going through “walls” which are indicated as black squares. The application of this game to computing is the design of a program that allows a starting square to be given and then for the user to be graphically shown a solution derived by the computer. The computer will select moves by creating a game tree. A game tree consists of all the possible states of the game and in this assignment the computer determines any possible solution as the best one. Each node of the game tree has children that indicate the states of the game that follow from the state of the parent for each possible move, i.e. each node in the tree possesses three branches which represent the maximum possible moves from the parent node. This assignment uses many data structures (trees, linked-lists, stacks, and queues) to solve the puzzle. The game will be text only.

Task: The project contains many header (.h) and source (.c) files. All required files are present. Your task is to complete the functions within the program files which have been declared but for which the function bodies are missing and to update the header comments for the source files that you change.

This question has not been answered.

Create a free account to get help with this and any other question!

Similar Questions
Related Tags

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors