SpongeBob SquarePants
04-12-2002, 05:47 PM
NI!
Howard,
:confused: :confused: :confused: :confused:
I may be a totally wet Sponge here, but would it not be better to instead of us randomly brute strength forcing our way to low RMS, instead use the previous work to base new work results on?
I may be wrong on this, but it seems that we are "infinite monkey" -ing this. I hope I am wrong.
Maybe you could explain in broad brush strokes how the project generates random seeds, and how they help.
Instead of random seeds, if my shrubbers were to say start at the last-best-lowest RMS structure as a starting point. They would be focusing in on a more accurate result.
I am not describing this very well but here goes:
(Picture the game MasterMind. you do not know the color(AA) or placement (order) but through process of elimination you can devine the correct answer. In our case we have 4 colors with 62 places)
When my 5,000 or 10,000 units are uploaded, the program tells me to crunch the next 5,000 but places a fixed result in the first AA. We will call it A, (A place1), When Y2K+1Guy gets his units he is told to place a fixed reult in the second AA Aplace2. We turn in our results, and whoever has the lower RMS disqualifies the other. That lower RMS unit is sent to Worker Bee #3, and so on. We try the other colors (AA's) in place one, then move to place 2. We keep going until we have all 4 colors in all 62 places.
(For all you math folks is the total possible combination 4^62?)
(If so then we get one right it is 4^61 Etc.....?)
This may be what we are doing now. Maybe some more scientific/ programmers types could explain this to little ol' me.
I am very competitive and really want you guys to win this.
A Curious SpongeBob SquarePants
P.S. If when we are going for a blind test for CASP 5 how do we know what the best RMS is?
:confused:
Howard,
:confused: :confused: :confused: :confused:
I may be a totally wet Sponge here, but would it not be better to instead of us randomly brute strength forcing our way to low RMS, instead use the previous work to base new work results on?
I may be wrong on this, but it seems that we are "infinite monkey" -ing this. I hope I am wrong.
Maybe you could explain in broad brush strokes how the project generates random seeds, and how they help.
Instead of random seeds, if my shrubbers were to say start at the last-best-lowest RMS structure as a starting point. They would be focusing in on a more accurate result.
I am not describing this very well but here goes:
(Picture the game MasterMind. you do not know the color(AA) or placement (order) but through process of elimination you can devine the correct answer. In our case we have 4 colors with 62 places)
When my 5,000 or 10,000 units are uploaded, the program tells me to crunch the next 5,000 but places a fixed result in the first AA. We will call it A, (A place1), When Y2K+1Guy gets his units he is told to place a fixed reult in the second AA Aplace2. We turn in our results, and whoever has the lower RMS disqualifies the other. That lower RMS unit is sent to Worker Bee #3, and so on. We try the other colors (AA's) in place one, then move to place 2. We keep going until we have all 4 colors in all 62 places.
(For all you math folks is the total possible combination 4^62?)
(If so then we get one right it is 4^61 Etc.....?)
This may be what we are doing now. Maybe some more scientific/ programmers types could explain this to little ol' me.
I am very competitive and really want you guys to win this.
A Curious SpongeBob SquarePants
P.S. If when we are going for a blind test for CASP 5 how do we know what the best RMS is?
:confused: