Lab11

Objective: Check Out git and github, ignore everything else after this

The objective of this Lab is to examine array based stacks and queues built using C++. We are going to create a stack and a queue to be used in the Towers of Hanoi game.

Read the introduction to the game at https://en.wikipedia.org/wiki/Tower_of_Hanoi.

Tasks

Task 0: Get Starter code to comiple and link

Make the additions required to get the starter project to compile.

Task 1: Create a stack that will be used as the basis for the remainder of the lab.

Design a stack using an array, using methods defined in the inteface.

Task 2: Create a queue to track steps.

Create a queue. Design the queue class using an array to store data. Include the standard functions for a queue specified in the header file.

Task 3: Create a single person version of the “Towers of Hanoi” game with Four disks, three towers.

Modify the code from Tasks 1 and 2 to store any moves made in the queue class. When the game is won, the queue should be used to print out all the moves made in order. Store the values as strings in this format - ,,

1. There will be four disks, and three poles. Represent the disk by a number, 1 for smallest disk, and so on ….
2. It is expected that the students will create their own class to represent the Towers of Hanoi game. Hint use the stack to represent the towers and keep track of moves in the Queue. (you can even use that queue to generate a tests, by outputting it to a file)
3. Using the queue output at the end of the execution to a file (say temp.txt) all the moves. This can be then used to test your program as well (see note below about indirection).
4. Create a main program that uses stacks to allows the user to interactively play the game.

• It needs to provide a way for the user to indicate the tower to move from and to.
• It needs to prevent illegal moves as defined in the Wikipedia rules.
• It needs to provide the user with a way to see their progress on the screen.

Note : it is easier to output this horizontally.
<start>
Tower 1: 4 3 2 1
Tower 2:
Tower 3:

<some moves>
Tower 1: 4 3 
Tower 2: 1
Tower 3: 2

5. Test your program to ensure it is working correctly. This should test both expected success conditions and expected error conditions.
6. You program should be able to read input from std in, by using indirection. For example:

 	ucstudent@ucstudent-VirtualBox:~/tt/Lab02$ build/runMain < moves.txt 

(as discussed in class)

7. Include in the lab report a screen shot(s) of the output of your tests.
8. Participation Rubric

Participation rubric of teammates. List out for your all team members how much they participated.

	             Member1	Member2	Member3
Member1 (opinion)	33	     33	     33
Member2 (opinion)	33	     33	     33
Member3 (opinion)	33	     33	     33

Example

	             Member1	Member2	Member3
Member1 (opinion)	33	     33	     33
Member2 (opinion)	20	     40	     40
Member3 (opinion)	20	     40	     40

Lab Submission:

• lab report pdf of screenshots of the Hanoi game running, show errors being handled and game being done to completion (don’t need to see exhaustive moves, just good sample)
• main.cpp
• StackQueues.cpp
• StackQueues.h
• moves.txt (this should be the a solution of the game from start to end)

Lab Grading:

1. 25% - Task 1 has been correctly implemented and meets all requirements (Unit Test Passes).
2. 25% - Task 2 has been correctly implemented and meets all requirements (Unit Test Passes).
3. 25% - Task 3 has been correctly implemented and meets all requirements.
4. 25% - Code style, Participation Rubric, and Information requested in PDF If program fails to compile, 0% will be given for that Task.