MaxCoderz

CoBB wrote:

sigma wrote:

benryves wrote:hardware accellerated sprites and smooth scrolling

Totally unrelated, but why did you introduce a spelling error in the quote?

Because I hit the quote button for only Dwedit's post, and I figured it was faster to just type in what Ben said instead of copy-pasting.

TI83 has a faster Z80 than the SMS... Which means nothing since the SMS has hardware accellerated sprites and smooth scrolling And by comparison, the TI-83 has hardware graphics de celeration. Ben, why not just stick with tile scrolling? You can make believe it's an MSX. On a black-and-white TV. Wi...

kalan_vod wrote:Even in pain, you can sleep.

I figure you'll be editing this sometime in the near future.

Yeah, when I think of the word "fun", sitting on my a** for nine straight hours pressing left and right on the controller to get in random encounters beating up amorphous blobs to get experience points to level up/get money to buy some hyperexpensive spell/cockamaime mystical dingus in ord...

Must have something to do with the fact that I hate all RPGs.

Because I am such a nice guy, I will list indexed by system. MSX Yes, I am a fraud and a thief because I have only played in emulation, and indeed have never touched anything more primitive than a 486. What of it? Gradius Gradius 2 Gofer no Yabou: Episode 2 Parodius Pennant Race 2 Commodore 64 None....

It's because your implementation is just plain flat-out wrong.

http://faq.cprogramming.com/cgi-bin/sma ... 1043284351

AndySoft wrote:Off to WikiTI!

Beat you to it! At least for Port 5, that is

Regarding memory display, CodeView* is probably the best model if you're looking for features: Resizable, in both width and height. Interpret data in a variety of ways (byte, word, dword, char, float, signed, unsigned, etc). Allows you to have up to two windows to see different or overlapping parts ...

I can tell you that CTV are the biggest collection of pricks ever. They pre-empted WYWH for... the Tragically Hip? WTF?

Nah, mine runs thourgh the array checking every possible key swaps them into proper place. Since there aren't many keys (there is only a max 255) it's more efficient if the array is quite large, so I guess its more like n*k. Same general idea I had, only I wanted to win the prize for "Most Gro...

/* QBFS (quintessential brute-force sort) algorithm Description: Sorts an array of bytes terminated by value 255. Inputs: DE Base address of array Destroys: AF BC HL Size: 23 bytes Notes: Can sort arrays with sizes in the range [0, stack space / 2] Description: Iterate through set of keys (0..255) ...

here are some riddles i got in a (chain) mail :-) : 5. This is an unusual paragraph. I'm curious how quickly you can find out what is so unusual about it. It looks so plain you would think nothing was wrong with it. In fact, nothing is wrong with it! It is unusual though. Study it, and think about ...

I'd drink the whisky and forfeit the bet, since whisky is sure to cost more than $1.

Jim e wrote:3) Mary's father has 5 daughters called:

1. Nana
2. Nene
3. Nini
4. Nono
5. ?

I'd guess "Mary"

CoBB wrote: 0 00 00 0004 out 06 1F
.
.
.

It looks as if PTI "powers on" the TI-83 Plus at PC = $0000, correct? I believe the real behavior is PC = $8000, Map mode 1, with $1F in slot 2. Not that that explains away how it's executing code on RAM 0.