Timeline for Shortest grid-graph paths with random diagonal shortcuts
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 14, 2010 at 6:55 | comment | added | Aaron Meyerowitz | The idea seems good, but you are making a mistake. The length is m+n is no diagonals are used, but each diagonal used is a change of $\sqrt{2}-2$ (makes the total smaller). You are using $\sqrt{2}-1$. Check your formula for L(1,1). | |
| Nov 13, 2010 at 16:10 | comment | added | Joseph O'Rourke | I like the idea of writing it as a recurrence relation. Will try when time permits. Thanks! | |
| Nov 13, 2010 at 16:01 | history | edited | sleepless in beantown | CC BY-SA 2.5 |
added 857 characters in body
|
| Nov 13, 2010 at 15:40 | history | answered | sleepless in beantown | CC BY-SA 2.5 |