Tardy – My First Original Game!

-
The Game

Inspired by a game that our teacher showed us in class, Tardy places you in a scenario where you’re running late for class, and your teacher has found out. After chilling in the cafeteria, you realize that you’re late for class. At that instant, the principal appears and sees you. Next, you must then run around the cafeteria, trying to avoid getting caught by the principal. He eventually gets tired and calls for help. Stay alive as long as you can!

Mechanics

Tardy starts with you alone in the cafeteria, with only tables blocking your way. However, as time passes, other students trickle into the room with you. Eventually, a principal catches wind of your tardiness and try to run around catching you. The first principal, who uses the A* search algorithm to find you, avoids tables. However, another principal who comes in later uses the Greedy search algorithm and can hop over tables to get to you.

To create this project, I combined a variety of skills that we have learned this year. At the most basic level are the graphics, I used the StdDraw library as I have in the past. Creating a GUI for a grid is very simple - drawing row and column lines on a blank canvas. Then, I painted the sprites (graphics) within that grid. Finally, I erased and repainted the grid and sprites every time the screen refreshed.

I kept track of a list of CellOccupants (people) in the grid (the cafeteria) by using a simple ArrayList. Then, the program runs through this list and call the move() method for each time the screen refreshes. For the monsters (people that move based on the player’s location, a.k.a. principals), I simply used the A* and Greedy search algorithms I created in our previous project. Finally, I added other students who move randomly in the cafeteria (actually, they also use the A* algorithm to move to random points in the cafeteria).


Comments

Post a Comment

Popular updates

Braitenberg Vehicles – v1.0

-
Image
For our Braitenberg Vehicles project, we were to create Braitenberg's first four cars. The basic idea behind these vehicles is that each vehicle has a set of sensors and motors. The sensors cause the motors to move: either speed up or slow down. By connecting different sensors to different motors, you can cause the cars to have different movements. Math: Math!! Although I usually start with the visual side of these projects, this time I wanted to first figure out how the vehicles would move on-screen. Getting Around The first car, Getting Around , was pretty simple. The light intensity, taken from the sensor, directly correlates to the y-position of the car. At this point, I threw together some basic graphics using the handy-dandy StdDraw library and a few JPEGs. You can see the final Getting Around  car to the right. Implementing two motors and sensors, however, was much more challenging. At first, I was trying to calculate the distance each motor would travel
Read more

Machine Learning & Half Moon Project

-
Image
This was our first Machine Learning assignment. Machine Learning is something that I was (and still am) super excited about. Basically, the algorithm 'learns' something, and can then apply it in other situations. Learning & Neurons This was the toughest concept to learn (ha). We started with a Neuron, similar to the neurons in our brains. The neuron can trigger (yes/no) based on a series of inputs, in our case two inputs. The equation for whether or not the neuron triggers is SUMMATION(Weight(n) * Input(n)) > threshold . Each input is weighted differently, and the weights are what we can change to 'train' the neuron. We use this equation:  ΔWeight = learningSpeed * (target - output) * input . For example, if we start with a speed of 0.2, an input of 1, a weight of 0.5, and a target of 0, the weight would change by -0.2 (0.2 * (1 - 0) * 1). Now, with a weight of 0.3, repeat the process. Once each input returns the desired output, the best weights have been fo
Read more

Guessing Game – v1.0

-
Image
This assignment was pretty exciting for me. We were asked to create a 20 Questions-like game, where the program could guess what object you were thinking of, using a binary tree . Binary Trees My teacher introduced me to a new concept called a binary tree. A binary tree consists of nodes, and each node contains a left and right child. For example, to the right, node A has node B as its left child and node C as its right child. This data structure is infinitely expandable and can hold a wide variety of data types. Saving & Reading Data This was definitely the toughest part of the project - saving the data in a plain text file. Using recursion, I was able to output the binary nodes relatively easily, using Preorder. This means that the nodes are printed out in this order: parent, left, right. For example, if you had "A" as the parent node, and  "B" and "C" as its left and right nodes respectively, the output would be ABC. I used this method t
Read more