Timeline for Algorithm to solve Sokoban-like game on graphs - move chips from one set of vertices to another
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17, 2013 at 1:34 | history | edited | Günter Rote | CC BY-SA 3.0 |
correction about handling of chips that are at their final place.
|
| Feb 17, 2013 at 0:51 | history | edited | Günter Rote | CC BY-SA 3.0 |
clarified the procedure; deleted 8 characters in body; added 2 characters in body
|
| Feb 16, 2013 at 11:44 | comment | added | Dima Pasechnik | Right, I gave up too quickly. Now, at least I know why these motion planning problems on graphs need a "pusher" to make them hard! | |
| Feb 16, 2013 at 11:42 | history | edited | Dima Pasechnik | CC BY-SA 3.0 |
mild editing for clarity
|
| Feb 16, 2013 at 10:11 | comment | added | Alexander Chervov | Thank you very much for your answer ! What do think about the case wit NON-identical chips ? It seems Step 3 heavily relies on "identity". | |
| Feb 16, 2013 at 7:53 | comment | added | Andrej Bauer | @Dima: ignore the first sentence of step 1. It is step 2 which actually finds which chip goes where. Step 1 just finds candidate places for each chip. | |
| Feb 16, 2013 at 2:34 | comment | added | Dima Pasechnik | how are you going to do 1) in polytime? | |
| Feb 15, 2013 at 20:46 | history | answered | Günter Rote | CC BY-SA 3.0 |