Timeline for answer to Sandbox for Proposed Challenges by Ming-Tang
Current License: CC BY-SA 3.0
Post Revisions
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| May 6, 2015 at 21:15 | history | wiki removed | Martin EnderMod | ||
| Sep 4, 2014 at 21:28 | history | post merged (destination) | |||
| Aug 27, 2014 at 1:46 | history | post merged (destination) | |||
| Jun 1, 2011 at 6:49 | comment | added | MtnViewMark | You should drop the complexity test, and worry about brute force. Just give an example big enough that brute force won't work. With this kind of problem, it should easy enough to give such a maze. | |
| May 28, 2011 at 22:35 | comment | added | dmckee --- ex-moderator kitten Mod | So the problem is (1) build a undirected, weighted graph from the ASCII maze and (2) find the shortest path from "x" to "o" in that graph. Part 2 is cookbook stuff and languages which have good support for it may have a real advantage, but part one presents some choices. I like it. | |
| S May 28, 2011 at 19:03 | history | answered | Ming-Tang | CC BY-SA 3.0 | |
| S May 28, 2011 at 19:03 | history | made wiki | Post Made Community Wiki by Ming-Tang |