This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Topics - TiAddict
1
« on: August 13, 2012, 10:41:46 pm »
So this program creates a prgm which name is in str1, and puts memory (10 bytes) into that prgm. Start: Ld Hl, Str1Address Rst 20h ( B_Call Mov9ToOp1) Rst 10h ( B_Call ChkFindSym) Ex De, HL Ld C, (HL) Inc HL Ld B,(HL) Inc HL Ld De, Op1 Ld A,5 Ld (DE),A Inc DE Ldir xor A Ld (DE),A B_Call ChkFindSym Ld HL, 0 B_Call CreateProg Push DE Inc DE Inc DE Ld HL,10 B_Call InsertMem Pop HL Push HL B_CALL LdHLind Ld BC, 10 Add HL, BC Ex DE, HL Pop HL Ld (HL),E Inc HL Ld (HL), D Ldir Ret Str1Address: db. StrngObj, tVarString, 00h,0 Please, dont optimize or anything. I want to see how it's working, and understand ASM Better. I heard that OPs gets changed alot, but im not sure. Anyways, this Program does create a prgm, but it's not exactly the same as "string" inside Str1. So can you help me? Thank you 
2
« on: August 10, 2012, 07:46:45 pm »
So i want to make a program that MAKES a program from the Basic string in str9. Please Details! 
3
« on: July 26, 2012, 06:25:36 pm »
Hello, im back to programming! And im creating a game, but im having hard time with programming the decision algorithm of AI. Can someone show me how "chess" AI algorithm work? Thank you!
4
« on: July 28, 2011, 08:46:32 pm »
Can someone show me the routines for them? i tried the ones in the routine section, but it's not working.
5
« on: July 02, 2011, 08:16:47 pm »
So, i want to use "inString(" command and "sub(" in ASM, and i need someone to show me the routine. I dont know why, but the one on the "Learn ASM in 28 days" isnt working. Is there other way, using the null string?
HL=address of string to look for
DE=address of string to find
A=positon
6
« on: June 30, 2011, 01:01:43 pm »
i was reading the Ti 83+ developer (for learning ASM programming) and i was messing with OP registers, and archieving the program. So i made this program (dont really remember), and i executing using Asm(, and then it was archieving so i was like, "yay it's finally working" and i executed again, and then it said it was archieved, so i check the status, but then it wasn't so i was going to reset the calculator, and then when i tried reset, but suddenly, my calculator's screen went off. so i turned it on, and then it showed me, the messed up picture, and then turned off again by it self. Since i had many many crash before making asm programs i knew what to do, so i took out all the battery and waited for 10 hours, and tried again. still the same, however, i manage to press clear many times, and then it worked. i was so happy until i saw all my archevied were hidden(maybe, dont know), or deleted.( but the memory didnt change and Apps were still there). and i tried Axe app, and it turned off again. so i dont know how to fix this.
Please help me fix this!
7
« on: June 27, 2011, 04:57:01 pm »
in this situation, is assembly faster? or same speed?
TI-BASIC
2->kTheta
or
Assembly
B_CALL OP1Set2
B_CALL StoTheta
RET
if ASM's faster, that means TI BASIC games/program will be faster if i use some ASM prgm to store and add/sub/multiply/divide the floating point variables?(A~Z and kTheta)?
8
« on: June 24, 2011, 11:34:13 am »
The title says it all  I tried to put program data (tokens) into str2, str1 containing the program name, but i I have no clue how to start this.. 
9
« on: June 20, 2011, 11:13:52 am »
so how does seed work?
what does it do?
EX:
3->rand
10
« on: June 07, 2011, 03:16:05 pm »
can someone explain about shifting bits, rotating, and etc.. I would appreciate if it also explain why you use it, when to use it.
11
« on: May 31, 2011, 01:43:16 pm »
Can someone show me a program that will count 1~1000 really fast? i tried like this, but it wont work. Start: Bcall ClrScrnFull Bcall HomeUp Count: ld hl,(number) ld de,(check) or a push hl sbc hl,de ret z pop hl inc hl bcall dispHL ld (num),hl jp count number: db 0 check: db 1000 And the mimas gives me an "out of range" error when i try to compile. and i changed the db to dw, and it worked, but it wont count. Please detailed explanation Edit: oh yea i just noticed that when i use sbc, it will make hl equal to negative.. i dont know how to fix that.
12
« on: May 27, 2011, 04:28:07 pm »
For people who knows how hexadecimal programing works, and ti basic language,
So I'm trying to create a on-calc assembler, and i need code to get the address in hexadecimal? (i already have a basic prgm that will convert number in a (decimal) to hexadecimal,prgm that will change letters to hexadecimal) i just cant figure out how it works. i read the code from OTBP, TASM again and again, but i coudnt figure out how they get it.
for example,
ld hl,0h ;210000
ld (currow),hl ;224B48
ld hl,text ;21A29D this is the part i dont know how to get
bcall puts ;EF0A45
ret ;c9
text: ;48454C4C4F20574F524C442100
.db "hello world",0
i know that prgm starts at $9D95 ($959D)
Please help!
if this is too much, you can still give me some tips to do this. thanks
13
« on: May 27, 2011, 02:00:51 pm »
how do you compare number bigger than 256? i know cp compares number to accumulator, but it can only hold up to 256.. so how?
14
« on: May 27, 2011, 01:48:00 pm »
So im trying to create like a on-calc assembler, but why does ti83.inc putted in little-endian? for example, why dont they put it has 7045h instead of 4570h? doesnt that just makes the assembler harder to assemble?
15
« on: May 17, 2011, 07:23:39 pm »
Umm how does hooks work? i want to make a token like "csc(" please, detailed explanation
|
Show Posts