Wow, I remember playing that game last year. I was addicted to it for about a week, to the point that I could beat the entire game without losing more than five to ten lives.

This is just me brainstorming without testing my thoughts with code, but I think ztrumpet's code fails because Str1 doesn't get updated to include the nether zone that you can move into. But if you did add all that whitespace to Str1 every time you went farther out of bounds, it would just open up a whole new can of worms regarding tracking your location in the string. And fixing all those new problems would just make this a horribly inefficient piece of code I would think, when so many alternatives are possible.

Maybe you should either completely disallow going offscreen, or make the Output(A,B,"* line be conditionally dependent on being onscreen.

tifreak: But your current location in the string is just 16A-16+B at any given time, assuming you're using the typical 8x16 homescreen map string. That's not really worth its own variable in my opinion.

meishe91: Your location in the string at any time is just 16A-16+B. To get the above space, subtract 16 from that. To get the left space, subtract 1. Down: +16. Right: +1. See how it works?

DJ Omnimaga, that's exactly how I've felt for the last several years. I think I'm going to fit right in at this place

Anyways, this project sounds cool. I don't play Monopoly very often, but when I do it gets competitive and intense fast
I can't wait to see this when it's done!

EDIT 2: This code is outdated. The final version is in a later post in this topic.

This is what I've been working on all day. It isn't completely finished; I realized just a few minutes ago that I totally forgot to handle a tied game, and it doesn't give you any fancy victory message when you win. And you will win, since the AI opponent is just "choose a random column." But I didn't make this for the AI; I made it for everything else.

The main program is MAINLOOP (obviously) and I made GRAVITY a subprogram because it saves a few bytes. That brings me to the main reason I made this topic... I want to see if this can be optimized any more than it already is. I think I've already done a decent enough job on it, but I really want to make it as small as it can be.

I've attached both programs, and here's the code too:

MAINLOOP
:Disp "WILL YOU MOVE
:Input "FIRST? Y/N: ",Str1
:Str1≠"Y→T
:{6,7→dim([A]
:Fill 0,[A]
:ClrHome
:For(A,2,7
:Output(A,2,". . . . . . .
:End
:Output(8,2,"-------------
:Repeat W
:If T
:Then
:Repeat not([A](1,Ans
:randInt(1,7→C
:End
:prgmGRAVITY
:Else
:DelVar M4→C
:Repeat M
:Output(1,2C,"V
:Repeat max(K={21,24,26,45
:getKey→K
:End
:If K=45
:Return
:If K=21 and not([A](1,C
:Then
:prgmGRAVITY
:1→M
:Output(1,2C,"
:End
:If K≠21
:Then
:Output(1,2C,"
:C-25+Ans→C
:Ans-7(Ans=8)+7not(Ans→C
:End
:End
:End
:{1,1,1,1→{L1}
:T+1→T
:1→A
:While A<4 and R+A≤6 and Ans
:If T=[A](R+A,C
:Then
:1+{L1}(1→{L1}(1
:A+1→A
:Else
:0
:End
:End
:1→A
:While A<4 and C-A≥1 and Ans
:If T=[A](R,C-A
:Then
:1+{L1}(2→{L1}(2
:A+1→A
:Else
:0
:End
:End
:1→A
:While A<4 and C+A≤7 and Ans
:If T=[A](R,C+A
:Then
:1+{L1}(2→{L1}(2
:A+1→A
:Else
:0
:End
:End
:1→A
:While A<4 and R+A≤6 and C+A≤7 and Ans
:If T=[A](R+A,C+A
:Then
:1+{L1}(3→{L1}(3
:A+1→A
:Else
:0
:End
:End
:1→A
:While A<4 and R-A≥1 and C-A≥1 and Ans
:If T=[A](R-A,C-A
:Then
:1+{L1}(3→{L1}(3
:A+1→A
:Else
:0
:End
:End
:1→A
:While A<4 and R+A≤6 and C-A≥1 and Ans
:If T=[A](R+A,C-A
:Then
:1+{L1}(4→{L1}(4
:A+1→A
:Else
:0
:End
:End
:1→A
:While A<4 and R-A≥1 and C+A≤7 and Ans
:If T=[A](R-A,C+A
:Then
:1+{L1}(4→{L1}(4
:A+1→A
:Else
:0
:End
:End
:max(3<{L1}→W
:not(T-1→T
:End

GRAVITY
:DelVar  RR
:Repeat Ans=5 or [A](Ans+1,C
:Ans+1
:End
:Ans+(Ans=5 and not([A](6,C→R
:T+1→[A](Ans,C
:Output(R+1,2C,sub("XO",T+1,1
In particular, I'm wondering if there's a less ridiculous way of figuring out when a player wins (which is the section in MAINLOOP from the :{1,1,1,1→{L1} line to the :max(3<{L1}→W line). And I know I could already save a few bytes in that section by incrementing T for its duration. But what else? I've hit my limit already

EDIT: I did that T+1→T optimization and saved six bytes. And it also made me catch a bug I didn't even know was there. I've updated the attached file with this fix too.

I don't think I've ever updated my OS. I must have whatever it had when I first got it... Version 2.30. Is updating the OS worth it?
And thanks, I'll check out the download section here for games then.
And I'll check out this Axe Parser you mentioned.

Hi, I just found this place today, and uh... well that's it. I want to learn everything I can about making calculator games and all that fun stuff that seems to be happening here