Plenty_of_zero
@wdjoyner.bsky.social
Math nerd, Orioles fan, writer
The Elevator Problem (4/4)
Taboo: You can press the elevator button if and only if no elevator is moving down.
Is there a finite sequence of moves that allows you to ride in elevator e?
Taboo: You can press the elevator button if and only if no elevator is moving down.
Is there a finite sequence of moves that allows you to ride in elevator e?
November 2, 2025 at 4:27 PM
The Elevator Problem (4/4)
Taboo: You can press the elevator button if and only if no elevator is moving down.
Is there a finite sequence of moves that allows you to ride in elevator e?
Taboo: You can press the elevator button if and only if no elevator is moving down.
Is there a finite sequence of moves that allows you to ride in elevator e?
The Elevator Problem (3/4)
Goal: Suppose you want to use elevator e (for some fixed e=1, 2, ..., n).
Move: If you press the button and an elevator other than elevator e arrives, you can tell it to go to any floor you wish.
Goal: Suppose you want to use elevator e (for some fixed e=1, 2, ..., n).
Move: If you press the button and an elevator other than elevator e arrives, you can tell it to go to any floor you wish.
November 2, 2025 at 4:26 PM
The Elevator Problem (3/4)
Goal: Suppose you want to use elevator e (for some fixed e=1, 2, ..., n).
Move: If you press the button and an elevator other than elevator e arrives, you can tell it to go to any floor you wish.
Goal: Suppose you want to use elevator e (for some fixed e=1, 2, ..., n).
Move: If you press the button and an elevator other than elevator e arrives, you can tell it to go to any floor you wish.
The Elevator Problem (2/3)
The way the elevator logic works is this: when you press the elevator button, the one closest to you (= one on floor number min(fk, k>0)) is told to go to 0. If there is a tie then, of those on the same lowest floor, the elevator with the smallest index is told to go to 0.
The way the elevator logic works is this: when you press the elevator button, the one closest to you (= one on floor number min(fk, k>0)) is told to go to 0. If there is a tie then, of those on the same lowest floor, the elevator with the smallest index is told to go to 0.
November 2, 2025 at 4:25 PM
The Elevator Problem (2/3)
The way the elevator logic works is this: when you press the elevator button, the one closest to you (= one on floor number min(fk, k>0)) is told to go to 0. If there is a tie then, of those on the same lowest floor, the elevator with the smallest index is told to go to 0.
The way the elevator logic works is this: when you press the elevator button, the one closest to you (= one on floor number min(fk, k>0)) is told to go to 0. If there is a tie then, of those on the same lowest floor, the elevator with the smallest index is told to go to 0.
The Elevator Problem (1/3)
You are on the bottom floor (floor 0, lets call it) of an apartment building with no basement. There are n elevators, which we index 1,2,...,n. Assume the elevators are initially on floors f1, f2, ... , where fk>0 is the floor elevator k is currently on, 1<=k<=n.
You are on the bottom floor (floor 0, lets call it) of an apartment building with no basement. There are n elevators, which we index 1,2,...,n. Assume the elevators are initially on floors f1, f2, ... , where fk>0 is the floor elevator k is currently on, 1<=k<=n.
November 2, 2025 at 4:24 PM
The Elevator Problem (1/3)
You are on the bottom floor (floor 0, lets call it) of an apartment building with no basement. There are n elevators, which we index 1,2,...,n. Assume the elevators are initially on floors f1, f2, ... , where fk>0 is the floor elevator k is currently on, 1<=k<=n.
You are on the bottom floor (floor 0, lets call it) of an apartment building with no basement. There are n elevators, which we index 1,2,...,n. Assume the elevators are initially on floors f1, f2, ... , where fk>0 is the floor elevator k is currently on, 1<=k<=n.
working on a board game in godot:
yetanothermathblog.com/rithmomachia...
yetanothermathblog.com/rithmomachia...
work in progress: rithmomachia in godot
I’ve already written a few implementations of rithmomachia is python (see the github site for more). Since gdscript (the language used by game developing package godot) is similar to Python, …
yetanothermathblog.com
October 13, 2025 at 5:22 PM
working on a board game in godot:
yetanothermathblog.com/rithmomachia...
yetanothermathblog.com/rithmomachia...
the latest rithmomachia tutorial
nerdymovie.blogspot.com/2025/08/sett...
nerdymovie.blogspot.com/2025/08/sett...
setting up rithmomachia pieces using patterns
This is a rithmomachia lesson on the ingenious patterns that the values make between the pieces when they are in their initial position, usi...
nerdymovie.blogspot.com
August 18, 2025 at 10:38 AM
the latest rithmomachia tutorial
nerdymovie.blogspot.com/2025/08/sett...
nerdymovie.blogspot.com/2025/08/sett...