This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Messages - zero44
16
« on: May 05, 2013, 08:02:40 am »
Maybe you could redirect any search entered to this " https://www.google.com/search?q=site%3Aomnimaga.org".$_POST['search'] (I don't know how it was managed, but a simple redirection should be ok, or include this page with an omnimaga header if you want)
17
« on: March 25, 2013, 03:53:12 pm »
I played a lot and it's often the same letters which are randomly displayed, so I already know what are the 7-letters words, and I wonder if the prog takes a random 7-letters word or if some letters set are already preset.
18
« on: March 24, 2013, 09:00:10 am »
Words ends like aient or issent are very often too long to fit in this game which takes only words from 3 to 7 letters.
But you're right, I could make a 'token' indicating which of these ends are possible : a,ai,as,at,e.
I just need to know now if there's a list of groups of random letters or if they are really random.
19
« on: March 21, 2013, 08:23:55 am »
Hi,
Thanks for keys.
I thought to port it to normal z80 calcs, and I found a way to take only 40% of the initial size !!!
But this is only theory, decoding algorithm will be easy to do if we want to check if a word exists, but I don't know how you do know how much words exists for each letter set.
I use the 2/3 firsts letters and the 15 most used letters in the languages, assiociated with custom tokens, to compress this amaaaazing thing. The 15 most used letters (in french ESANTIRULODCPMV, but it may vary) take 4 bits, endOfWord and the others 8 bits.
20
« on: March 21, 2013, 05:03:03 am »
Sorry everybody, I put the files in the root directory and it work almost perfectly.
What are the keys to start a new game / scroll answers ?
also I typed [tab] (answer) [a] , the 'a' appeared on the right side, a little too much to the top, and calc crashed when I pressed [clear].
But I'll try the newest version as sonn as possible, probably this afternoon (here in 4 hours)
21
« on: March 16, 2013, 08:00:55 am »
Still doesn't work on my Clickpad CAS ... I've around 3Mo left.
22
« on: March 09, 2013, 07:06:01 am »
I just opened the bmp files with mViewer, I don't know how the boxes are on non-CX. It said me something like : "failed to open *.bmp : Abort/Continue" and I continued 4 times. But when you click Abort it's fine. I think I could port it to z80, compressing dictionnaries to... 100 to 150kb  (enormous) EDIT: if it can help you, my calc showed during minutes the turning indicator (thing like a clock) with file explorer in background, keyboard was useless so I pulled a battery out.
23
« on: March 08, 2013, 01:59:57 pm »
Is it supposed to work on non-CX calcs ?
If yes, is there a specific directory in which files should be ?
And could you please edit pictures to make game playable in black/white, because I saw the background on my Clickpad and it seems very ugly and unplayable.
But it seems to be a nice job, continue like this ! I didn't know anything about this game, but dictionnaries seem pretty complete so maths will be less and less annoying (thanks to Ndless ^^ )
PS: my Clickpad is actually crashing, after failed to open the 4 pics.
24
« on: January 06, 2013, 03:12:09 pm »
I take the More or Less challenge. Will ask 3 times to enter a 0-9 char, each time, and will display ... "More" or "Less" because I decided to not be lazy. But it will take time, for sure. And I've done Nspire BASIC BF interpretor, with 30 000 cells like original BF, but it makes in 6'20" what my 84+ does in 4'' with Axe And BF interpretor in BF is about to be finished, I just have to add [] support.
25
« on: December 28, 2012, 04:51:32 pm »
Sorunome, now I have more stuff to do for you : •BF compiler to Axe source on z80 •BF interpertor in basic z80 •BF interpretor in basic nspire •BF interpretor in BF
26
« on: December 27, 2012, 08:39:55 am »
...
I'm asking me if you understood ...
I created an on-calc compiler, written in Axe, which takes a BrainFuck source code program (prgmBF) and automatically compiles it to an asm program (prgmCALCFUCK) which is veryveryvery fast : you cannot see it displaying letters, for Hello World. And this compiler takes care of [[]] loops, but the online-released version creates a crashing asm program with [][] loops (a bug I've fixed yet, but not released)
Keoni29 : GetCalc(Name,Size)→Pointer example : GetCalc("prgmBF",1600)→P
And to make it an asm program, you'll have to be serious... and read an hexadecimal assembly tutorial (a sort of thing which can say you some things like saying that $C9 returns and $21 assign the 2-bytes following value to HL ...
27
« on: December 26, 2012, 04:47:00 pm »
this is what I said, easy. in asm : > 2C increase L register < 2D decrease L + 56257E or somthing like this : take byte from address pointed by HL, increases and replace it - guess it . 7EEF0445 takes it to A and disps A as a char , nothing yet [ 7ECA**** jumps after ] if pointing zero ] 7EC2**** jumps after [ if pointing non-zero Easy, I said.
28
« on: December 26, 2012, 04:39:28 pm »
bf compiler which compiles to axe source ? for speed ? too easy and slow ^^ I'll surely do it. but I have a bf compiler which compiles directly to hexa asm that's epic .. you mean for example ++++++++ is compiled to +1+1+1+1+1+1+1+1 or to +8 ?
29
« on: December 26, 2012, 04:19:31 pm »
Yes, I made a break function too. Interpreter is fully complete (?) and supports ',' command, but it's badly done  I forgot to say that I added the * func (exit program) to the brainfuck, so when you compile a program it's recognized by parser as "hey, stop me NOW !"  But the input fonction doesn't work actually in the parser. And I fixed parser's loop bug, but not uploaded it .__.
30
« on: December 23, 2012, 03:55:36 pm »
Hey,
I made a parser and an emulator for BrainFuck language on calc.
Parser is not completed, so there are bugs : never use [][]
Feel free to send me bug reports / improvements ideas.
Enjoy
|
Show Posts