1 citations · 2 across the 6 of their papers we have counts for
6 papers
Complexity of 2D Snake Cube Puzzles
MIT Hardness Group, Nithid Anchaleenukoon, Alex Dang +3
Given a chain of cubes where each cube is marked "turn " or "go straight", when can it fold into a rectangular box? We prove several variants o…
Confirming the Labels of Coins in One Weighing
Isha Agarwal, Paul Braverman, Patrick Chen +10
There are bags with coins that look the same. Each bag has an infinite number of coins and all coins in the same bag weigh the same amount. Coins in different bags weigh 1, 2,…
From Unequal Chance to a Coin Game Dance: Variants of Penney's Game
Isha Agarwal, Matvey Borodin, Aidan Duncan +7
We introduce and analyze several variations of Penney's game aimed to find a more equitable game.
The No-Flippancy Game
Isha Agarwal, Matvey Borodin, Aidan Duncan +7
We analyze a coin-based game with two players where, before starting the game, each player selects a string of length comprised of coin tosses. They alternate turns, choosing t…
Variants of Base 3 over 2
Matvey Borodin, Hannah Han, Kaylee Ji +8
We discuss two different systems of number representations that both can be called 'base 3/2'. We explain how they are connected. Unlike classical fractional extension, these two s…
Chip-Firing and Fractional Bases
Matvey Borodin, Hannah Han, Kaylee Ji +8
We study a particular chip-firing process on an infinite path graph. At any time when there are at least chips at a vertex, chips fire to the left and chips fire to t…