Just one last question, then i wont bother you anymore
The stuff suggested so far, focuses, if im not mistaken, on generating an unique pattern from which the original values can be (cant seem to find the right word) calculated.
e.g. values -> pattern -> values
but what if what if i only need the unique pattern and not the ability to do the stuff backwards?
fx. still focusing on cards.
2 cards give 1326 unique combinations, not focising on the order. 52*51 / 2! = 1326
0 - 1325 should be the values the patters could contain.
of course sorting them would still be the easy aproach, but it would give a pattern of a different type, a pattern where the cards involved can be recognised. this is not wanted in this scenario. The reasons are hard to explain, maybe ill try later.
e.g.
50, 51 = unique x
51, 50 = same as above
50, 51 = same as above
50, 49 = new unique x
etc.
and all these paterns is unique and in the range 0 - 1325
basicly:
S=suit, V=value
S{s1, s2} == 0 - 15 (s1==s2)?(v1!=v2):(s1!=s2)
V{v1, v2} == 0 - 168 (v1==v2)?(s1!=s2):(v1!=v2)
this however does not exclude the order from the pattern, which is most important.
edit:
i just read this through a couple of times and realise that i my self would probably have a hard time understanding it, and the purpose, but i dont think i can do any better.
ask questions if needed and ill try to answer, or refrain from answering.
Thanks
.