Now taking our algorithms from part one (the multi-branching) and putting them in a loop:


mov eax, (input value)
Again:

{Part 1 algorithm}


Target(N): ; make this the tail code for each branch

{Output (N)}

cmp eax, (end value) ; other kinds of loop end test are good too
jne Again
jmp EndT



EndT:
ret

What is the corelation between input values and the order the branches are executed? What interesting patterns can be generated?
Posted on 2003-07-19 00:41:11 by bitRAKE
BitRAKE,
I'm not sure whether I live on the same planet with you :) Because I have 20,00% in this elections (yes, 1 vote for nice exercise :grin: ), I would like to ask you for some suggestion, how to break it. Maybe I'm asking for trouble, because I'm not real coder, but I'll try it! :mad:
Posted on 2003-09-12 13:25:28 by MazeGen
Posted on 2003-09-12 21:16:45 by bitRAKE

Did you do part 1?

Yes I did ;) Perhaps is there another way? I think evwr showed the only approach... If he didn't, tell me and I'll think more about the puzzle 1...
Posted on 2003-09-13 11:10:31 by MazeGen