The user inputs a string which is then parsed for operators and values, which are constructed into a tree. Once the tree is built, the function is plotted for values of x and stored in a vector. SFML is used to render the graph to the screen.
Generates an n-order cyclic graph where each node is given a random number. Each node can only communicate with its left and right neighbor. The goal is for each node to agree on the global average of all of their values in the center.
All agents are running on their own thread. This was not required but used as a learning experienced.
Similar concept as the C++ project but with various graphs using the NetworkX library, and better consensus visualizations. Introduced bad-actors that continuously lie about their current value to nearby agents. Used the IABC consensus algorithm to achieve approximate consensus.
Two player chess made in C++. The code is fairly poor compared to my more recent projects but it was a really valuable experience and I learned a lot from it. There is a lot of nesting, functions that do more than one thing, and poor OOP practices such as the rare use of encapsulation.