MaxCoderz

Nifty, although those are pretty short buildings :P Lol I actually just noticed that! :o :) I'll make them larger in the final version (or maybe I'll call this some small district outside the large city where you live) :wink: BTW, in the final game I'll offer 3 versions (based on the BASIC installe...

I use virtual ti and wabbit emulators to help with my asm learninz, but one little thing annoys me. I'd like to link between vti and my calc, but there is no usb option for the input into my computer (like there is with ti connect, but they have a really crappy emulator). I do however see these COM ...

I decided I'd go with the line-drawing routine, it looks better and draws the map about 3x faster than the text sprites:

King Harold wrote:Why are you using TASM? (despite many warnings that it's the worst assembler out there?)

Because for now it's the easiest to use, and most tutorials out there use it as well.

Thanks for the link, I've tried that tutorial and it's working pretty well but it's not handling my rom calls very well, see: http://img229.imageshack.us/img229/18/76973839nb6.jpg EDIT: Ah never mind, I figured it out. For some reason the include file I used uses bcall instead of b_call so I changed...

This is my favorite tutorial in ti assembly so far. Does anyone think it's a bad idea to use this one?

http://en.wikibooks.org/wiki/TI_83_Plus ... t_you_need

Oh I see what you mean. I actually only stick that zero there since the p/q technique doesn't work for any roots that are 0 (y=x^2 would only yield a bunch of 1's in the possible root value list). Other than that your exactly right. I don't know why, but I don't need to line up the lists with an ext...

King Harold wrote:Registers..?

Lol sorry

(not to self: don't use the word "registers" when around assembly programmers)

I can't think of another word for it though. It shows a change of zero I guess, I meant it in a more figurative way.

doesn't the second sort have to be descending? (could be that I didn't understand it properly..) augmenting a {0} to the list after not-ing it would help to make it a few microseconds faster I think It works pretty good, the not-ing makes ever list value without a change from the last register as o...

Wait a minute.... I can use that delta list thingy

I could do this when list1 is my list:

SortA(L1
not(augment({1},[DELTA]List(L1 -> L2
SortA(L2,L1
dim(L1)-sum(L2S -> dim(L1

I'm still in the brainstorming stage, but it seems like that would work

The problem is I already use those methods in testing whether each value is a root.

My real goal is to eliminate any values that happen to be repeated into one each. Using those I'd end up using a for loop to change the value I was looking for.

I don't see a way around a loop here.. (unless you'd use recursion but that's a bit loopy - and that's not something you'd want to do in BASIC) You could write an assembly program to do it for you, it will also loop but an assembly loop is much faster than a BASIC loop Thats a good idea, I'll give ...

Thanks, I was temporarily obsessed with making the fastest polynomial solver I could imagine (no loops, just a crap load of list operations) In he end I got the right answers (and then I got more of those right answers in the same list in a different order), but I didn't want to ruin it with a for( ...

Hello Does anyone know if there is a routine for eliminating identical values from a list:

Turning this:

{1,2,2,2,3,3,4,5,6

into {1,2,3,4,5,6

and this:

{1,2,3,4,5,6,2

into

{1,2,3,4,5,6

That does help me but does brass have a .exe file (I didn't see one) It tells me

'brass.exe' is not recognized as an internal..... etc

In any case I tried Asm studio for some of my programs and it worked fine, I was finally able to output a ram file. Thanks for the help