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
Now for the substance. I have created a file with legitimate chains. How do I use it now? I suspect it should be through onTester, frames... Looked at the documentation, but something doesn't add up. Can't figure out how to deal with it.
I'm thinking of reading it into an array and taking data from it...
I think this problem is better solved analytically. You need to generate a chain on the fly, knowing its index. Google "Combinatorics. It seems to be solved via Pascal's triangle. At least I solved this problem for searching combinations, I think there will be something similar for placements.
In general, I'm not very clear about the purpose of your problem. Why can't the functions be repeated in the chain?
In general, I'm not very clear on the purpose of your task. Why can't the functions be repeated in a chain?
Well, if so:
then why?
And if it's like this:
If that's the case:
then what's the point?
And if it's like this:
I thought the processing of functions is sequential, i.e., the result of calculation of the first function is passed to the input of the second function, etc. And it turns out that everything works independently? Then it's even unclear, what you are optimizing there.
A file has been created with the legitimate chains. How do I use it now? I suspect you have to use onTester, frames...
Frames have nothing to do with it. Use either tester_file or COMMON. Here is a working example.
It's not about architecture. It's about the set of functions and how they are applied.
Give more information about the role of these functions in your program (this is the architecture in question).
Functions for defining market entry conditions.
Made read chains from a file by entry number. Started genetics. It seems to be working and does not swear.
The only question is: chains are not systematized in any way and will the genetics will find the best variant? It doesn't look at all of them. Shouldn't we start by sorting the resulting file? How to do it?
I sorted a text file. Now I have to read the string with chain, break it into components and fill the array.
But when compiling, it immediately generates a warning, and I don't understand why...
On startup thearray out of range error
Contents of the text file:
Reworked:
But the question is: the chains are not systematised in any way, will genetics find the best option? It doesn't look at all the variants. Shouldn't we start by sorting the file? How do we do that?
Of course it won't. You first have to understand the genetic algorithm, understand what genes are.
Your approach, voiced in the first post ("I, as a user, want to get a result, and I don't care how it works") is absolutely wrong in this case.
Your approach, as stated in the first post ("I, as a user, want results, and I don't give a damn how it works") is completely wrong in this case.
This is not the case. as long as there is no clear documentation and tutorial from MK on their genetics, it is mockery to demand from the user a deep knowledge of genetics. there may be a huge number of implementations, so even a deep knowledge of genetics does not mean a guaranteed effective optimization