The Wikipedia Game involves trying to go from one Wikipedia Article to another in the fewest clicks. This bot uses a Breadth First Search in order to search each article's links, in real time, until it finds the goal article. There are almost 6 million articles on the English Wikipeda. BFS was chosen as it will find the shortest path in an unweighted graph. This also allowed me to take advantage of the speed of asynchronous requests. Although this does lead to high memory usage. The bot can parse around 100 thousand articles every few minutes. I had toyed with using A* search as its considerably more efficient. In order to implement this, a heuristic needs to be developed that can estimate the 'distance' between two knowledge domains.