This was my Scratch project for Computer Science Principles. Inspired by Ready Player One, I hid multiple layers of easter eggs throughout the maze to create a more interesting experience. Unlike Galaxy Escape, I switched between 100 backdrops to get a bigger world, using color-based collision detection for the physics engine. I replaced the music with piano songs that I made.

This is my culminating end of the year Computer Science A Greenfoot project. Inspired by the unique gravity from Super Mario Galaxy, I created a 2D physics engine where the player would be pulled towards the closest platform. I was able to get the scrolling world to work by thinking of each instantiation as a game object with a position in the world and by using a camera to render the screen. I enjoyed making piano songs for this game.

Initially, there doesn't seem to be anything special about this maze. In fact, it looks like a bunch of rooms connected to each other by a set of ten breakable windows on each side. However, this is not the case: entering through any of the windows leads to a totally different room. Try it, how do you think I was able to implement this feature? We will learn about this data structure later in the year.

Tired of being in the house too much? Suffering from Zoom fatigue? Well, here you have it: the Nature Flight Simulator! Walk and fly through an infinite forest of trees, wind gently rocking them back and forth. Take in the calm and relaxing environment for a few minutes and enjoy the moment while it lasts. This was an exploration into procedural terrain generation, as well as tree modeling. The piano song was also fun to create for this.

Now, here is something less visual, but all the more useful. Due to COVID-19 and the effects it has had on students, Student Council recently formed a tutoring program for students. The problem, though, was that manually matching the students took hours to complete, even if it wasn't perfect. Here, I have written a program that would take it the tutors' and students' information and output the possible pairings along with class subject and time, but what made this program more useful was that it gave a possible maximal matching between them. I used an algorithm from graph theory to do this, which we will cover later on this year.