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 - calcdude84se
Pages: 1 ... 57 58 [59] 60 61 ... 161
871
« on: November 25, 2010, 06:33:29 pm »
Even if he didn't, now you can  * calcdude loves open-source for this.
872
« on: November 25, 2010, 04:58:48 pm »
I have some Axe hex - but they aren't really in grayscale, nor do I have pictures, sorry.
(My bold) I added the pictures 
873
« on: November 25, 2010, 03:33:29 pm »
kindermoumoute, his hex is fine  The first is actually a sleigh, but the second is a reindeer. Here are pictures: Edit: Here are larger versions:
874
« on: November 25, 2010, 02:34:02 pm »
887. You overclock your calculator with coffee.
875
« on: November 25, 2010, 11:30:34 am »
You work with bytes, not nibbles (A nibble is four bits. There are two nibbles to a byte.)
Also, Copy( works like "Copy(SOURCE,DESTINATION,SIZE)"
So your first code segment is actually this:
For(Z,0,63)
Copy(Z*8+L1,Z*12+L6,8)
EndYou have 64 rows, numbered 0-63. 64 bits are 8 bytes, so we multiply Z by 8 then add it to L1. A row on the screen is 96 bits (and therefore 96/8=12 bytes), so we multiply Z by 12 and add L6. The 8 is for the same reason as two sentences ago.
You cannot work directly with bits for the most part. [F32C] is like this, actually:
11110011
00101100To manipulate bits, you need to use e (Euler's e) and e^(
e works like this:
b00100000e2which returns 1 because the 2nd bit, from left to right, indexed from 0, is a 1.
e^( works like this:
e^(5)which returns b00100000 because the 1 is in the 5th position, from right to left, indexed from 0.
Edit: ninja'd...
876
« on: November 24, 2010, 09:06:02 pm »
Cool Can't wait for more features!
877
« on: November 24, 2010, 06:42:32 pm »
I saw you talking about this on IRC for Downsider. I might try it out later
878
« on: November 24, 2010, 06:09:12 pm »
You can, but it says "Invalid number" or something to that effect, IIRC.
879
« on: November 24, 2010, 05:21:06 pm »
prgmMAZE is a backtracking maze generator. When there are no available spots to carve, it backtracks until there is an open space. Because of memory limitations, large mazes will start writing outside of saferam: be careful if you decide to adjust the size! (to do this, recompile with different values for L and W.) DJ, mine won't corrupt RAM 
881
« on: November 24, 2010, 04:56:06 pm »
Thanks I should port this to Axe, because it would only need about 100 bytes of RAM to store data for the maze while generating it (outside of the graphscreen, of course) I'll do that when I have the time
882
« on: November 23, 2010, 09:32:15 pm »
Might as well upload one of my old BASIC creations, especially since someone's made an Axe one This one is based on Eller's Algorithm ( http://www.astrolog.org/labyrnth/algrithm.htm#perfect, scroll down a bit) When you start it it asks for four numbers: How long it should be (X), How wide it should be (Y), and chances for carving vertically and horizontally (give as a decimal, not a percent ) I'm sure if Weregoose looked at it he could find numerous optimizations  It can generate a full-screen maze in a few minutes. I've included two screenshots: one of it generating a 48*32 maze (for the impatient among you ) and one of a full maze. Enjoy! (Yeah, it's slow, but whatever )
883
« on: November 23, 2010, 08:31:44 pm »
That's annoying >.> Also, one can guess 0 or 31-99 and it won't complain.  Otherwise,
884
« on: November 23, 2010, 08:25:32 pm »
Most C compilers are written in C
885
« on: November 23, 2010, 08:22:11 pm »
I agree with ztrumpet, it looks great Can't wait to try it!
Pages: 1 ... 57 58 [59] 60 61 ... 161
|
Show Posts
