MaxCoderz

OK, I replaced all 'otir' and 'inir' with loops using only 'out' and 'in'. I am almost certain that every 'in' or 'out' is followed by a call to LCD_busy_quick. The program runs fine on VTI and PTI, and the logical flow seems accurate and correct. When I send the program to my calculator, there are ...

Is 'inir' too fast for the LCD driver as well?

Yeah I knew that . Solving expressions instead of equations is the product of late at night and not enough sleep. Also happens when you try to type a lot in a little time.

I already call LCD_busy_quick between every operation with the LCD driver. It still doesn't work right on the calculator. Does the otir operation need a delay? I tried breaking up an 'otir' into its 'outi's with an LCD_busy_quick between each one, but that shouldn't be necessary, should it?

Well, I have a TI-89t myself, and basically you can use any variable name that has been defined or any that has not been defined. The defined ones are replaced with whatever they represent (like the TI-83), but the undefined variables remain undefined. For example, if a = 4, then x + 3a - 2 would si...

Are there any projects related to parsing algebreic expressions and/or doing calculations and solving (like the 89) for the 83+? That would be an interesting/fun assembly program. I'd maybe even try it. How about a program that "understands" some of the familiar optimizations of TI-BASIC p...

My VTI is running TI-83+ ROM version 1.12. When I run a game I have made (using extensive communication with the LCD port), it works just fine, but when I send it to a calculator (borrowed) with ROM version 1.13, the game runs fine but the display routines are disfunctional. Part of the screen is no...

If you are displaying multiple strings at different locations and the strings are located sequentially in memory, you can optimize by using the de register to set curRow and curCol rather than the hl register; it does add 1 byte for each "ld (xxxx), de" instruction, but you save 3 because ...

In the expression N - a, it would actually be more efficient to use the "neg a/ add a, N" combination if N refers to a register rather than a constant. Or would there be a more efficient method in that situation?

Here's a method I used for decimal roots, but it is even easier in binary. I'll use 10101001 (1101^2). 1) First, break the number up into groups of two digits starting from the decimal place and going left. (10 10 10 01.) 2) Place a '1' above the first group. > 1 >10 10 10 01 3) Bring down and subtr...

Ahh, so if I have two states [x] and [y] that I want to alternate between: ld a, [x] xor [y] ld (xor_val), a Now if I save the value in register a, the following code will cause an alternation between the states [x] and [y] (assuming register b contains the current state): ld a, (xor_val) xor b Is t...

Here is an optimization I've used many times. Suppose you have a variable that contains a letter representing the current player (like 'O' or 'X' for Tic-Tac-Toe). After each move, the variable will alternate between each of two states - $4F or $58. Here is the simplest way to make this work (assumi...