Recent Forum Posts

Looking for something?

Don't see a match? Post to the community

From categories:
page 1123...next »

There is a tutorial in the Read Me text document for sending files and using the program.


𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

Re: hi by Bio_Hazard1282_rPi3Bio_Hazard1282_rPi3, 14 Jul 2019 23:18

hi how do you use this im new to my ti 83 plus se i need this program how do you send it!!!!!!

hi by eDummy_UsereDummy_User, 14 Jul 2019 22:09

So, I'm reading a TI-84 Plus Guide, because there are still lots of subjects and topics I still need to review and learn, and at this one part that there it explained that there is 128KB of RAM on the calculator. It also said you can only access that RAM with an Assembly program. Where can I find this program??


𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

For which calculators? The speeds vary depending on the model, OS, and RAM/ROM availability. There is a speed difference between the TI-83/84/+/SE/CSE/CE/T/Premium CE


𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

wicked, ill have to do a more in-depth look

Re: List programming speed by VeryGoodDogVeryGoodDog, 02 Jul 2019 00:28

You can also get rid of the *


𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

Re: 3D cube by Bio_Hazard1282_rPi3Bio_Hazard1282_rPi3, 01 Jul 2019 21:17

I haven't been programming for a while, then I learned a little python. But I still find TI-basic useful for testing a programming technique. So when I tested a simple 3d camera-based viewer, after having done the math for it, I programmed a calc program to try it out. I thought I would share it with you guys too, and see if it can be made faster.

Also, I changed line:

([J]*[A])-[D]->[B]

to

[J]*([A]-[D])->[B]

which makes it do rotations better.

I think that one reason for its slowness is that it does a lot of matrix calcs, and draws 12 lines. Maybe statplot could be used to speed things up.

Re: 3D cube by TI-GBRTI-GBR, 01 Jul 2019 12:33
ClrHome
Disp "1)KILOMETERS","2)METERS","3)MILES","4)YARDS","5)FEET","6)INCHES"
Input "Choice: ",C
Input "Amount ",X
(C=1)X+(C=2)X/1000+(C=3)1.609344X+(C=4)X/1093.613+(C=5)X/3280.84+(C=6)X/39370.079→A
(C=1)1000X+(C=2)X+(C=3)1609.344X+(C=4)X/1.094+(C=5)X/3.281+(C=6)X/39.37→B
(C=1)X0.621371+(C=2)X/1609.344+(C=3)X+(C=4)X/1760+(C=5)X/5280+(C=6)X/63360→D
(C=1)X1093.613+(C=2)1.09361X+(C=3)1760X+(C=4)X+(C=5)X/3+(C=6)X/36→E
(C=1)X3280.84+(C=2)3.281X+(C=3)5280X+(C=4)3X+(C=5)X+(C=6)X/12→F
(C=1)39370.079X+(C=2)39.37X+(C=3)63360X+(C=4)36X+(C=5)12X+(C=6)X→G
ClrHome
Disp "1)Km","2)M","3)Mi","4)Yds","5)Ft","6)In"
Output(1,7,A
Output(2,7,B
Output(3,7,D
Output(4,7,E
Output(5,7,F
Output(6,7,G
Stop

Interesting. It's been a whiiiiiiiiile since TI-GBRTI-GBR's last post in any forum. Glad to see he's back! :) Hey TI-GBRTI-GBR, what brings you back to TI|BD from all this time?


𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

Re: 3D cube by Bio_Hazard1282_rPi3Bio_Hazard1282_rPi3, 30 Jun 2019 14:01

*Gasps* THE TI-GBRTI-GBR is alive!

Re: 3D cube by Myles_ZadokMyles_Zadok, 30 Jun 2019 01:13
GascatGascat 29 Jun 2019 23:54
in discussion Forum 101 / Wiki Page Discussions » TINT

I saw mention of some help information but I'm unable to find it. Can I run individual programs from the home screen? I have error messages when I try.

by GascatGascat, 29 Jun 2019 23:54

Well for starters you can get rid of the extra brackets and parenthesis at the end of some lines of code.

[[9]]→[A]

Can be:

[[9→[A]

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

Ans(2)

Can be:

Ans(2

Doesn't really help with speed, but saves bytes.


𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

Re: 3D cube by Bio_Hazard1282_rPi3Bio_Hazard1282_rPi3, 29 Jun 2019 22:46

Hi, I made a program which draws a 3d cube and then you can move around in space to see it from different angles. It uses camera perspective, and uses matrices to track points, rotations, and translations. If anyone wants to, feel free to try to optimize it for speed. Tested on my original TI-83 (not plus).

prgmA3D

Input "ROTATION ANGLE:",theta
prgmthetaSSETUP
prgmthetaPOINTS

Repeat K=16
    ClrDraw
    "DRAW SCREEN"
    [C]->[D]
    dim([A])
    Ans(2)
    For(A,1,Ans-1)
        augment([D],[C]->[D]
    End
    [J]*([A]-[D])->[B]
    dim([B])
    Ans(2)

    {1,4}->L1
    prgmthetaDRWPT
    {1,2}->L1
    prgmthetaDRWPT
    {2,3}->L1
    prgmthetaDRWPT
    {3,4}->L1
    prgmthetaDRWPT
    {1,5}->L1
    prgmthetaDRWPT
    {2,6}->L1
    prgmthetaDRWPT
    {4,8}->L1
    prgmthetaDRWPT
    {3,7}->L1
    prgmthetaDRWPT
    {5,6}->L1
    prgmthetaDRWPT
    {6,7}->L1
    prgmthetaDRWPT
    {7,8}->L1
    prgmthetaDRWPT
    {8,5}->L1
    prgmthetaDRWPT

    Repeat K
        getKey->K
    End

    If K=21
    .5+[C](3,1)->[C](3,1)

    If K=31
    ~.5+[C](3,1)->[C](3,1)

    If K=82
    .5+[C](1,1)->[C](1,1)

    If K=84
    ~.5+[C](1,1)->[C](1,1)

    If K=73
    ~.5+[C](2,1)->[C](2,1)

    If K=93
    .5+[C](2,1)->[C](2,1)

    If K=26
    [J]*[[1,0,0][0,cos(theta),~sin(theta)][0,sin(theta),cos(theta)]]->[J]
    If K=24
    [J]*[[1,0,0][0,cos(~theta),~sin(~theta)][0,sin(~theta),cos(~theta)]]->[J]
    If K=25
    [J]*[[cos(theta),0,~sin(theta)][0,1,0][sin(theta),0,cos(theta)]]->[J]
    If K=34
    [J]*[[cos(~theta),0,~sin(~theta)][0,1,0][sin(~theta),0,cos(~theta)]]->[J]
    If K=22
    [J]*[[cos(theta),~sin(theta),0][sin(theta),cos(theta),0][0,0,1]]->[J]
    If K=23
    [J]*[[cos(~theta),~sin(~theta),0][sin(~theta),cos(~theta),0][0,0,1]]->[J]

End

Subprograms

prgmthetaDRWPT

Line(([B](1,L1(1)))S/([B](3,L1(1))),([B](2,L1(1)))S/([B](3,L1(1))),([B](1,L1(2)))S/([B](3,L1(2))),([B](2,L1(2)))S/([B](3,L1(2)))

prgmthetaPOINTS

"POINTS
[[1,~1,~1,1,1,~1,~1,1,0][~1,~1,1,1,~1,~1,1,1,0][4,4,4,4,6,6,6,6,0]]->[A]

"CAM ROTATION
[[1,0,0][0,1,0][0,0,1]]->[J]

"CAM TRANS
[[0][0][0]]->[C]
"SCREEN DIST
3->S

prgmthetaSSETUP

ClrDraw
CoordOff
RectGC
GridOff
AxesOff
LabelOff
ExprOff
ZSquare

For the input rotation angle, use a small angle such as 11.25. Also make sure you are in degree mode.
You can put the program into Chemetech's sourcecoder 3 and download it to try it out.

Info:
the camera starts out pointing straight up along the z axis, at the cube which floats above it.

moves:
2nd +z
alpha -z
8 +y
2 -y
4 -x
6 +x
mode - rot z
del +rot z
up +rot y
down -rot y
left -rot x
right +rot x

3D cube by TI-GBRTI-GBR, 29 Jun 2019 13:12

Hello everyone! So, I am pretty much done with programming Snake Arcade. I'm about to release it soon on here, ticalc.org, cemetech.net, and possibly omnimaga. So, I programmed Nibbles (by Edward HEdward H) as the last mode, and I am trying to adjust the program where ending the game by defauly from collision detections inside the program, instead I want it to end outside of the program (the very bottom of the code) with no memory leaks. I have tried to do this, but it cuts down speed by about 25%. Since I can't really type it in by hand, I'll just explain what I coded. So the main loop of the program Repeat 0, I changed that to Repeat D with 0→D in the line before that. And the conditions that check to see if the snake either crashed into the wall or itself:

(First Check)
If pxl-Test(B,Ans-H)
Then
Text(27,34,"SCORE: ",θ
Return
End
(2nd Check)
If pxl-Test(Ans-V,A:Then
Text(27,34,"SCORE: ",θ
Return
End
The check to see if the user won:
If θ=95:Then
Text(27,34,"WIN.
Return
End

From what I observed in the code, there are 9 If checks inside the program. I do know that having Labels inside Loops don't cause memory leaks, So, I put the Goto's after the If H:Then and the If pxl-Test(B,A:Then checks, and the quit label right before the last 3rd End at the end of the program. By doing all of this, it cut down speed a bit. Is there an alternative solution to this to make it faster with no memory leaks?

At the beginning of the code, I put an extra variable D and with the If checks to end the game, I set the variable D to 1 in the checks and at the end of the 2 main loops and If D is 1, it goes to the ending loop.


𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

Nibbles Adjustment by Bio_Hazard1282_rPi3Bio_Hazard1282_rPi3, 27 Jun 2019 22:54

I couldn't find the program GatoradeDCGatoradeDC. It said it was removed by the administrators. Anyways, your 2-group back-up method works nicely! I have a total of 3 groups, 2 of them I do the back-and-forth stuff with, and the 3rd one to have a copy if both fail. Thanks for the help everyone for providing the info I need. :)


Program Release Information: (This will possibly be the Read Me) The Celtic III game Snake Arcade will be released for the TI-84 Plus Family around July 4th, 2019. This game is like no other; because of the 4 built-in game modes, which are:

  • Normal snake: A simple snake game on the home screen where you have to eat the *'s and the snake grows longer and longer. You may go past the wall boundries, the only way you die is by pressing CLEAR or running into yourself. Original author: burrburr, edited by WeregooseWeregoose, James KanjoJames Kanjo, and Timothy FosterTimothy Foster.
  • Demented Snake: Similar to the game above, but the snake display is very… glitched and you constantly have to change your direction to keep the snake moving fast. Original author: burrburr, edited by WeregooseWeregoose, and James KanjoJames Kanjo.
  • Space Snake: You are in space and you have to guide the snake to fly inside the astroids (= signs) to get points. Crash into a pixel and it's game over. Original author: 12Me2112Me21
  • Nibbles: A very graphical, and fast snake game. Guide your snake to get all pieces of food that appears around the screen. The 3 ways you can die is crashing either into a wall, or yourself, or by pressing CLEAR. Original author: Edward HEdward H

Description:


Ideas and suggestions are appreciated!

𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

There is an assembly program on ticalc.org called IDrestore. It tries to retrieve the original ID on the calculator. If it finds it, it will write it. Also, if you don't want the risk of failed groups, make sure you always have at least two groups. For example, let's say you make two groups called SA1 and SA2. They will both have a copy of the same program. If you make a big change, delete one of the groups and replace it with the new program. Group the group with the same name as the grouo you deleted a second ago. Now, if you make another change, delete the SECOND group and re-group the SA2 with the newer program code. Then do this back and forth, respectively. Now remember, if you are trying to group SA1 or SA2 and one of them fails to reach the archive, you have the other one with the previous version. Always, Always, Always make sure you have at least ONE group with the program code in it, so you have another to spare if either fails.

Re: Group Recovery by GatoradeDCGatoradeDC, 26 Jun 2019 01:27

So, it said that I had to look for the largest page address. If the largest page address has a twin, I had to look for the largest memory address. So I tried to do the group recovery steps and I kind-of got my group back. I ungrouped it and it only had about 30% of the program code, but some of it was corrupted. The guide said it is easier to re-do the project in some situations, so I decided to just re-do the entire thing. I'm almost done with the version I'm working on, and this one should be around 8½ - 8¾ kB instead of 11kB. CalcSys crashed my calculator once while trying to recover my program, and for some reason, my ID on the About screen is gone… I took a screenshot of it before on TiLP and it is 0A2DC-0CA97-52A6. I don't know how that happened, but it looks like it's gone. The Self-Test shows "ID FAILED" when I self-test. Is there a way to recover my ID on the About screen?


𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

Re: Group Recovery by Bio_Hazard1282_rPi3Bio_Hazard1282_rPi3, 25 Jun 2019 23:44

0000 is the Memory address 0; FFFF is the memory address 65535.

I don’t know if the page address counts, I’ve never had to use calcsys

Re: Group Recovery by TrenlyTrenly, 23 Jun 2019 17:01

Okay, so I visited the link and I read some information for recovering groups. I'm using CalcSys like it wants me to, and the guide said that I need to circle the largest memory address. Is the largest closest to 0000 or FFFF? It gave me like about 9 memory addresses for the SNAKEARC group name (The program name and group name were different from each other) and I don't know which address is bigger or smaller.

EDIT: Sorry for the delayed reply Trenly, I had a 4-day backpacking trip and I had no service
EDIT 2: Also, does the page address matter for the largest memory address?


𝔹𝕚𝕠_ℍ𝕒𝕫𝕒𝕣𝕕𝟙𝟚𝟠𝟚

Re: Group Recovery by Bio_Hazard1282_rPi3Bio_Hazard1282_rPi3, 23 Jun 2019 13:47

No. The TI-OS is locked down. Switching from TI-BASIC to ICE or C will let you use the full computational ability of the calculator, though.

page 1123...next »