I was watching this video How An Infinite Hotel Ran Out Of Room, by Veritasium.
The video says that it is not possible to fit names made of infinite strings of $\{A,B\}$.
We know we can fit infinite people in the hotel, we also know that there solution that works and solution that don't work. For example if you have infinite buses with infinite people if we gave a room one bus at a time we would be full after the first bus, on the other hand if we make a matrix and translate the diagonal to a single line (as shown on the video) we can fit everyone.
Following this if we ignore the name and treat the set as a stack then you would fit all of them because it's then a infinite stack and we can use their hotel room number to identify them, would this not be a possible solution?