Using Logic Problems Instead Of Code

[Aes_Sedia5]

Weregoose Is helping me learn to use boolean algebra instead of code in certain situations. If you would like to learn as well feel free to join in.
_________________

[Ashbad]

Well by "Logic Problems" instead of "Code", I think you mean to say "More densely-packed logic in code instead of using more structured, less efficient code". Both entities are code

But yes, densely-packed logic in code is really fun to work with; in many cases, if you drop conventional structure, you can use a lot less variables and lines of code and potentially make your code faster and more streamlined; however, the consequence is easy comprehensibility and readability.
_________________
-Ashbad

[Aes_Sedia5]

That is why I am learning it.
_________________

[Aes_Sedia5]

Tada. A movable sprite.

[souvik1997]

You'd probably want to wrap that in some kind of loop, so you can actually move it around.
_________________
CALCnet Tournament-38%


deviantArt

[lafferjm]

It is in a loop.
_________________

[Aes_Sedia5]

It wasn't in a loop. I put it in a loop as that was posted.
_________________

[tifreak8x]

Aes is simply updating his post instead of creating new ones after replies are being made, hence the confusion.
_________________
Projects: AOD Series: 70% | FFME: 80% | Pokemon: 18% | RPGSK: 60% | Star Trek: 70% | Star Trek 83+: 40% | TI-City: 5%

Look here for Assembly Resources.

[Aes_Sedia5]

Ok update. I was working on writing a program to display the Fibonacci number increasing till the calculator explodes.
Here is my code

[Ashbad]

Just as a hint to what might be going on, you only increment N by one in the loop -- from what I can see on Wikipedia about the Fibonacci Sequence, it should be incrementing by something less constant -- I'll leave the rest of the figuring out where and how to fix this to you
_________________
-Ashbad

[KermMartian]

I think you still don't understand the sequence. I'll say it again:

Each Fibonacci number is the sum of the two previous ones. The first two are 0 and 1

So 0, 1, [0+1]=2, [1+2]=3, [2+3]=5, [3+5]=8, [5+8]=13, ...
_________________

[Aes_Sedia5]

I understand that. That is why N-1 and N-2 are in there just as conditionals. would using abs be better for that?
_________________

[KermMartian]

[Aes_Sedia5]

OH it is the 2 previous Fibonacci numbers. I thought is was Just N-2 not N-2 on the fibonacci sequence. No wonder. thanks KErmM
_________________

[KermMartian]

[Weregoose]

You've gathered that the measure of increase towards the next number in the sequence as preordained by the present number would require an infinite chain of testing. Maybe this will solidify one approach:

Leonardo and Pisano are sitting at a table across from each other; between them, a bottomless bowl of jelly beans. Leonardo takes one and, knowing of his friend's jealousy, gently sets it down on the table. (Leonardo has 0+1=1, Pisano has 0.)

Pisano, who is more than a little proud, tells his companion, "I'll take as many as you have in your pile." With this, he swipes a jelly bean from the bowl and places it next to himself. (Leonardo has 1, Pisano has 0+1=1.)

Leonardo, taking delight in his alter ego's game, decides to reciprocate his behavior. "I'll take as many as you have in your pile," he says with a smile as he grabs yet another jelly bean from the bowl. (Leonardo has 1+1=2, Pisano has 1.)

Pisano, never to be outdone, makes his move without hesitation. "I'll take as many as you have in your pile!" he bellows as he reaches for two jelly beans and adds them to his first. (L:2, P:1+2=3)

Leonardo, unfazed as ever: "I'll take as many as you have in your pile." He looks at the three jelly beans from across the table, picks out as many from the bowl, and stashes them with his other two. (L:2+3=5, P:3)

Pisano, in full rivalry now, repeats his original utterance as he transfers five jelly beans from the bowl to his end of the table. (L:5, P:3+5=8)

Leonardo nonchalantly does the same, incorporating a heap as numerous as his opposition into his former pile of five. (L:5+8=13, P:8)

Pisano furiously tallies Leonardo's thirteen jelly beans and gathers a matching number from the bowl. (L:13, P:8+13=21)

Leonardo readily accumulates an additional twenty-one jelly beans from the center and slides them into his pile. (L:13+21=34, P:21)

Pisano takes 34. (L:34, P:21+34=55)

Leonardo acquires 55. (L:34+55=89, P:55)

And so on and so forth.

"Leonardo Pisano" is actually the full name of Fibonacci – you might have heard of him through these numbers. There is an endless supply of algorithms to create them, but this way is probably more familiar to a programmer. Now, go write some code!
_________________
Common Errors in English · How To Ask Questions The Smart Way

[Aes_Sedia5]

[KermMartian]

Don't look at the below if you don't want to see it; here's two possible solutions:

[Aes_Sedia5]

Program Update.
Redid my Synthetic division program using newly learned items. Here is what I have so far

[KermMartian]

Did you look at the two programs I posted for you related to your Fibonacci challenge and think about and understand how they work?
_________________