Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 9, 2017 at 16:56 | comment | added | user58826 | Hello! This looks like a good but abandoned meta post, would you be willing to offer it for adoption? (If you want to, you can still post to main.) Due to community guidelines, if you don't respond to this comment in 7 days I have permission to adopt this. | |
| May 6, 2015 at 21:15 | history | wiki removed | Martin EnderMod | ||
| May 3, 2015 at 15:37 | history | made wiki | Post Made Community Wiki by Martin EnderMod | ||
| Sep 25, 2014 at 19:04 | comment | added | xnor | This looks to be a Travelling Salesman problem on the rectangle grid graph (with one dimension looped around). It's open whether it's NP hard (cs.smith.edu/~orourke/TOPP/P54.html), which means no polynomial-time algorithm is know. This mean optimal solutions probably take very long to find. Is there a time limit? | |
| Sep 4, 2014 at 21:28 | history | post merged (destination) | |||
| Aug 7, 2014 at 22:14 | comment | added | Peter Taylor | Some test cases would be good. | |
| Aug 6, 2014 at 18:09 | history | edited | Mike Precup | CC BY-SA 3.0 |
added 29 characters in body
|
| Aug 6, 2014 at 18:09 | comment | added | Mike Precup |
Yep. I suppose I should lower bound n, since it doesn't make much physical sense to have n < 2.
|
|
| Aug 6, 2014 at 18:06 | comment | added | Nathan Merrill | If a 3 is passed in, is the house a triangular prism? | |
| Aug 5, 2014 at 23:58 | history | edited | Mike Precup | CC BY-SA 3.0 |
added 56 characters in body
|
| Aug 5, 2014 at 23:58 | comment | added | Mike Precup | Good catches, yes, and yes. I'll edit it in. | |
| Aug 5, 2014 at 23:57 | comment | added | Sparr | does the machine have to start with its color set to A? does it have to start off pointed at wall 0? | |
| Aug 5, 2014 at 23:41 | history | answered | Mike Precup | CC BY-SA 3.0 |