flat assembler
Message board for the users of flat assembler.
![]() |
Author |
|
UCM 19 Feb 2006, 18:48
I wrote an anagram solver, about a year ago *1.
In fact, the only problem was the function to calculate the string length. So, about a week ago, I decided to use OllyDbg (lol) and I replaced it with a new algorithm. Now it works!! ![]() Any critism, suggestions or comments welcomed. EDIT: You need a dictionary with this program - called dictionary.txt. Each word should be separated with a NUL character and should have 1 NUL character at the end. The add_words macro adds missing words and adds the extra 0 at the end. *1. to Matrix, remember the 1 byte bubblesort?
_________________ This calls for... Ultra CRUNCHY Man! Ta da!! *crunch* |
|||||||||||
![]() |
|
Crukko 19 Feb 2006, 19:32
If you can, always add the .exe too
![]() both .exe & .asm in a .rar.....I think will be better |
|||
![]() |
|
Madis731 19 Feb 2006, 19:39
...and some example dictionary.txt AND a resource file that its looking for, thanks
![]() |
|||
![]() |
|
UCM 19 Feb 2006, 19:49
it's too big. grr.
download the dictionary from http://www.codehappy.net/wordlist.htm and convert it (it uses CRLF to separate words) and strip off most of the end. _________________ This calls for... Ultra CRUNCHY Man! Ta da!! *crunch* |
|||
![]() |
|
UCM 19 Feb 2006, 19:50
it's too big. grr.
download the dictionary from http://www.codehappy.net/wordlist.htm and convert it (it uses CRLF to separate words) and strip off most of the end. the resource file is attached, sorry i forgot EDIT: ooops, sorry for the last post
_________________ This calls for... Ultra CRUNCHY Man! Ta da!! *crunch* |
|||||||||||
![]() |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2025, Tomasz Grysztar. Also on GitHub, YouTube.
Website powered by rwasa.