I'm working on the hovercraft battle challenge (in the sandbox).
Each hovercraft is modeled by a disk. For a given segment of time, the disk experiences a constant "linear" acceleration and constant torque. The main problem is that the direction of acceleration depends on the orientation of the hovercraft, but the orientation changes over time.
I've been able to solve (exactly) all of the cases in which the disk experiences only linear acceleration and no torque.
I think we need a meta ruling on java lambdas, honestly. I'm not sure why the interface definition doesn't get counted, but I've seen it done that way several times.
Trying to completely classify "Is this even a word?" using regex and most of the non-words that are left look like plausible words lol (there's even ones like "chia", which is a word...)
I'm looking for a fast suffix-array construction algorithm. I'm more interested in ease of implementation and raw speed than asymptotic complexity (I know that a suffix array can be constructed by means of a suffix tree in O(n) time, but that takes a lot of space; apparently other algorithms have...
annoyingly the link for the fastest method is broken
I love that the options are all described in published papers except for one that is often the fastest which just exists in some online forum post by a Russian person :)
@Optimizer that depends on whether you're counting by characters or bytes. for characters it's around 35 I think... for bytes more like 100 (maybe 80).
same here... but I'm sure somewhere in the project configuration of eclipse, there'll be a command that's run when compiling (at least that's what it's like in VS)
ah it worked after I copied player.conf into the src directory
I guess eclipse builds everything (and a copy of player.conf) into a separate build directory?
oh, that's interesting... I've got separate py2 and py3 installations on my (Windows) machine
:D
java.lang.Exception: Timeout for DummyTeam
at Team.sendReceive(Team.java:40)
at Team.getBattleAction(Team.java:145)
at Battle.turn(Battle.java:73)
at Battle.run(Battle.java:30)
at Tournament.run(Tournament.java:52)
at Tournament.main(Tournament.java:30)
Removing faulty bot: DummyTeam
okay, I've got a bot ... now the hard part... coming up with names...
@Geobits You should probably do something about infinite rounds as well. I had a bug in my controller where it used Pain against Normal-type monsters... when I was paired against a metapod, we'd just indefinitely hit each other with Pain and Punch causing 0 damage.
I've had DummyTeam time out before, but it was due to some zombie processes (from something else) running my CPU to max. Never had it happen besides that one.
But I'll wait on accepting the answer because in my experience, the moment you accept an answer on that site, all traffic on the question ceases to exist.
And also because no dictionary I can find even thinks that it is a word
Octopussianly sounds very sexual
... and also made up. What the heck ELU? Why do so many users on that site make up words?
have a look at wikipedia ... in your case, y is your spatial coordinate (x, say), and f(y,t) is simply v_0 + a*t (where v_0 is the velocity at time 0). the rest you can probably just write down from there
since you're in two dimensions, the two spatial coordinates can be computed independently with this method (using the appropriate components of v and a)
@PhiNotPi I thought you had constant acceleration?
oh but you mean because of the rotation?
yeah, that's what I meant
well, it's always possible to work out the equations of motion as a set of first-order equations (using Hamiltonian dynamics). it shouldn't be too hard in this case. I can give it a go, but I'm not sure I'll get around to it before the weekend.
that was a joke... But there might actually be an idea here....
If the hovercraft has commands like accelerate forward, turn right, turn left, and backwards, then there would never be torque and linear acceleration at the same time... Thus allowing it to be exactly solved.
Question for anyone familiar with machine learning or this type of problem, if I was making a program that deals with natural language and the outcome is determined by what the user is asking (Siri-like), what would be the most effective and least resource intensive machine learning algorithm to implement to score the inputs probabilistically?
I was thinking something like Multinomial Logistic Regression or the Naive Bayes Classifier
Perhaps @MartinBüttner @grc or @PeterTaylor could be able to answer
