Algorithm Optimisation Championship. - page 15
You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
Participants can already post compiled FF functions as *.ex5 libraries here to start training, so to speak.
The FF library should have two functions to be called:
ParamCount() is used to find out how many parameters should be optimized.
Exactly these two functions will be in the championship FF.
This is what the championship is all about - finding the maximum of an unknown function with between 100 and 500 variables (roots) in any way and in any language. Read the rules.
Easy? Great!
How do you check "faster" and "more accurately" if the algorithms are in the hands of the participants? How do you check that a participant has found a solution in fewer steps than a complete brute force?
A complete brute force may take forever. He's no competition for us.
"Faster" means faster. You, here, at the agreed time, give us the equation. We solve it. Whoever's first is supposed to have the best algorithm.
As for "more accurate". In the example.
Find the roots of the equation: 34a+43b+16c+30d+23e=6268; Solutions are integers a=26, b=12, c=111, d=100, e=4
If the contestant finds these numbers then the accuracy is -100%
Then I'm in, I guess. Thank you.
Do you want me to write it down?
A complete overkill could take forever. He's no competition for us.
"Faster" means faster. You, here, at the agreed time, give us the equation. We solve it. Whoever's first is supposed to have the best algorithm.
As for "more accurate". In the example.
Find the roots of the equation: 34a+43b+16c+30d+23e=6268; Solutions are integers a=26, b=12, c=111, d=100, e=4
If the contestant finds these numbers then the accuracy is -100%
Yes, please.
It's a challenge to try and solve a brute force problem in the most optimal way possible in polynomial time. Someone might just get lucky if their algorithm initially falls close to the optimum. Need multiple problems, unequivocally!