Can you make Megan (a stick-figure model of the popular XKCD character) walk straight?
Megan's pose is defined by a 20-element "pose" vector. In this problem you are tasked with defining two pose vectors x1 and x2 such that the cyclic trajectory defined as:
x(t) = sin(2*pi*t)*x1 + cos(2*pi*t)*x2
results in Megan walking as straight and as far as possible.
The vectors x1 and x2 must contain real numbers with absolute values not higher than 2. Your code will be scored as a function of how far (and straight) Megan reaches when the cyclic trajectory above is repeated between t=0 and t=4 (four full cycles). Megan needs to walk forward a minimum of 100 units (approximately 1m) to pass this problem (see testsuite for details)
I will update the links below with some of the best solutions:
Good luck and have fun!
For anyone who is looking for some pointers on this problem: http://xkcd.com/138/
Alfonso, I've submitted the same values of x1 and x2 four times, and I've received four different distances. The solution numbers are 697837 and 699826-699828. I ran into this issue on my own computer, but thought it was just due to a much earlier version of MATLAB mucking things up. I'm not nearly smart enough to figure out why this is happening. Any thoughts?
I've seen same behaviour. Different results occur due to wind. Set parameter 'defs_windnoisy' to 0 when evaluating drawMegan() and distance becomes "stable" (4609 in case of this solution). Most unstable solution I've found was getting distance between 330 up to around 2700.
Given two strings, find the maximum overlap
521 Solvers
Back to basics 17 - white space
233 Solvers
45 Solvers
Sum of first n terms of a harmonic progression
234 Solvers
53 Solvers