Great Big House in New Orleans and the Josephus problem
Six years ago, when I was a freshman in college, I wrote a series of three posts on this blog about a game that I used to play in elementary school music class called "Great Big House in New Orleans". In those posts, I attempted to write a program in Java and Python that would calculate the winning position of the game given the number of players. "Great Big House in New Orleans" (published Monday, November 06, 2017) "Great Big House in New Orleans: Improved Code" (published Thursday, November 09, 2017) "Great Big House in New Orleans: The Special Case" (published Friday, February 02, 2018) At the time, I had less than a year of experience in computer programming and had only recently decided that I would study computer science. Because of my naivete, the posts have many problems, and they are a little embarrassing to look back on. The posts ramble excessively about basic programming principles and assume without proof that a pattern will hold...