flat assembler
Message board for the users of flat assembler.
![]() |
Author |
|
revolution 27 Dec 2016, 11:56
fasm does not guarantee to find all solutions.
IIRC the general solution would require on the order of O(2^N) iterations to solve. The algorithm fasm uses does not try all possibilities, it uses short cuts and assumptions. Otherwise for more complex code fasm might never find a solution within the lifetime of the universe. |
|||
![]() |
|
l4m2 27 Dec 2016, 14:00
Code: if a=1 a=1 else a=0 end if if b=1 b=1 else b=0 end if if c=1 c=1 else c=0 end if if (a>0 & (a=0 | b=0) & (c>0 & b>0)) | f>0 f=0 else f=1 end if so (a>0 & (a=0 | b=0) & (c>0 & b>0)) must be 1? |
|||
![]() |
|
l4m2 27 Dec 2016, 14:05
Code: if a<64 a=a+1 else a=a end if It makes "66 passes". I tested and got that there's at most 100 passes. Can I modify it in fasmw? Quote: In the command line you can also include -m option followed by a number, which |
|||
![]() |
|
l4m2 27 Dec 2016, 14:22
Code: display 48+a a = 6 if t<3 a = 8 end if t = 7 a is only given the value 6 but the a=8 makes it uncomilable |
|||
![]() |
|
revolution 27 Dec 2016, 15:45
Also note that sometimes there is more than one solution, and fasm will stop when it finds one. So other solutions might exist, but fasm won't find them.
BTW: Using the search function you might be able to find a few older threads where this has all been covered before. |
|||
![]() |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2023, Tomasz Grysztar. Also on GitHub, YouTube, Twitter.
Website powered by rwasa.