A tool that allows the user to define a partial level, then generates a set of finished levels that fit the defined constraints.

Given a goal state of items that need to be obtained, executes a reverse search from goal state using a set of crafting actions. With a set of 17 different craftable items and 25 different actions, algorithm is able to calculate the shortest series of actions to reach any goal state in less than 1/100 of a second.

A bot that utilizes Monte Carlo Tree Search to select actions in a box making game.

Standard Behavior Tree architecture implemented to make a bot that plays Space Wars.

Runs bidirectional A* to find the shortest path to a target.