131–140 of 427 posts
Sounds like destination dispatch would work better if it didn't tell you which elevator to get into until the elevator arrived.
EDIT: already being discussed in the thread at https://news.ycombinator.com/item?id=49125423
(In the example above we gave up and decided it was cardio time, five laps up and down 14 flights to escape with all our luggage.)
Makes me want to play Sim Tower again. There’s something so satisfying about watching a machine just dutifully work through queued tasks like this.
A fun tidbit about Sim Tower: > After my lecture, a Maxis employee who shall remain nameless buttonholed me. "You guessed right," she said. "Sim Tower was built around a real elevator simulation program we bought from a Japanese guy." https://web.archive.org/web/20090916193335/http://www.gamasu...
Earlier quoted context omitted.
That sounds like two separate things then. Could you not have people select a destination without locking in an elevator? (I've never encountered destination dispatch myself, so I'm not really sure how it works in practice)
The way I've seen it work is that there's a touch screen in the elevator lobby. You tap a floor, and then screen will say "Car C" (along with an audible message). The problem is that then the system can't reassign you to a different car after that. You'll typically have a bunch of different people going to a bunch of different floors, and there would be no reliable way to communicate to each individual their new assi…
But yes, this seems like a case of "unfortunately, people".
Level 2: Traffic lights, graphics (2D arrays)
Level 3: Flight control, simulations (3D arrays)
Level 4: Satellite tracking, virtual worlds (4D arrays)
...
So many problems can be cast to arrays to be solved with various linear algebra.
Considering LLMs are "Level 1000+" puzzles in this analogy, I wonder if every problem could be represented by an n-dimensional vector and solvable with algebra.
They at least make great interview questions - Tic-Tac-Toe is commonly given, but is obvious. The board already "looks" like arrays. The less obvious ones, like elevators (or load balancing), are always interesting.
Now maybe I can beat that game!
I visit a building sometimes with destination dispatch elevators, and with low exposure across multiple years I'm confused every time the elevator I need to take is open behind me.
I once used the paternoster lift in Germany, beats any elevator algorithm efficiency because it's a non-stop "conveyor" with no doors. I still get nightmares about that elevator.
> Destination Dispatch [...] are in general worse I wonder if this is an artifact of how the author used random destinations. I worked in a building that used Destination Dispatch, and the common travel pattern seemed to be: - Everyone who is not on the ground floor generally want to go to the ground floor. - People who are on the ground floor generally travel in large groups to the same destination. This happens bec…
Surprisingly, claude failed to find a good one.
Also, part of destination dispatch (I'm guessing based on experience) removes the 'stopping on every floor problem', so the real test would be total time including wait at that point I think.