Using simulation in R to solve this directionally-discombobulating puzzle.

How I used graph theory in R to solve a mathematical corn maze.

I used simulations in R to solve this Riddler about how long it takes for confuded ducks to find each other in a pond.

I used simulation with to approximate the solution an older Riddler. I used an gradient descent-like method to gradually narrow in on a precise estimate.

I used graphs to solve this weeks Riddler to find the difference in shortest paths resulting from a change to the sidewalk layout of Riddler City.

This puzzle was to find the shortest paths of two indivduals sharing a sidewalk while obsering the COVID-19 6-foot social distancing guideline. I simulated the scenario in R and plotted the travels of the individuals using 'gganimate'.

For this week's Riddler, we were asked to solve the 3D structure given a series of cross-sections. I used R to reconstruct this structure and presented it as an interactive plot.

This week’s Riddler involves finding the path used by the knight to kill the opposing queen in a game of chess. I show how I solved puzzle using two methods: a siumulation of the chessboard and by building a graph of the possible paths for the knight.

A brief look at the systems for caching in R.

A simple system for saving and loading objects in R. Long running computations can be stashed after the first run and then reloaded the next time. Dependencies can be added to ensure that a computation is re-run if any of its dependencies or inputs have changed.

©2020

Powered by the Academic theme for Hugo.