[TI-82] Smallest UIDs for alpha, 2nd, & reg chars

[blast]

As far as typings things in on the calculator, you have 3 major options
1. alpha lock or alpha key enables alpha characters (white)
2. 2nd key enables 2nd characters (blue)
3. just simply pressing the button enables reg chars (1, 2, 3, 4, - , /)

Your challenge is to come up with the best algorithim to create unique char ids derived from the actual getKeys, the smallest possible ids in digit size, and all ids must be the same length of digits. There are no more than 99 characters including alpha, 2nd, and reg (these are the relevant ones, for example the reg char 'MODE" is not important for typing in). So seeing that, the smallest possible ids should be at least 2 digits. I have only managed to make unique 3 digit ids.

Unique is important because 1 getKey can be used for multiple characters.
IE:
the key 63
can be an alpha char 'K'
or a 2nd char '{'
or a reg char '('
if you have to create 3 ids for each one of these 3 types that can be derived from the original getKey

So summing it up:
Given
1. getKey code
2. 1 of 3 identifications (alpha, 2nd, reg), var 'Z' will be set to 1 for alpha, 2 for 2nd, 3 for reg

You must:
1. come up with smallest unique id derived from the given information

in other words if the program is given the getKey code and the char type identification your algorithim should be able to come up with this unique char id, and each char id must be the same length of digits, all 2 digits, all 3.. all 4..etc...

Good Luck
I'd love to see any algorithim for a 2 digit ids without a lookup.

[DarkerLine]

There's only 100 possible numbers that are 2 digits or less. 90 that are exactly 2 digits. There are 162 possible getKey & modifier combinations. Something's gotta give - you can't fit them all into two digits.

For using 3 digits (if nothing besides the number of digits matters) something like this could work:

[blast]

I should have spelled out which keys are 'important', not all 162.

alpha chars (29)
a-z
space
?
theta

2nd chars (5)
{
}
[
]
:

reg chars (1
0
1
2
3
4
5
6
7
8
9
)
(
,
-
.
+
*
/


thats a total of 52 chars in need of unique char ids, well under 90 chars

to darkerline: does your posted solution for 3 digit ids take into account dealing with some 3 digit getKeys like '0' reg char which is getkey 102
and '.' dot which is 103
for a dot (reg char)
your code would produce 20603

[Weregoose]

[blast]

yes it appears I did
anyways.. 3 digits are easy, like I said i've already done this.. the real challenge is getting it in 2

[DarkerLine]

Here's a routine which assigns the numbers 10 through 61 to the keys you list, in the order they appear. The first part of it can appear in any part of the program, while the second is the code that actually converts a pair (Z,K) to the two-digit code. It returns 0 for all keys you don't mention.

I'm too lazy to type it into an emulator and check the size, especially since I couldn't find PindurTI's key for the memory menu, but it's somewhere between 250 and 300 bytes, I think.