Hello memory sports enthusiasts.
I have this idea for the numbers event. Instead of just pure numbers, why not include letters?
What do you think? I think it would be interesting.
I guess it will use the Mallow style (if the letters will use the same image as the numbers).
Anyway, I have this idea of overlapping 2-letter pair (26×26=676) with the 1000 digit images.
I guess the single letter (26 images) could be taken from the extra 352 images (if using 2-card system) for simplicity.
The 26 alphabet letters are grouped horizontally and vertically.
Table 1.
(*z) it is like a 2
(*w) it is like an inverted m
(*y) nearly same stroke as 4
(*h) nearly identical except for the curve
(*x) because of siX
(*q) Ben system for “u” as in “you” sounds like q
So basically for Column 0 the letters are taken from the Major System.
For Column 2, it’s the Ben System vowels.
Rules:
Format: (1st letter, 2nd letter)
1st digit = Column Combination
2nd digit =row value of 1st letter
3rd digit = row value of 2nd letter.
(The 2 will be converted to binary digits)
(OTHER VARIATION )
(1st digit = row value of 1st letter)
( 2nd digit = Column Combination)
( 3rd digit = row value of 2nd letter)
(1st digit = row value of 1st letter)
( 2nd digit = row value of 2nd letter)
( 3rd digit = Column Combination)
Column Combination
00 = 0
01 = 1
02 = 8, visualize 2 as a belt, so the 0 put on the belt tightly. It is like 8.
10 = 2
11 = 3
12 = 6, because 110 = 6
20 = 4, because 100 = 4
21 = 5, because 101 = 5
22 = 7, transfer the 1 to other side, it is 31 or 13, therefore 111 = 7
Solving for the no. of images.
00 = 10 choices × 10 choices = 100
01 = 10 × 10 = 100
02 = 10×6 = 60
10 = 10 × 10 = 100
11 = 10 × 10 = 100
12 = 10 × 6 = 60
20 = 6 × 10 = 60
21 = 6 × 10 = 60
22 = 6 × 6 = 36
Total of 676
Examples:
c d = (col 0,col 0) 01 = 001
c t = (col 0,col 1) 01 = 101
c a = (col 0,col 2) 01 = 801
s d = (col 1,col 0) 01 = 201
s t = (col 1,col1) 01 = 301
s a = (col 1,col 2) 01 = 601
q d = (col 2,col 0) 01 = 401
q t = (col 2,col 1) 01 = 501
q a = (col 2,col 2) 01 =701
It’s a bit tricky especially for the Column Combination but I guess if it’s pre memorized it’s possible to be fast.
For the 5 digit binary (00000-11111) there are 32 combinations which is only 6 more from our letters.
The Table 1 can also be used just extend the values to 32.
For the 10 digit binary there are
32 * 32 = 1024 combinations
which can be overlapped from the 1352 images.
But it’s tricky and I guess not ideal for competition
Again this is only an idea. I don’t know if this has no mistake.
Any thoughts? Comments? Mistakes?
Thanks…