Hi Stan,
Working around with filters related to number movement and highest match, i´ve found the situations in the file attached that seems to be bugs.
Regards,
Filipe.
Gatsby wrote:Hi Stan,
1) See file attached
3) As for "Last digit ..." A combination like 26-27-28-39-40 should pass. In this case 9 is lower than 0. It´s a circular pattern. Don´t you think it should filter this combination?
Gatsby wrote:Hi Stan,
I think that in this case it shoul allow circularity.
Gatsby wrote:Hi Stan and Jerzy.
for sometime i´ve been advocating the use of circularity, or if you want, circular patterns. This is the case for a permutations builder, but it applies also in this filter. If you look at a pattern like +++-- and aplply it to the last draw you allways will have combinations to remove, but it must permite circularity and rearranjement of those combinations:
Example:
Last draw is: 1, 13, 22, 24, 45
applying the movement (+++--) will give:
2, 14, 23, 25, 46
3, 15, 23, 26, 47
4, 16, 24, 27, 48,
5, 17, 25, 28, 49
6, 18, 26, 29, 50
but also:
7, 19, 27, 30, 1 or what is the same: 1, 7, 19, 27, 30 *
8, 20, 28, 31, 2 .......................: 2, 8, 20, 28, 31 *
These are combinations that are worth to remove (that is 5, 4 or 3 numbers from each of them), as the rule icontinues the same. If you try this transformations and applied to your last draw and look at the next, you will see that normally only 1 or 2 numbers (exceptionally 3) appear in that next draw. Mind that this also is observable for the combinations identified by * ... as if they were part of the same family of transformations, so i think they should be considered.
Sorry if english isn´t very good or to my difficulty to express an idea in a more clear way. I think, though, this is something to explore. A filter that looks at the movement shouldn´t consider this? Isn´t this logical?
Regards,
F.
Gatsby wrote:Hi Teoman,
In first place let start by apologizing how i started posting in a post started by you in "Adjacents". It wasn´t my intention to divert that discussion or to break your line of reasoning. It just seemed appropriated to give my opinion.
Maybe you didn´t like what i posted above that Stan would have to create a new filter for each movement that someone imagines, i will let Stan be the judge on that.
About your example, though i didn´t see where you´ve gone to present combination 47, 09, 18, 20, 41 i can see the logic. I can´t agree with you, though, on the question of efficiency. If by that you mean that only o or 1 commun number appear, i remember that i said normally o, 1 or 2 are commun to the transformed combination (of which adjacents and knight move are examples). In some draws the transformation will give 0 or 1 number, in others it will give 3 numbers (very exceptionally), but we do not expect that draw after draw it will give 2 numbers or even 1, normally it will give sequences of 0 or 1. In a further apllication of this filter (builder), it even could come to reject all the numbers if we have a sequence of several 1´s, but this would have to be an kind of "Transformations History filter...." that i guess Stan isn´t quite interested in implementing, considering the work it may involve, and because we are just coming around with the ideia of a Permutations Builder.
Well, that is, i hope you don´t think i was by some way dismissing your idea, just trying to look at it from another perspective. In fact i´m glad you put the question about adjacents, because that gave me a opportunity to present by another light this question about permutations.
Best Regards,
F.
Return to Development versions
Users browsing this forum: No registered users and 8 guests