Pure BASIC Homescreen Collision Detection using Matrices Tut - Cemetech | Forum

Sonlen
Calculator Deity (Posts: 1679)

13 Nov 2010 10:03:19 pm

lafferjm wrote:

Its very good that you learned how to do that. Now you should figure out how to do it with strings Smile

I found that way annoying, so I never bothered to memorize it.

Weregoose
Cemetech Expert (Posts: 573)

13 Nov 2010 10:58:24 pm

Based on the original code, this version A) creates a pair of backup variables, and B) doesn't bother searching for an obstacle before the character enters a tile. It blindly "walks" into each space and then does a check to see what tile it's on. If it finds that it doesn't belong there, it reverts to its old position using the backup variables. Of course, this all happens first, and then the character gets drawn afterward.

Code:

:ClrHome


:2→C:2→D


:[[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2][2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2][2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2][2,0,0,0,2,2,2,2,0,0,0,2,1,2,0,2][2,0,2,0,0,0,0,0,0,2,0,0,0,2,0,2][2,0,2,2,2,2,2,2,2,2,2,2,2,2,0,2][2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2][2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2]]→[A]


:For(A,1,8)


:For(B,1,16)


:[A](A,B)


:If Ans≠0:Then


:Output(A,B,sub("WX",[A](A,B),1))


:End


:End


:End


:Output(D,C,"θ")


:Repeat [A](D,C)=1


:getKey→K


:If K≠0:Then


:Output(D,C," ")  //1 space





Modified code begins here


↓





:C→U:D→V


:C-(K=24)+(K=26)→C


:D-(K=25)+(K=34)→D


:If 1<[A](D,C)


:Then


:U→C:V→D


:End





↑


Modified code ends here





:Output(D,C,"θ")


:End


:End


:ClrHome


:Output(1,4,"YOU  WIN")


:Pause


:ClrHome


:Return

With fewer tests to perform, this code is actually a little faster than its predecessor.

MufinMcFlufin
Advanced Member (Posts: 268)

13 Nov 2010 11:02:56 pm

Weregoose, here's an improvement on your modified code:

Code:

:C-(K=24)+(K=26)→U


:D-(K=25)+(K=34)→V


:If 1>=[A](V,U)


:Then


:U→C:V→D


:End

KermMartian
Site Admin (Posts: 64057)

14 Nov 2010 09:40:12 am

MufinMcFlufin wrote:

Weregoose, here's an improvement on your modified code:

Code:

:C-(K=24)+(K=26)→U


:D-(K=25)+(K=34)→V


:If 1>=[A](V,U)


:Then


:U→C:V→D


:End

Very nice thinking there. Smile

Also, I presume that we're not yet doing any substantial syntactical optimizations on the code for the sake of clarity?

MufinMcFlufin
Advanced Member (Posts: 268)

14 Nov 2010 07:35:31 pm

KermMartian wrote:

MufinMcFlufin wrote:

Weregoose, here's an improvement on your modified code:

Code:

:C-(K=24)+(K=26)→U


:D-(K=25)+(K=34)→V


:If 1>=[A](V,U)


:Then


:U→C:V→D


:End

Very nice thinking there. :) Also, I presume that we're not yet doing any substantial syntactical optimizations on the code for the sake of clarity?

Yes, this is correct.

0rac343
Power User (Posts: 319)

14 Nov 2010 08:48:38 pm

wow. This code is something I haven't found out how to use. *facepalm* I am such an idiot.

Sonlen
Calculator Deity (Posts: 1679)

14 Nov 2010 08:50:27 pm

MufinMcFlufin wrote:

KermMartian wrote:

MufinMcFlufin wrote:

Weregoose, here's an improvement on your modified code:

Code:

:C-(K=24)+(K=26)→U


:D-(K=25)+(K=34)→V


:If 1>=[A](V,U)


:Then


:U→C:V→D


:End

Very nice thinking there. Smile

Also, I presume that we're not yet doing any substantial syntactical optimizations on the code for the sake of clarity?

Yes, this is correct.

Well what happened to your comment on optimizations?
This was to show how to use it, point blank, if people know that you can omit any [" ) and whatever else there is, then they will know how to do that and not mess up the code.

tifreak8x
Guru (Posts: 11009)

14 Nov 2010 08:56:53 pm

Ah yes, I remember fooling around with this a long time ago as a possible detection system for AOD:R. I found it too bulky and slow for my needs sadly, with all the checking and the like.

Good tutorial on that, fairly simple and straight to the point. Maybe some aspects of it are a little too broken down, like where the movement math code is.

Otherwise, nice job. Reminds me I have so many tutorials to mess with for my site. *sigh* one of these days I'll find time to work on them. ><

Sonlen
Calculator Deity (Posts: 1679)

14 Nov 2010 08:58:32 pm

tifreak8x wrote:

Ah yes, I remember fooling around with this a long time ago as a possible detection system for AOD:R. I found it too bulky and slow for my needs sadly, with all the checking and the like.

Good tutorial on that, fairly simple and straight to the point. Maybe some aspects of it are a little too broken down, like where the movement math code is.

Otherwise, nice job. Reminds me I have so many tutorials to mess with for my site. *sigh* one of these days I'll find time to work on them. ><

I thought about it being too broken down, but I figured some people might now know how to make movement with that kind of setup over If K=24:Then
....:End
etc..

tifreak8x
Guru (Posts: 11009)

14 Nov 2010 09:00:10 pm

Well, not to say it shouldn't be broken down, but showing that line of code, then explaining how the calculator sees it with an example if the up key is pressed, usually is enough. If they still don't understand, then they can ask questions.

Sonlen
Calculator Deity (Posts: 1679)

14 Nov 2010 09:19:31 pm

tifreak8x wrote:

Well, not to say it shouldn't be broken down, but showing that line of code, then explaining how the calculator sees it with an example if the up key is pressed, usually is enough. If they still don't understand, then they can ask questions.

I was trying to make it so that questions were not needed about the movement at least, it took that example for me to realize how "C+(K=.....)->C" worked.

MufinMcFlufin
Advanced Member (Posts: 268)

15 Nov 2010 02:19:50 am

Sonlen wrote:

MufinMcFlufin wrote:

KermMartian wrote:

MufinMcFlufin wrote:

Weregoose, here's an improvement on your modified code:

Code:

:C-(K=24)+(K=26)→U


:D-(K=25)+(K=34)→V


:If 1>=[A](V,U)


:Then


:U→C:V→D


:End

Very nice thinking there. :) Also, I presume that we're not yet doing any substantial syntactical optimizations on the code for the sake of clarity?

Yes, this is correct.

Well what happened to your comment on optimizations?
This was to show how to use it, point blank, if people know that you can omit any [" ) and whatever else there is, then they will know how to do that and not mess up the code.

:P

It's one thing to eliminate end parenthesis. It's another to make the calculator have to store less values and do less checks while performing the same function. I did the later, and while it can still be comprehended by a reader of the tutorial, I recommend it still be done to all code (except to the point of some of my own code, like: "sum(seq(inString(sub(...")