Archives: All files
Currently viewing:
  1. Archives
  2. All files

Categories

Available subcategories:

Files

  1. Update: Fixed a bug in ADDMULT1. It uses Euclid’s algorithm, instead of CFRAC, which is used in ADDMULT. These programs are built on the fact that second degree equations with rational roots can be solved by dividing the coefficients in Ax^2+Bx+C=0, with A, and then select a pair of divisors in C/A that multiply to C/A and add up to B/A, then it follows that those divisors are the (rational) roots of the equation. The condition for that is of course that the root of the Discriminant is rational, as well as the coefficients. The programs are therefore showing the Discriminant and its root, as well as B/A and C/A for your convenience.

    Categorized under:
  2. Modified Version of BasicTH's SolitiCE Program.

    This Modified Version of Solitaire Will Include New Features & a Modified Menu

    This is Version 1 & Only Includes the Renaming of Items in The Main Menu

    Categorized under:
  3. Update: Fixed a bug in ADDMULT1. It uses Euclid’s algorithm, instead of CFRAC, which is used in ADDMULT. These programs are built on the fact that second degree equations with rational roots can be solved by dividing the coefficients in Ax^2+Bx+C=0, with A, and then select a pair of divisors in C/A that multiply to C/A and add up to B/A, then it follows that those divisors are the (rational) roots of the equation. The condition for that is of course that the root of the Discriminant is rational, as well as the coefficients. The programs are therefore showing the Discriminant and its root, as well as B/A and C/A for your convenience.

    Categorized under:
  4. Update: Fixed a bug in ADDMULT1. It uses Euclid’s algorithm, instead of CFRAC, which is used in ADDMULT. These programs are built on the fact that second degree equations with rational roots can be solved by dividing the coefficients in Ax^2+Bx+C=0, with A, and then select a pair of divisors in C/A that multiply to C/A and add up to B/A, then it follows that those divisors are the (rational) roots of the equation. The condition for that is of course that the root of the Discriminant is rational, as well as the coefficients. The programs are therefore showing the Discriminant and its root, as well as B/A and C/A for your convenience.

    Categorized under:
  5. Update: Fixed a bug in ADDMULT1. It uses Euclid’s algorithm, instead of CFRAC, which is used in ADDMULT. These programs are built on the fact that second degree equations with rational roots can be solved by dividing the coefficients in Ax^2+Bx+C=0, with A, and then select a pair of divisors in C/A that multiply to C/A and add up to B/A, then it follows that those divisors are the (rational) roots of the equation. The condition for that is of course that the root of the Discriminant is rational, as well as the coefficients. The programs are therefore showing the Discriminant and its root, as well as B/A and C/A for your convenience.

    Categorized under:
  6. Update: Fixed a bug in ADDMULT1. It uses Euclid’s algorithm, instead of CFRAC, which is used in ADDMULT. These programs are built on the fact that second degree equations with rational roots can be solved by dividing the coefficients in Ax^2+Bx+C=0, with A, and then select a pair of divisors in C/A that multiply to C/A and add up to B/A, then it follows that those divisors are the (rational) roots of the equation. The condition for that is of course that the root of the Discriminant is rational, as well as the coefficients. The programs are therefore showing the Discriminant and its root, as well as B/A and C/A for your convenience.

    Categorized under:
  7. This is a variant of solitaire based on that in the Zachtronics game *Last Call BBS*. The game is played by stacking matching cards on top of each other. Stacks of matching cards may be moved as a unit. By stacking all four of a set of matching cards directly on the table (i.e. with no other cards on top of them), they are collapsed into an immovable unit. There are also four free cells, though three start locked and are only unlocked one by one as sets of cards are collapsed on the tableau. The game is won when all cards are collapsed.

    Categorized under:
  8. it is a D20 for the ti84+ce

    Categorized under:
  9. This is a variant of solitaire based on that in the Zachtronics game *Last Call BBS*. The game is played by stacking matching cards on top of each other. Stacks of matching cards may be moved as a unit. By stacking all four of a set of matching cards directly on the table (i.e. with no other cards on top of them), they are collapsed into an immovable unit. There are also four free cells, though three start locked and are only unlocked one by one as sets of cards are collapsed on the tableau. The game is won when all cards are collapsed.

    Categorized under:
  10. Update: This program is an experiment, but it is very fast compared to SOLVERY, for most polynomials, and also gives you the integer second degree factors, wether their roots are real or imaginary. Instead of going about to analytically test for second degree factors, it tries to conclude which factor is right by ”looking” at the resulting polynomial and the error list. This version has 608 bytes more than SOLVERY, and fixes several bugs in the previous version. I hope to get some response from you, wether you find it ok or not. Is it worth the extra bytes?

    Categorized under:
  11. This is a game I made way back in November 2023 and it will be updates every now and then. Zip through a random terrain at high speeds, just barely dodging the many obstacles. You can play however you would like because there are many different paths to victory. Try it out for yourself, and see how high your score can get!

    Categorized under:
  12. This is a variant of solitaire based on that in the Zachtronics game *Last Call BBS*. The game is played by stacking matching cards on top of each other. Stacks of matching cards may be moved as a unit. By stacking all four of a set of matching cards directly on the table (i.e. with no other cards on top of them), they are collapsed into an immovable unit. There are also four free cells, though three start locked and are only unlocked one by one as sets of cards are collapsed on the tableau. The game is won when all cards are collapsed.

    Categorized under:
  13. This is a game I made way back in November 2023 and it will be updates every now and then. Zip through a random terrain at high speeds, just barely dodging the many obstacles. You can play however you would like because there are many different paths to victory. Try it out for yourself, and see how high your score can get!

    Categorized under:
  14. Update: This program is an experiment, but it is very fast compared to SOLVERY, for most polynomials, and also gives you the integer second degree factors, wether their roots are real or imaginary. Instead of going about to analytically test for second degree factors, it tries to conclude which factor is right by ”looking” at the resulting polynomial and the error list. This version has 608 bytes more than SOLVERY, and fixes several bugs in the previous version. I hope to get some response from you, wether you find it ok or not. Is it worth the extra bytes?

    Categorized under:
  15. Update: This program is an experiment, but it is very fast compared to SOLVERY, for most polynomials, and also gives you the integer second degree factors, wether their roots are real or imaginary. Instead of going about to analytically test for second degree factors, it tries to conclude which factor is right by ”looking” at the resulting polynomial and the error list. This version has 608 bytes more than SOLVERY, and fixes several bugs in the previous version. I hope to get some response from you, wether you find it ok or not. Is it worth the extra bytes?

    Categorized under:
  16. This is a TI-BASIC utility to simulate stacks and queues using lists.
    Should work on the monochrome models, but I don't have a ROM or emulator to test this on.

    Categorized under:
  17. Update: This program is an experiment, but it is very fast compared to SOLVERY, for most polynomials, and also gives you the integer second degree factors, wether their roots are real or imaginary. Instead of going about to analytically test for second degree factors, it tries to conclude which factor is right by ”looking” at the resulting polynomial and the error list. This version has 608 bytes more than SOLVERY, and fixes several bugs in the previous version. I hope to get some response from you, wether you find it ok or not. Is it worth the extra bytes?

    Categorized under:
  18. Update: This program is an experiment, but it is very fast compared to SOLVERY, for most polynomials, and also gives you the integer second degree factors, wether their roots are real or imaginary. Instead of going about to analytically test for second degree factors, it tries to conclude which factor is right by ”looking” at the resulting polynomial and the error list. This version has 608 bytes more than SOLVERY, and fixes several bugs in the previous version. I hope to get some response from you, wether you find it ok or not. Is it worth the extra bytes?

    Categorized under:
  19. This program features support for all parts of reading formulas...

    1. Subscripts
    2. Parentheses
    3. Long element names
    4. Those numbers that are used to balance equations
    5. Up to 16 individual elements in one formula

    The controls are a bit confusing, but they are listed in the readme and below.

    [2nd] - Uppercase
    [Alpha] - Lowercase
    [Y=] - Numbers and Parentheses

    Categorized under:
  20. This is (as the name implies) a plane simulator.
    It's basically that.
    The game is written in TI-BASIC, for the two following calculators:
    TI-84 Plus CE
    TI-84 Plus C Silver Edition

    PLEASE NOTE THAT THIS IS STILL UNFINISHED, AND THE ACTUAL MAIN GAME ISN'T DONE YET.

    Categorized under:
  21. This is a recreation of Hangman, the classic
    word-guessing game, for the TI-84 Plus CE!

    The goal is to find what the word is, based
    on the letters you already know.

    You can only make 6 mistakes, or you will
    lose.

    Categorized under:
  22. First Fantasy is one of the first RPG ever released for the TI-84 Plus C Silver Edition and the first ever one for the TI-84 Plus CE and TI-83 Premium CE! The CSE version uses Doors CSE 8.1 libraries to enhance TI-BASIC language, while the CE version uses CE Textlib and a custom font. This very loose remake of Mana Force for the 83+ brings enhanced graphics, new magic spells and enemies, new cutscenes, expanded storyline and many new challenges. There are 16 magic spells available, 7 character classes, 8 dungeons (12 in the CE version), 49 monsters (77 in the CE version) and several hours of gameplay. If you are a fan of Square-Enix Japanese role-playing games such as Final Fantasy, then you should try it!

    Categorized under:
  23. First Fantasy II: Pokéwalrus is one of the largest TI-84 Plus CE and TI-83 Premium CE calculator game available. It is a RPG inspired by the Pokémon, The Reign of Legends and Illusiat series and serves as an indirect sequel to Darkblasters for the TI-83 Plus and TI-84 Plus monochrome calculators and First Fantasy: Mana Force for the TI-84
    Plus C Silver Edition, TI-83 Premium CE and TI-84 Plus CE (Python models included). Set over 1000 years past two apocalypses, you live in a world where almost everything is a walrus due to radioactive fallout causing widespread mutations over time. Walruses in this world battles as many species for fame and it is now your day. However, a threat also seems nearby and it is possible that the future of this world lies in your hands.

    There are 15 dungeons, a large overworld map, 23 different attack moves, 2 healing spells, 306 playable characters spanning 10 elemental classes and it is generally more like Palworld when it comes to open-world exploration. Battles are 3 against 3 characters instead of 1 on each side.

    Requires Celtic CE library (see links).

    Categorized under:
  24. He He He Ha! Time for a prank program! ryanconmartians presents…

    TheHapara Prank!

    Wanna prank your friends? Middle/High Schools usually provide Chromebooks, with the screen monitoring extension known as Hapara.
    I recently came across Question: Why are so many people illiterate about TI84+CEs topic on cemetech.net. If you know how Hapara usually works, you will understand this prank.
    To Hapara someone successfully, try some of these inputs: 7410, 2563, and 5978.
    To Hapara someone UNsuccessfully, try any of these inputs except for 0.
    Wonder what 0 does? You try!

    Controls:
    [<^v>] = Navigate menu
    [0][1][2][3][4][5][6][7][8][9]: Input
    [enter]: Proceed in areas possible
    [on]: Exit the program

    Source Code included in case you want to tweak the program.

    Celtic CE Libraries needed.

    v1.0.0

    Categorized under:
  25. Confetti on your calculator without the cleanup

    Categorized under:
  26. a ti basic program that celebrates your birthday .

    Categorized under:
  27. a ti basic program that celebrates your birthday .

    Categorized under:
  28. Hangman CE is a TI-Basic program that I created from the ground up. It's PvP, so it requires one person to input a string for the other to guess. I've enjoyed using this program myself and hope you do as well.

    I would appreciate any feedback anyone has to offer about the code itself. I'm always looking to improve so I can share even better programs in the future.

    Categorized under:
  29. Spriter is a simple, minimalistic sprite and icon creator for the TI-84 Plus CE
    and TI-83 Premium CE written in Hybrid TI-BASIC using the Celtic CE library. It
    features an editor for sprites using both xLibC and BufSprite palettes, along
    with options to export both to string variables and as an icon for a TI-BASIC
    program!

    You need the Celtic CE library to use this! Download it here: https://bit.ly/CelticCE

    Categorized under:
  30. Hangman CE is a TI-Basic program that I created from the ground up. It's PvP, so it requires one person to input a string for the other to guess. I've enjoyed using this program myself and hope you do as well.

    I would appreciate any feedback anyone has to offer about the code itself. I'm always looking to improve so I can share even better programs in the future.

    Categorized under:
  31. Hangman CE is a TI-Basic program that I created from the ground up. It's PvP, so it requires one person to input a string for the other to guess. I've enjoyed using this program myself and hope you do as well.

    I would appreciate any feedback anyone has to offer about the code itself. I'm always looking to improve so I can share even better programs in the future.

    Categorized under:
  32. Update: This is a somewhat improved version of the original SYNDIV, with 1840 bytes, down from 1916. I am including it in the file since you are still downloading it, trying to figure out which version is best. Well, here they are, both of them. As you will see, SYNDIV1 is the better one, faster and with fewer bytes, and with the ability to enter the terms in any order.

    Making a port from TI-Basic to Casio-basic, was a bad idea. Trying to think in TI’s basic and then put it on a Casio does not make Casio justice, as you can see in the previous versions. So, I’ve made a new program from scratch, on my Casio fx CG50. The number of bytes have dropped from 1916 to 1196, and the program is much faster now. As in previous versions, you can only use x as variable, and only integer coefficients, but you can enter the terms in any order, and there can be more than one of the same degree. The lists however, are still presented one by one vertically, and the only limits for the number of polynomials you can enter, is memory and the degree of the first polynomial.

    Categorized under:
  33. Hangman CE is a TI-Basic program that I created from the ground up. It's PvP, so it requires one person to input a string for the other to guess. I've enjoyed using this program myself and hope you do as well.

    I would appreciate any feedback anyone has to offer about the code itself. I'm always looking to improve so I can share even better programs in the future.

    Categorized under:
  34. High Definition Picture Viewer CE is a nifty tool that allows you to utilize the TI-84 Plus CE and TI-83 Premium CE's full screen resolution for viewing images!
    Version 2 dramatically increases the resolution supported! Zoom and pan features allow most images up to 1080p to be viewed on the calculator. A picture converter is included to create calculator-compatible files.

    Categorized under:
  35. this is a survival game that started to make a year ago on my sisters ti-84 plus CE, then I got my own and finished it on that about a month ago, I have continued to make small changes and updates to make it even better.

    new update: multiple bug fixes!

    Categorized under:
  36. In this fan-made prequel to Earthbound Beginnings, you play as an alien the same race as Giygas, with your race's special PSI power. Invaders from other planets are attacking, trying to take it from you! As the father of PSI, it is up to you to defend your power. Use classic Earthbound attacks to defeat them, or use new items to help you.

    NOTE: This game is kind of unfinished, as there is no ending there are some loose ends. However, the core gameplay works great and is fun, trust me.

    Categorized under:
  37. Gimme 5: All Stars is a simple and fun word-guessing game for the TI-84 Plus CE/TI-83 Premium CE. Try to guess the 5-letter word in 5 attempts with over 4000 words to choose from! Have fun!

    Categorized under:
  38. you can dial one number, wait on hold, and see what happens next!

    -------V 1.2.1-------
    added compatibility for older calculators
    fixed some bugs
    Added custom number

    Categorized under:
  39. This is a port of the classic Minesweeper game to your TI calculator!
    ⛭ ¤ ✶ ¤ ⛭ ¤ ✶ ¤ ⛭ ¤ ✶ ¤ ⛭ ¤ ✶ ¤ ⛭ ¤ ✶ ¤ ⛭ ¤ ✶ ¤ ⛭
    Simply download onto your TI-83+, 84+, or 84+CE and start sweeping!

    Categorized under:
  40. you can dial one number, wait on hold, and see what happens next!

    -------V 1.2.1-------
    added compatibility for older calculators
    fixed some bugs
    Added custom number

    Categorized under:
  41. Update: This is a somewhat improved version of the original SYNDIV, with 1840 bytes, down from 1916. I am including it in the file since you are still downloading it, trying to figure out which version is best. Well, here they are, both of them. As you will see, SYNDIV1 is the better one, faster and with fewer bytes, and with the ability to enter the terms in any order.

    Making a port from TI-Basic to Casio-basic, was a bad idea. Trying to think in TI’s basic and then put it on a Casio does not make Casio justice, as you can see in the previous versions. So, I’ve made a new program from scratch, on my Casio fx CG50. The number of bytes have dropped from 1916 to 1196, and the program is much faster now. As in previous versions, you can only use x as variable, and only integer coefficients, but you can enter the terms in any order, and there can be more than one of the same degree. The lists however, are still presented one by one vertically, and the only limits for the number of polynomials you can enter, is memory and the degree of the first polynomial.

    Categorized under:
  42. It is widely known that opossums have the instinct to repel aliens. You can now practice your opossum massaging skills on the TI-84 Plus C Silver Edition, TI-84 Plus CE and HP Prime calculators! There are three CE versions, sort-of: One of which uses Celtic CE but runs slower, an older one using ICE Compiler which no longer works with newer C library versions, a Game Boy ROM converted to appvar for use in TI-Boy CE emulator and the ROM file itself for use in a PC Game Boy emulator or on original hardware. The Game Boy version is included for use in TI-Boy CE because it runs smoother despite being emulated.

    Categorized under:
  43. This is a recreation of Hangman, the classic
    word-guessing game, for the TI-84 Plus CE!

    The goal is to find what the word is, based
    on the letters you already know.

    You can only make 6 mistakes, or you will
    lose.

    Categorized under:
  44. RPN83P is an RPN calculator app for the TI-83 Plus and the TI-84 Plus. The app is inspired mostly by the HP-42S calculator, with significant features from the HP-12C and the HP-16C. The RPN83P is a flash application that consumes 2 pages (32 kiB) of flash memory.

    Features:

    * traditional 4-level RPN stack (X, Y, Z, T) with LastX register
    * 8-line display showing all stack registers
    * 25 storage registers (STO 00, RCL 00, ..., STO 24, RCL 24)
    * hierarchical menu system, inspired by the HP-42S
    * support for all dedicated math buttons on the TI-83 Plus and TI-84 Plus
    * additional menu functions (MATH, NUM, PROB, CONV, HYP, UNIT, etc)
    * base conversions and bitwise operations (BASE)
    * 1 or 2 variable statistics (STAT)
    * curve fitting (CFIT, linear, logarithmic, exponential, power)
    * time value of money (TVM)
    * complex numbers (CPLX)
    * various display modes (FIX, SCI, ENG)

    Installation: Install the rpn83p.8xk flash app file.

    Starting:

    * Press APPS.
    * Scroll down to the RPN83P entry.
    * Press ENTER.

    Exiting:

    * Quit app: 2ND QUIT
    * Turn off device: 2ND OFF

    Version: 0.9.0 (2024-01-06)

    Major Changes from 0.8.0:

    * complex numbers
    * support more than 14 digits during input/edit
    * replace STK and REGS List variables with RPN83STK and RPN83REG appVars

    Categorized under:
  45. you can dial one number, wait on hold, and see what happens next!

    -------V 1.2.1-------
    added compatibility for older calculators
    fixed some bugs
    Added custom number

    Categorized under:
  46. Update: This is a somewhat improved version of the original SYNDIV, with 1840 bytes, down from 1916. I am including it in the file since you are still downloading it, trying to figure out which version is best. Well, here they are, both of them. As you will see, SYNDIV1 is the better one, faster and with fewer bytes, and with the ability to enter the terms in any order.

    Making a port from TI-Basic to Casio-basic, was a bad idea. Trying to think in TI’s basic and then put it on a Casio does not make Casio justice, as you can see in the previous versions. So, I’ve made a new program from scratch, on my Casio fx CG50. The number of bytes have dropped from 1916 to 1196, and the program is much faster now. As in previous versions, you can only use x as variable, and only integer coefficients, but you can enter the terms in any order, and there can be more than one of the same degree. The lists however, are still presented one by one vertically, and the only limits for the number of polynomials you can enter, is memory and the degree of the first polynomial.

    Categorized under:
  47. Update: This is a somewhat improved version of the original SYNDIV, with 1840 bytes, down from 1916. I am including it in the file since you are still downloading it, trying to figure out which version is best. Well, here they are, both of them. As you will see, SYNDIV1 is the better one, faster and with fewer bytes, and with the ability to enter the terms in any order.

    Making a port from TI-Basic to Casio-basic, was a bad idea. Trying to think in TI’s basic and then put it on a Casio does not make Casio justice, as you can see in the previous versions. So, I’ve made a new program from scratch, on my Casio fx CG50. The number of bytes have dropped from 1916 to 1196, and the program is much faster now. As in previous versions, you can only use x as variable, and only integer coefficients, but you can enter the terms in any order, and there can be more than one of the same degree. The lists however, are still presented one by one vertically, and the only limits for the number of polynomials you can enter, is memory and the degree of the first polynomial.

    Categorized under:

File statistics are updated periodically, so numbers shown in this listing may not agree exactly with those shown on individual files.

Advertisement