Battlecode
This code was a submission for the 2017 MIT Battlecode AI competition. The basic premise of the competition was to create the best AI program for the strategy game Battlecode. The game is centered around a resource of bullets that serves as both your ammo and currency to buy units. Our strategy revolved around creating gardeners, units that create trees to harvest bullets, and scouts, as the name suggests a quick moving unit with weak firepower. We wanted to have strong defense while maintaining information on the enemy's movements. Our AI. written in Java, would create gardeners in the beginning of the game which would look for an open space to create a enclosure of trees which would serve as a barrier against potential enemies. Afterwards, we would send scouts, fast moving units with low combat effectiveness, across the map to look for the locations of enemies marking the locations of enemy units storing them in an array and also a string that identifies the type of unit. We then interpreted this information through a series of if statements to determine the importance of these units and created soldiers, units focused on combat, to intercept the units at the locations stored in the array. I take pride in this code not only because it was a fun and exciting challenge, but also due to it being the first implementation of Artificial Intelligence that I have done outside of class.
