Timeline for coin reversal puzzle with one hand and two stacks
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 8, 2014 at 10:30 | answer | added | domotorp | timeline score: 1 | |
| May 8, 2014 at 10:16 | comment | added | domotorp | I also think it would be great if you could give some more examples. If N=2, is the answer 1 or 2? The operations and what we count are not clear to me. | |
| Apr 9, 2014 at 3:50 | comment | added | bobuhito | @Zack In similar words, I want to reverse one LIFO queue (i.e., a stack) using two other LIFO queues, but the reversed data needs to be in the original LIFO queue and the other two queues cannot feed each other directly. I'll give mathematicians a chance first because I think this is quite difficult and perhaps no algorithm is even known. | |
| Apr 9, 2014 at 3:31 | comment | added | Gerry Myerson | If you can solve it for a few small values of $N$, you might be able to look it up at the Online Encyclopedia of Integer Sequences. | |
| Apr 9, 2014 at 3:20 | comment | added | Zack Wolske | It sounds like you're asking for the best algorithm to reverse a queue using two other FIFO queues. It might be better to ask on stack exchange - a cursory glance at a "reverse queue" search there makes it look popular. | |
| Apr 9, 2014 at 2:02 | history | edited | bobuhito | CC BY-SA 3.0 |
removed constraint on emptying hand since it was not needed
|
| Apr 9, 2014 at 1:35 | comment | added | Steven Landsburg | It would be really good to reword this so that it does not appear at first glance like the answer might depend on your manual dexterity. | |
| Apr 9, 2014 at 1:15 | history | asked | bobuhito | CC BY-SA 3.0 |