Interactive Breadth First Search in a Grid
20 December 2020
Breadth first search(BFS) is a very powerful and useful algorithm for
exploring graph like structures. A BFS searches it’s nearest neighbors first
before moving on. It’s main use is to find a path using
the fewest hops. Here we use it to explore a grid that can be modified
by a user. In this grid, we have verticies (the grid boxes), and edges
(the box north, south, east and west).
Lights Out Game
29 July 2020
Shown below is a lights out kind of game. Scores are not tracked or anything
it’s just something meant for fun. The goal is to get the board either completely
lit up or completely black. It inverts the color of whatever you click on and those directly adjacent squares. Those squares directly to the north, south, east and west.
Sine-Cosine Demo App
06 September 2016
I had to create a sine-cosine demonstrator for a class, this is that demo.