|Programming Languages||C, C++, Python(2.x, 3.x), Java, C#, ARMv6 and ARMv7 Assembly languages, SQL, R|
|Operating Systems||Linux (Ranging from Ubuntu to Arch)|
|Extras||Proficient in LaTeX. Proficient in Blender 3D. Proficient in HTML and CSS. Proficient with Git version control software.|
A few of my high school friends and I had finished all of the math courses available at the high school-level, so we were advised to take courses at the university, or get dual-enrollment credit. Since we were still in high school, we were unable to spend very much time on campus and working with peers, but it was still a fun experience being on campus.
In teams of three, we were challenged with six problems, each with different difficulties. We then tried to solve them in 3 hours. The problems tested our ability to write code that could handle unusual inputs. A problem might be along the lines of finding the longest palindrome in a paragraph. Included in the paragraph might be a snowman character, or an emoticon. Our code needed to handle such cases appropriately.
The competition was to write an AI to play the game of snake. We worked in teams to write the AI in six hours. We deployed the AI to the heroku cloud application platform.
Our team used a depth-first traversal of the graph to determine the next best move. It would traverse the graph, determine which move would warrant the highest point yield, and make that move. If the next move contained a snake, it would return a negative weight and not choose that move.
The competition is still to write an AI to play the game of snake. This year, I only worked with one other person. We still deployed the snake AI to the heroku cloud platform.
This time, the code was a lot weirder, and this came through in the final competition. Essentially, we sorted the pieces of food in order of Manhattan distance from our head. Or so we thought. Turns out, the snake had other ideas. It would pick a piece, and it would keep going after that piece. We didn't seen any real order in its method, but I'm sure there is something. The first round, it actually did quite well and people were expecting it to win. Then it made a turn and got stuck. It would look at the next best move to take to get to the food. It would also look at coins. If its head was closer (again Manhattan distance) to the coin than any of the heads of other snakes, it would go after the coin.
NOTE: This is perhaps the worst code and repository structure I've done in a long time. Given more time, there are many things that would be done differently.