Write a program that implements the previous maze using references to instances of a Node class. Each node in the graph will correspond to an instance of Node.

Everything you need to know is provided in the PDF . However, would also provide a skeleton for the maze exercise. Exercise

2) 41 rebels are trapped in a cave, surrounded by enemy troops. They decide to commit suicide: they line up in a circle and systematically kill every other one, going around and around, until only one rebel is left — who supposedly kills himself. Who is the lone survivor? Exercise

3) Write a program that implements the previous maze using references to instances of a Node class. Each node in the graph will correspond to an instance of Node. The edges correspond to links that connect one node to another and can be represented in Node as instance variables that reference another Node class.

Last Completed Projects