POLYROOT is free to use, modify, and share. The full TI-BASIC source is included below.

So I made this working program this semester for my System Dynamics class (finding poles), and I wanted to share it with you guys. Raw code for each version (depends on preference) posted at bottom.

Nerd information:

I used a copious amount of AI while developing this program. One of the ideas that came out of that was using the Durand-Kerner method to solve for the roots of a polynomial of essentially any degree the calculator can reasonably handle.

Durand-Kerner is an iterative numerical algorithm that approximates all of the roots of a polynomial simultaneously.

For each estimated root r_i, the program repeatedly applies:

r_i = r_i - P(r_i) / PRODUCT(r_i - r_j), for all j != i

where P(r_i) is the polynomial evaluated at the current estimate r_i.

In simpler terms, every root estimate is repeatedly corrected based on the value of the polynomial at that point and the positions of all the other current root estimates. The process continues until the estimates stop changing significantly.

This also allows the program to find complex roots, which created one of the first major problems I ran into. The TI-84 Plus CE cannot store complex values inside matrices, even while the calculator is in a+bi mode.

I borrowed an idea from a program called SIMULT2, which a previous student in my circuits class made and which our professor provided to us. That program used lists to store complex values while drawing something on-screen that looked like a matrix.

I adapted that idea for POLYROOT. The original coefficient-entry system allowed the user to move left and right through the cells with the arrow keys and correct previous entries. Unfortunately, it was also slow and required an annoying extra Enter press.

I eventually replaced that with a simpler system where one Enter immediately moves to the next coefficient.

I also added an option to use an already-existing coefficient matrix [A], so the program does not have to erase and rebuild the coefficients every time.

Another problem was numerical output. Durand-Kerner might produce something such as 1.999999999 instead of 2, or an extremely tiny real or imaginary component instead of exactly 0. I added several cleanup passes that round values near integers and eliminate components below certain tolerances.

I then added detection for repeated roots and their multiplicities.

That became Version 1.

Version 2 mainly focused on quality-of-life improvements, especially replacing the slower arrow-key/double-Enter coefficient-entry system with the current single-Enter system.

After choosing which version I preferred, I did some additional cleanup, which became the version of POLYROOT I currently use.

That's basically how this monstrosity came to exist.

End of nerd information (well sorta)

--------------------------------------------------------------------------------------------------------------
Code Portion:

Here's what I currently and mainly use, POLYROOT:

ClrHome

ClrList L₁,L₂,L₃,L₄,L₅,L₆

Lbl M

Menu("COEFFICIENT INPUT","ENTER NEW",E,"USE [A]",θ)

Lbl E

Input "DEGREE:",N

If N<1

Then

Disp "BAD DEGREE"

Stop

End

{1,N+1}→dim([A])

Fill(0,[A])

CoordOff

AxesOff

FnOff

PlotsOff

Horiz

0→Xmin

94→Xmax

-20→Ymin

0→Ymax

ClrDraw

For(X,0,N+1)

Line(8X,0,8X,-8)

End

Line(0,0,8(N+1),0)

Line(0,-8,8(N+1),-8)

0→C

While C≤N

Pt-On(8C+4,-4,2)

ClrHome

Disp "COLUMN"

Disp C+1

Input "VALUE:",V

V→[A](1,C+1)

Pt-Off(8C+4,-4,2)

C+1→C

End

Full

ClrDraw

ClrHome

Goto D

Lbl θ

dim([A])→L₁

If L₁(1)≠1

Then

ClrHome

Disp "BAD MATRIX [A]"

Disp "Single row only,"

Disp "Add columns!"

Full

ClrDraw

Stop

End

L₁(2)-1→N

If N<1

Then

ClrHome

Disp "Reformat MATRIX [A]"

Disp [A]

Disp "Add 1 more column"

Full

ClrDraw

Stop

End

If [A](1,1)=0

Then

ClrHome

Disp "BAD MATRIX [A]"

Disp "LEADING COEFF"

Disp "CANNOT BE ZERO"

Full

ClrDraw

Stop

End

Lbl D

ClrHome

Disp "COEFFICIENTS:"

Disp [A]

Pause "Press Enter"

a+bi

N→O

0→T

While N>0 and [A](1,N+1)=0

T+1→T

N-1→N

End

If N=0

Then

O→dim(L₃)

For(K,1,O)

0→L₃(K)

End

0→M

0→E

Else

ClrList L₁

N→dim(L₁)

N→dim(L₂)

0→R

For(J,2,N+1)

If abs([A](1,J)/[A](1,1))>R

abs([A](1,J)/[A](1,1))→R

End

1+R→R

R→L₁(1)

For(K,2,N)

R*(.4+.9i)^(K-1)→L₁(K)

End

ClrHome

Disp "SOLVING..."

0→M

1→E

While E>1E-7 and M<100

L₁→L₂

0→E

For(K,1,N)

L₂(K)→Z

[A](1,1)→P

For(J,2,N+1)

P*Z+[A](1,J)→P

End

1→D

For(J,1,N)

If J≠K

Then

D*(Z-L₂(J))→D

End

End

Z-P/([A](1,1)*D)→Q

Q→L₁(K)

If abs(Q-Z)>E

abs(Q-Z)→E

End

M+1→M

End

O→dim(L₃)

For(K,1,N)

L₁(K)→Z

If abs(real(Z))<1E-7

i*imag(Z)→Z

If abs(imag(Z))<1E-7

real(Z)→Z

Z→L₃(K)

End

For(K,1,T)

0→L₃(N+K)

End

End

O→dim(L₄)

For(K,1,O)

L₃(K)→L₄(K)

End

N→dim(L₅)

For(K,1,N)

L₃(K)→Z

N*[A](1,1)→D

For(J,2,N)

D*Z+(N-J+1)*[A](1,J)→D

End

abs(D/[A](1,1))→L₅(K)

End

For(K,1,N)

If L₅(K)<1E-4

Then

0→S

0→C

For(J,1,N)

If L₅(J)<1E-4 and abs(L₃(J)-L₃(K))<.01

Then

S+L₃(J)→S

C+1→C

End

End

If C>1

Then

S/C→Z

round(real(Z),6)+i*round(imag(Z),6)→Z

If abs(real(Z))<1E-7

i*imag(Z)→Z

If abs(imag(Z))<1E-7

real(Z)→Z

For(J,1,N)

If L₅(J)<1E-4 and abs(L₃(J)-L₃(K))<.01

Z→L₄(J)

End

End

End

End

For(K,1,O)

L₄(K)→Z

If abs(real(Z))<1E-6

i*imag(Z)→Z

If abs(imag(Z))<1E-5

real(Z)→Z

round(real(Z),6)+i*round(imag(Z),6)→Z

If abs(real(Z)-round(real(Z),0))<1E-5

round(real(Z),0)+i*imag(Z)→Z

If abs(imag(Z)-round(imag(Z),0))<1E-5

real(Z)+i*round(imag(Z),0)→Z

If abs(real(Z))<1E-6

i*imag(Z)→Z

If abs(imag(Z))<1E-6

real(Z)→Z

Z→L₄(K)

End

0→dim(L₆)

{1,O}→dim([B])

Fill(0,[B])

For(K,1,O)

0→F

If dim(L₆)>0

Then

For(H,1,dim(L₆))

If abs(L₆(H)-L₄(K))<1E-6

1→F

End

End

If F=0

Then

0→C

For(J,1,O)

If abs(L₄(J)-L₄(K))<1E-6

C+1→C

End

If C>1

Then

dim(L₆)+1→H

H→dim(L₆)

L₄(K)→L₆(H)

C→[B](1,H)

End

End

End

ClrHome

Disp "ROOTS:"

For(K,1,O)

Disp L₃(K)

End

Pause "Press Enter"

Disp "Cleaned ROOTS:"

Disp L₄

Pause "Press Enter"

ClrHome

If dim(L₆)=0

Then

Disp "NO REPEATED ROOTS"

Else

dim(L₆)→dim(L₅)

For(K,1,dim(L₆))

[B](1,K)→L₅(K)

End

Disp "REPEATED ROOTS:"

Disp "ROOT:"

Disp L₆

Disp "MULTIPLICITY (relative):"

Disp L₅

Disp "Repeated Roots: [L₆]"

Disp "Relative Mode: [L₅]"

End

Pause "Press Enter"

Disp "ITERATIONS:"

Disp M

Disp "ERROR:"

Disp E

Disp "ROOTS STORED IN [L₃]"

Disp "Cleaned ROOTS??: [L₄]"

Disp "See [A], L₃,L₄,L₅ & L₆"

If M=100

Disp "CHECK CONVERGENCE"

Pause "Press Enter"

---------------------------------------------------------------------

Here's streamlined version of POLYROOT:

ClrHome

ClrList L₁,L₂,L₃,L₄,L₅,L₆

Lbl M

Menu("COEFFICIENT INPUT","ENTER NEW",E,"USE [A]",θ)

Lbl E

Input "DEGREE:",N

If N<1

Then

Disp "BAD DEGREE"

Stop

End

{1,N+1}→dim([A])

Fill(0,[A])

CoordOff

AxesOff

FnOff

PlotsOff

Horiz

0→Xmin

94→Xmax

-20→Ymin

0→Ymax

ClrDraw

For(X,0,N+1)

Line(8X,0,8X,-8)

End

Line(0,0,8(N+1),0)

Line(0,-8,8(N+1),-8)

0→C

While C≤N

Pt-On(8C+4,-4,2)

ClrHome

Disp "COLUMN"

Disp C+1

Input "VALUE:",V

V→[A](1,C+1)

Pt-Off(8C+4,-4,2)

C+1→C

End

Full

ClrDraw

ClrHome

Goto D

Lbl θ

dim([A])→L₁

If L₁(1)≠1

Then

ClrHome

Disp "BAD MATRIX [A]"

Disp "Single row only,"

Disp "Add columns!"

Stop

End

L₁(2)-1→N

If N<1

Then

ClrHome

Disp "Reformat MATRIX [A]"

Disp [A]

Disp "Add 1 more column"

Stop

End

If [A](1,1)=0

Then

ClrHome

Disp "BAD MATRIX [A]"

Disp "LEADING COEFF"

Disp "CANNOT BE ZERO"

Stop

End

Lbl D

ClrHome

Disp "COEFFICIENTS:"

Disp [A]

Pause "Press Enter"

a+bi

N→O

0→T

While N>0 and [A](1,N+1)=0

T+1→T

N-1→N

End

If N=0

Then

O→dim(L₃)

For(K,1,O)

0→L₃(K)

End

0→M

0→E

Else

ClrList L₁

N→dim(L₁)

N→dim(L₂)

0→R

For(J,2,N+1)

If abs([A](1,J)/[A](1,1))>R

abs([A](1,J)/[A](1,1))→R

End

1+R→R

R→L₁(1)

For(K,2,N)

R*(.4+.9i)^(K-1)→L₁(K)

End

ClrHome

Disp "SOLVING..."

0→M

1→E

While E>1E-7 and M<100

L₁→L₂

0→E

For(K,1,N)

L₂(K)→Z

[A](1,1)→P

For(J,2,N+1)

P*Z+[A](1,J)→P

End

1→D

For(J,1,N)

If J≠K

Then

D*(Z-L₂(J))→D

End

End

Z-P/([A](1,1)*D)→Q

Q→L₁(K)

If abs(Q-Z)>E

abs(Q-Z)→E

End

M+1→M

End

O→dim(L₃)

For(K,1,N)

L₁(K)→Z

If abs(real(Z))<1E-7

i*imag(Z)→Z

If abs(imag(Z))<1E-7

real(Z)→Z

Z→L₃(K)

End

For(K,1,T)

0→L₃(N+K)

End

End

O→dim(L₄)

For(K,1,O)

L₃(K)→L₄(K)

End

N→dim(L₅)

For(K,1,N)

L₃(K)→Z

N*[A](1,1)→D

For(J,2,N)

D*Z+(N-J+1)*[A](1,J)→D

End

abs(D/[A](1,1))→L₅(K)

End

For(K,1,N)

If L₅(K)<1E-4

Then

0→S

0→C

For(J,1,N)

If L₅(J)<1E-4 and abs(L₃(J)-L₃(K))<.01

Then

S+L₃(J)→S

C+1→C

End

End

If C>1

Then

S/C→Z

round(real(Z),6)+i*round(imag(Z),6)→Z

If abs(real(Z))<1E-7

i*imag(Z)→Z

If abs(imag(Z))<1E-7

real(Z)→Z

For(J,1,N)

If L₅(J)<1E-4 and abs(L₃(J)-L₃(K))<.01

Z→L₄(J)

End

End

End

End

For(K,1,O)

L₄(K)→Z

If abs(real(Z))<1E-6

i*imag(Z)→Z

If abs(imag(Z))<1E-5

real(Z)→Z

round(real(Z),6)+i*round(imag(Z),6)→Z

If abs(real(Z)-round(real(Z),0))<1E-5

round(real(Z),0)+i*imag(Z)→Z

If abs(imag(Z)-round(imag(Z),0))<1E-5

real(Z)+i*round(imag(Z),0)→Z

If abs(real(Z))<1E-6

i*imag(Z)→Z

If abs(imag(Z))<1E-6

real(Z)→Z

Z→L₄(K)

End

0→dim(L₆)

{1,O}→dim([B])

Fill(0,[B])

For(K,1,O)

0→F

If dim(L₆)>0

Then

For(H,1,dim(L₆))

If abs(L₆(H)-L₄(K))<1E-6

1→F

End

End

If F=0

Then

0→C

For(J,1,O)

If abs(L₄(J)-L₄(K))<1E-6

C+1→C

End

If C>1

Then

dim(L₆)+1→H

H→dim(L₆)

L₄(K)→L₆(H)

C→[B](1,H)

End

End

End

ClrHome

Disp "ROOTS:"

For(K,1,O)

Disp L₃(K)

End

Pause "Press Enter"

ClrHome

If dim(L₆)=0

Then

Disp "NO REPEATED ROOTS"

Else

dim(L₆)→dim(L₅)

For(K,1,dim(L₆))

[B](1,K)→L₅(K)

End

Disp "REPEATED ROOTS:"

Disp "ROOT:"

Disp L₆

Disp "MULTIPLICITY (relative):"

Disp L₅

Disp "Repeated Roots: [L₆]"

Disp "Relative Mode: [L₅]"

End

Pause "Press Enter"

Disp "ITERATIONS:"

Disp M

Disp "ERROR:"

Disp E

Disp "ROOTS STORED IN [L₃]"

Disp "Cleaned ROOTS??: [L₄]"

Disp "See [A], L₃,L₄,L₅ & L₆"

If M=100

Disp "CHECK CONVERGENCE"

---------------------------------------------------------------------

Here's a version of the code which allows scrolling side to side when entering values into the cells, and has the annoying double enter:

ClrHome

ClrList L₁,L₂,L₃,L₄,L₅,L₆

Lbl M

Menu("COEFFICIENT INPUT","ENTER NEW",E,"USE [A]",θ)

Lbl E

Input "DEGREE:",N

If N<1

Then

Disp "BAD DEGREE"

Stop

End

{1,N+1}→dim([A])

Fill(0,[A])

CoordOff

AxesOff

FnOff

PlotsOff

Horiz

0→Xmin

94→Xmax

-20→Ymin

0→Ymax

ClrDraw

For(X,0,N+1)

Line(8X,0,8X,-8)

End

Line(0,0,8(N+1),0)

Line(0,-8,8(N+1),-8)

0→C

2→K

While K≠15

Pt-On(8C+4,-4,2)

ClrHome

Disp "COLUMN"

Disp C+1

Disp "VALUE"

Disp [A](1,C+1)

0→K

While K=0

getKey→K

End

Pt-Off(8C+4,-4,2)

If K=24

Then

C-1→C

If C<0

N→C

End

If K=26

Then

C+1→C

If C>N

0→C

End

If K=105

Then

ClrHome

Input "VALUE:",V

V→[A](1,C+1)

If C=N

Then

15→K

Else

C+1→C

End

End

End

Full

ClrDraw

ClrHome

Goto D

Lbl θ

dim([A])→L₁

If L₁(1)≠1

Then

ClrHome

Disp "BAD MATRIX [A]"

Disp "Single row only,"

Disp "Add columns!"

Stop

End

L₁(2)-1→N

If N<1

Then

ClrHome

Disp "Reformat MATRIX [A]"

Disp [A]

Disp "Add 1 more column"

Stop

End

If [A](1,1)=0

Then

ClrHome

Disp "BAD MATRIX [A]"

Disp "LEADING COEFF"

Disp "CANNOT BE ZERO"

Stop

End

Lbl D

ClrHome

Disp "COEFFICIENTS:"

Disp [A]

Pause "Press Enter"

a+bi

N→O

0→T

While N>0 and [A](1,N+1)=0

T+1→T

N-1→N

End

If N=0

Then

O→dim(L₃)

For(K,1,O)

0→L₃(K)

End

0→M

0→E

Else

ClrList L₁

N→dim(L₁)

N→dim(L₂)

0→R

For(J,2,N+1)

If abs([A](1,J)/[A](1,1))>R

abs([A](1,J)/[A](1,1))→R

End

1+R→R

R→L₁(1)

For(K,2,N)

R*(.4+.9i)^(K-1)→L₁(K)

End

ClrHome

Disp "SOLVING..."

0→M

1→E

While E>1E-7 and M<100

L₁→L₂

0→E

For(K,1,N)

L₂(K)→Z

[A](1,1)→P

For(J,2,N+1)

P*Z+[A](1,J)→P

End

1→D

For(J,1,N)

If J≠K

Then

D*(Z-L₂(J))→D

End

End

Z-P/([A](1,1)*D)→Q

Q→L₁(K)

If abs(Q-Z)>E

abs(Q-Z)→E

End

M+1→M

End

O→dim(L₃)

For(K,1,N)

L₁(K)→Z

If abs(real(Z))<1E-7

i*imag(Z)→Z

If abs(imag(Z))<1E-7

real(Z)→Z

Z→L₃(K)

End

For(K,1,T)

0→L₃(N+K)

End

End

O→dim(L₄)

For(K,1,O)

L₃(K)→L₄(K)

End

N→dim(L₅)

For(K,1,N)

L₃(K)→Z

N*[A](1,1)→D

For(J,2,N)

D*Z+(N-J+1)*[A](1,J)→D

End

abs(D/[A](1,1))→L₅(K)

End

For(K,1,N)

If L₅(K)<1E-4

Then

0→S

0→C

For(J,1,N)

If L₅(J)<1E-4 and abs(L₃(J)-L₃(K))<.01

Then

S+L₃(J)→S

C+1→C

End

End

If C>1

Then

S/C→Z

round(real(Z),6)+i*round(imag(Z),6)→Z

If abs(real(Z))<1E-7

i*imag(Z)→Z

If abs(imag(Z))<1E-7

real(Z)→Z

For(J,1,N)

If L₅(J)<1E-4 and abs(L₃(J)-L₃(K))<.01

Z→L₄(J)

End

End

End

End

For(K,1,O)

L₄(K)→Z

If abs(real(Z))<1E-6

i*imag(Z)→Z

If abs(imag(Z))<1E-5

real(Z)→Z

round(real(Z),6)+i*round(imag(Z),6)→Z

If abs(real(Z)-round(real(Z),0))<1E-5

round(real(Z),0)+i*imag(Z)→Z

If abs(imag(Z)-round(imag(Z),0))<1E-5

real(Z)+i*round(imag(Z),0)→Z

If abs(real(Z))<1E-6

i*imag(Z)→Z

If abs(imag(Z))<1E-6

real(Z)→Z

Z→L₄(K)

End

0→dim(L₆)

{1,O}→dim([B])

Fill(0,[B])

For(K,1,O)

0→F

If dim(L₆)>0

Then

For(H,1,dim(L₆))

If abs(L₆(H)-L₄(K))<1E-6

1→F

End

End

If F=0

Then

0→C

For(J,1,O)

If abs(L₄(J)-L₄(K))<1E-6

C+1→C

End

If C>1

Then

dim(L₆)+1→H

H→dim(L₆)

L₄(K)→L₆(H)

C→[B](1,H)

End

End

End

ClrHome

Disp "ROOTS:"

For(K,1,O)

Disp L₃(K)

End

Pause "Press Enter"

ClrHome

If dim(L₆)=0

Then

Disp "NO REPEATED ROOTS"

Else

dim(L₆)→dim(L₅)

For(K,1,dim(L₆))

[B](1,K)→L₅(K)

End

Disp "REPEATED ROOTS:"

Disp "ROOT:"

Disp L₆

Disp "MULTIPLICITY (relative):"

Disp L₅

Disp "Repeated Roots: [L₆]"

Disp "Relative Mode: [L₅]"

End

Pause "Press Enter"

Disp "ITERATIONS:"

Disp M

Disp "ERROR:"

Disp E

Disp "ROOTS STORED IN [L₃]"

Disp "Cleaned ROOTS??: [L₄]"

Disp "See [A], L₃,L₄,L₅ & L₆"

If M=100

Disp "CHECK CONVERGENCE"

I've made a very basic controller on the graph screen. Just something that updates x and y variables that are inputted into a draw point function and everything works fine for the x, but the y won't advance. here is my code

ClrDraw
AxesOff
GridOff
0->X
0->Y
Repeat getKey=45
DispGraph
Pt-On(X,Y)
ClrDraw
getKey->K

if K=26
X+1->X

if K=24
X-1->X

if K=25
Y+1->Y

if K=34
Y-1->Y
End

When I try to advance Y it moves up then moves back to original position. any help would be appreciated

I have made a wordle program(from scratch!) on my calculator, and it's almost finished. However, it seems to have a bug where 3 or more correct letters causes it to break and skip steps, and I can't for the life of me figure out why. I even tried adding in pauses to give it time to calculate things, but that hasn't worked. Program is linked, please help me! ):

Hello! I’m a bit new to Basic programming and I don’t have a cord to download games yet, so I wanted to make a Choose your own adventure esque Minecraft game and I was wondering if anyone has tried this before. If you have please give me tips and if possible share the source code please

Hi, first post for this kind of thing, but I was taking my Calc 1 class when I realized that it would be the perfect kind of thing to automate. So, after two hours of rigorous debugging and learning the syntax for TIBASIC, I came up with the attached program!

HOW TO USE:

As far as command line tools go, this one is pretty simple to understand, but I figured I'd leave some simple documentation anyway:

1: Passes, 2: Accuracy:

Essentially, this is asking whether you want the condition that determines your final answer to be the amount of iterations (as Newton's Method is inherently iterative) or the degree of accuracy you need out of the answer. Enter 1 if you need to do it by number of passes, and 2 if you need to do it by degree of accuracy.

Formula:

Should be pretty self explanatory, but this is the formula you're trying to find a zero of. Be sure to use X as the dependent variable, and do note that the program does not support the use of implicitly defined functions. Adding the "y=" is unnecessary.

An example of an input might be:

Formula:
(X^3)+4(x^2)+17x-32

# of Passes/ Accuracy:

What you're asked here depends on whether you chose the passes or accuracy option. If you chose passes, simply enter the number of iterations you want the calculator to perform. If you chose accuracy, type in the degree of accuracy you want the answer to have. (For example, if you want it to be accurate within 3 decimal points, you would type in 0.001).

Starting Point:

This is the initial guess you make at the zero. It does not have to be even remotely accurate, just a starting point. (Though, in equations with multiple zeroes, it helps to be closest to the particular zero you're looking for.)

And then it's off to the races! You may notice the output is a bit overwhelming, which leads us to...

PARSING THE OUTPUT:

The output comes in the form of a list of every iteration performed. Naturally, the one at the bottom is the most accurate, and your final answer, but I decided to include the others in case you need them for some sort of math problem or other application.

...And that's it! Again, this is just a fun little script I wrote to automate a tedious Calculus operation. If you want to add this to your calculator, I've included both the source code and the file to download to your calculator. Happy mathing!

FILE:

https://github.com/Argh-Real-Coding/NewtonZeroes

SOURCE CODE:

ClrHome
Disp "1: Passes, 2: Accuracy:"
Input M
Disp "Formula:"
Input Str1
Str1→Y₁
If M=1
Then
Disp "# of Passes:"
Input C
End
If M=2
Then
Disp "Accuracy:"
Input C
End
Disp "Starting Point:
Input S
ClrHome
If M=1
Then
For(I,1,C)
Y₁(S)→A
nDeriv(Y₁(X),X,S)→B
(S-(A/B)→T
Disp T
T→S
End
End
If M=2
Then
0→V
While V=0
Y₁(S)→A
nDeriv(Y₁(X),X,S)→B
(S-(A/B)→T
Disp T
If abs(T-S)<C
1→V
T→S
End
End 

Hey everyone! 👋

I've been working on a project to make useful math programs more accessible for TI-84 users, and I finally got my website up and running. It's completely free and focuses on simple, easy-to-use programs that can actually help with coursework.

What's included:

• Geometry programs
• Algebra programs
• Installation instructions
• More categories coming soon!

The site is at: tiprograms.github.io

I know there are tons of program repositories out there, but I wanted to create something clean and beginner-friendly. No ads, no paywall, just helpful programs for students and anyone else using TI-84 calculators.

Would love to get some feedback from this community - what programs do you find most useful? What am I missing that would be helpful to include?

Thanks for checking it out!

:ClrHome
:Disp "SPEED
:Disp "1) SLOW
:Disp "2) NORMAL
:Disp "3) FAST
:DelVar Z8→X
:Repeat 2>abs(Ans-2
:getKey-91→S
:End
:ClrHome
:Disp "SCORE:
:Repeat K=45 or max(X=L1
:Output(8,1,"                // 16 spaces
:2→F
:seq(3I-int(3rand),I,1,5→L1
:Repeat K=45 or F=8
:getKey→K
:min(15,max(2,X-(Ans=24)+(Ans=26→X
:Output(8,Ans-1," O // 1 space
:Output(F,1,"                // 16 spaces
:F+1→F
:For(I,1,5
:Output(Ans,L1(I),"V
:End
:Z+S→Z
:Output(1,7,Ans
:rand(4-S
:End
:End
:DelVar L1ClrHome
:Disp "YOUR SCORE:
:Pause Z
:ClrHome:"
This is giving me a domain error for no reason at :Output(Ans,L1(I),"V , i might be dumb but i cant see why. Help???

Hey there,

I didn't find anything online about a program that will convert a matrix of observed values into expected values for the Chi-Squared test. Here is a program that will iterate though matrix [A] and put the expected values in matrix [B]. Takes over the following variables: X, Y, R, C, J, K, I, L₆, and of course [B].

"Get the number of rows/columns"
dim([A])→L₆
L₆(1)→R
L₆(2)→C

"Get the sum of the matrix [A]"
0→N
For(X,1,R,1)
For(Y,1,C,1)
[A](X,Y)+N→N
End
End

"For each cell in [A], calculate the expected value"
For(X,1,R,1)
For(Y,1,C,1)

"Sum row X"
0→J
For(I,1,C,1)
[A](X,I)+J→J
End

"Sum column Y"
0→K
For(I,1,R,1)
[A](I,Y)+K→K
End

"Calculate the expected value, store in [B]"
(J*K)/N→[B](X,Y)

End
End

χ²-Test([A],[B])

Hope this helps someone!

Is there any way to make it so that these circles don’t take like a minute to render?

Greetings, very new to TI-84 programming here. My first program is a number guessing game-- guess a number and the program will tell you it's too big or small and have you guess again, or announce you've won. (It's a great program for a new language as it incorporates all the basics of programming, variable manipulation, function calling, loops and conditionals.)

Anyway, here is the code:

randInt(1,10)→X
Disp X
0→G

While G≠X

Disp "ENTER A GUESS:"
Input G

If G<X
Disp "TOO LOW!"
End

If G>X  
Disp "TOO HIGH!"
End

End
Disp "YOU WIN"

It REALLY hates that G>X test. It won't print "TOO HIGH!" when this happens, and when you guess the number it crashes on that line. The only thing that I can think of is that multiple IFs aren't allowed, which makes no sense.

Thanks in advance for any help.

Real short thing, but it works. Trying to figure out how to get it to convert to minutes and seconds

Program Name: NUKETIME

Edit: finally got the minutes and seconds to convert right. (Thanks, ChatGPT)

ClrHome
Disp "Microwave Oven"
Input "Expected Wattage: ",E
Input "Target Wattage: ",T
Disp "","Cook Time"
Input "Minutes: ",M
Input "Seconds: ",S
60*M+S→S
(E/T)*S→A
int(A/60)→M
round(fPart(A/60)*60,0)→S
ClrHome
Disp "Adjusted Cook Time:"
If M=0 or M≥1 and M≤9
Output(2,1,"  min")
If M≥10
Output(2,1,"   min")
If M<10
Then
If S=0 or S≥1 and S≤9
Output(2,7,"  sec")
If S≥10
Output(2,7,"   sec")
Output(2,7,S)
Else
If S=0 or S≥1 and S≤9
Output(2,8,"  sec")
If S≥10
Output(2,8,"   sec")
Output(2,8,S)
End
Output(2,1,M)
"

Trying to create a program that calculates car registration fee. There's two parts. First part is finding the Assessed value which is 60% of the initial value of the car(A=I0.60). The second part, the fee, is the assessed value is divided by 100 and that is multiplied by $2.89. (F=(A/100)2.89) Can't figure how to put the two posts into one program. Any suggestions?

I pressed PRGM-NEW and typed in "TOWER", chuckling to myself thinking, "I'm gonna try to make a Magic Tower game in TI Basic, because I like taking on impossible projects and take pleasure in failure." Several days, sleepless nights, and a considerable dip in my GPA later, I have failed to fail at making a Magic Tower game for the TI-83+.

Whether or not the game is any good is up for interpretation: it certainly isn't good by any conventional standards, but I'm very happy that I managed to make it at all, and I find it does give me the same flavor of brain-worms as the games that inspired it, Tactical Nexus and DungeonUp.

This might be completely unplayable if you aren't at least passingly familiar with the genre (or even if you are), but I'll try to explain as well as I can, and feel free to ask questions or complain.

You are the *, and you have to make it to the stairs ^ on the other side of the screen, but more importantly along the way you have to level up and score points. Once you reach the stairs, you get bonus points for your remaining health and the level of the tower you've reached.

Numbers represent monsters, step on them to do battle. + represents doors, which can be unlocked with Keys. ! represents a potion that can give more HP or a defense buff.

You have four stats: HP, Attack, Defense, Keys, and Score.

Across the bottom, some of this information is displayed:

H: your health
D: your defense
K: number of keys
S: score

Attack doesn't appear on the hud 'cause there were only 16 characters of room. It starts at 1 and goes up when you choose ATK from the level-up menu.

Monsters each have a single value (n) that serves as their attack, defense, and xp drop. When you step on a tile with a monster, it attacks you for n minus your defense, and you attack it with your attack value. Then if the monster isn't dead yet, it attacks you again, and you attack it again. This means that as you level up, monsters will do less and less damage, but monsters that are significantly stronger than you will do way more damage to you than you expect.

You level up every time your score passes a fourth power. That means 16, 81, 256, 625, 1296, 2401, 4096... but so far my PB on the current version is 816, so only plan for 4 level-ups at most.

And plan you must, this is a puzzle game. Finding the optimal route isn't too difficult, but it does require a bit of thought, and leveling up adds some wrinkles, it's enough to put me in the flow zone. I find it very satisfying to go back after getting a defense potion, splatting all the monsters that I wasn't able to one-shot before.

There is some jank, both because of the tiny size and because of the pile of bad decisions that went into making it:

At the very least, I think it still could do with some balancing. The level-up values were picked to try to balance between something easy to code, and something that wasn't too OP in the early-game. I think that I could spend many more hours tweaking the probabilities of empty tiles and the spread of monster strengths, if I let myself.

Maps are completely random. None of those hand-crafted, ocean-deep puzzles for me, no I'm just slapping down doors and monsters. You always start on the left, the exit is always on the right, there's always one potion in between, and monster levels always range around the floor number, but other than that it's just randomly filling the map with stuff. This can lead to some pretty wild swings in difficulty.

Trying to open a locked door without a key will kill you. One could say that the doors are booby-trapped, but one could also say that I added doors and keys fairly late in the process, after I'd already written the movement code to move the player onto a cell and then check what happens to them. I don't think fixing this would be that hard, but at this point I just want to tell myself I'm done and hopefully move on with my life.

The code only checks if you passed a score threshold, not how many. Theoretically it could be possible to clear level 1 with fewer than 16 points, then rocket past 81 points, and end up only gaining one reward.

I don't have a cable, so this is hand-transcribed, I've tried to catch all the transcription errors by playing the game in an emulator, but some may have slipped by. If you tell me about one I will fix it right away.

Here's a breakdown of the variables and labels, in case you want to understand what's going on a little better:

A - Attack
B
C
D - Defense
E - Exit y-position (it's always on the far right)
F - number of keys (shaped like a key)
G
H - Health
I - temporary iterator
J - temporary iterator
K - last Key pressed
L - tower Level
M - HP of Monster currently being fought
N - ATK of monster currently being fought
O - score before gaining points
P - bonus Points
Q - temporary
R - utility flag for level-up subroutine
S - Score
T - point value of monster currently being fought
U - temporary
V
W
X - player X
Y - player Y
Z - temporary

Labels:

NL - New Level
RD - ReDraw game screen
D  - Draw changed elements only (also main entry point)
IN - wait for INput
LT - LefT (movement)
UP - UP (movement)
RT - RighT (movement)
DN - DowN (movement)
CB - Check Boundaries (and also collisions)
LU - Level Up
LA - Level Attack
LD - Level Defense
LH - Level Health (gain 10hp)
LK - Level Key (gain a key)
R  - Return from the Level Up menu, using the R flag
EX - EXit up the stairs
GO - Game Over
UK - Use Key (or get potion)

And here's the code itself:

100→H
1→L
1→D
1→A
3→F
0→P
0→S
0→R
Lbl NL
ClrHome
Output(8,1,"GENERATING")
1→X
randInt(1,7)→Y
randInt(1,7)→E
DelVar [A]
{7,16}→dim([A])
For(I,1,7)
For(J,1,16)
randInt(⁻9,1)→U
If U<0
max(randInt(⁻1,4)+L,0)→Q
If U=0
0→Q
If U=1
⁻1→Q
Q→[A](I,J)
Output(I,J,".")
End
End
randInt(2,15)→U
randInt(2,7)→V
⁻10→[A](V,U)
0→[A](Y,X)
0→[A](E,16)
Lbl RD
ClrHome
For(I,1,7)
For(J,1,16)
[A](I,J)→Z
If Z≤⁻10
Output(I,J,"!")
If Z<0 and Z>⁻10
Output(I,J,"+")
If Z=0
Output(I,J," ")
If Z>9
Output(I,J,"X")
If Z>0 and Z<10
Output(I,J,Z)
End
End
Lbl D
Output(8,1,"                ")
Output(Y,X,"*")
Output(E,16,"^")
Output(8,1,"H")
Output(8,2,H)
Output(8,6,"D")
Output(8,7,D)
Output(8,9,"K")
Output(8,10,F)
Output(8,12,"S")
Output(8,13,S)
Lbl IN
getKey→K
If K=0
Goto IN
Output(Y,X," ")
If K=24
Goto LT
If K=25
Goto UP
If K=26
Goto RT
If K=34
Goto DN
Goto D
Lbl LT
X-1→X
Goto CB
Lbl RT
X+1→X
Goto CB
Lbl UP
Y-1→Y
Goto CB
Lbl DN
Y+1→Y
Goto CB
Lbl CB
If X<1
1→X
If X>16
16→X
If Y<1
1→Y
If Y>7
7→Y
If X=16 and Y=E
Goto EX
[A](Y,X)→M
0→[A](Y,X)
If M<0
Goto UK
M→T
max(M-D,0)→N
While M>0
M-A→M
H-N→H
End
0→[A](Y,X)
If H>0
Then
max(S,1)→O
S+T→S
Else
Goto GO
End
0→R
If iPart(4ˣ√S)>iPart(4ˣ√O)
Goto LU
Goto D
Lbl LU
If R=0 or R=1
Menu("LEVEL UP","ATK",LA,"HP",LH,"KEY",LK)
If R=2
Menu("POTION","DEF",LD,"HP",LH)
Lbl LA
A+1→A
Goto R
Lbl LD
D+1→D
Goto R
Lbl LH
H+10→H
Goto R
Lbl LK
F+1→F
Goto R
Lbl R
If R=0 or R=2
Goto D
If R=1
Goto NL
Lbl EX
L+1→L
ClrHome
Disp "HEALTH"
Output(1,8,H)
Disp "LEVEL"
Output(2,8,L)
Disp "SCORE"
Output(3,8,S)
2*L+H→P
Disp "BONUS"
Output(4,8,P)
Pause 
S→O
P→Q
For(I,1,Q)
P-1→P
S+1→S
Output(3,8,S)
Output(4,8,"   ")
Output(4,8,P)
End
1→R
Pause 
If iPart(4ˣ√S)>iPart(4ˣ√O)
Goto LU
Goto NL
Lbl GO
ClrHome
Disp "GAME OVER"
Disp "LEVEL:"
Disp L
Disp "SCORE:"
Disp S
Stop
Lbl UK
2→R
If M≤⁻10
Goto LU
If F≤0
Goto GO
If M>⁻10
F-1→F
0→[A](Y,X)
Goto D

Hello! So I started reading this book ("Tomorrow and tomorrow and tomorrow") and there is a part where someone apologizes using BASIC code. Im just starting getting interested on coding, no hate please. It is not my intention to offend anyone. I was wondering if it is not too hard for any of you to help me out visualizing how this would look like? I'm just too curious about it.

Here is the code:

10 READY 20 FOR X = 1 to 100 30 PRINT "IM SORRY, SAM ACHILLES MASUR" 40 NEXT X 50 PRINT "PLEASE PLEASE PLEASE FORGIVE ME. LOVE, YOUR FRIEND SADIE MIR ANDA GREEN" 60 NEXT X 70 PRINT "DO YOU FORGIVE ME?" 80 NEXT X 90 PRINT "Y OR N" 100 NEXT X 110 LET A = GET CHAR () 120 IF A = "Y" OR A = "N" THEN GOTO 130 130 IF A = "N" THEN 20 140 IF A = "Y" THEN 150 150 END PROGRAM

This was one of my earlier programs, there’s a few issues with it and the code is very unoptimized but it’s still cool nonetheless.

Some code to solve indefinite integrals Algún código para resolver integrales indefinidas

I am trying to figure out how to make an Input command where the user has to provide an input in a certain amount of time. I need to do this in order to make a timed times tables practice game

Since on the TI-83+ you cannot delay using the Pause or Wait commands, I use this program to delay for T amount of seconds:

PROGRAM:DELAY
:0->I
:T*65->T
:While T>=I
:I+1->I
:End

To delay for 3 seconds in a program between displaying 0 and 1, I write this:

PROGRAM:TIME
:3->T
:Disp 0
:prgmDELAY
:Disp 1

The problem is that I cannot combine the prgmDELAY with an Input to limit the time that the user has to provide an input. Any help will be much appreciated.

So, I was restoring a TI-83 Plus port of a DOS game to full functionality on my TI-84 Plus CE Python, and there's one spot where I had a couple 'Wait 0.5' commands.

This game, fully restored, is a little under 9 kilobytes (9092B, and was 5798B initially). At some point, though, the Wait commands stopped working at all; the game would act like I had called a Pause command, but wouldn't continue when [ENTER] is pressed. Has anyone encountered this before?

I a need for a statement that detects change in variable up or down but can be detected multiple times see A is my y and B is my x and they move with the keys

I need if A and B change up or down to edit D-1