Great original concept and nifty OpenGL implementation! I added the following after: #include once "GL/glu.bi" to load different files more conveniently. DIM AS STRING filename DIM AS INTEGER ff = FreeFile() SCREENRES 300, 100, 32,, &h04 PRINT INPUT " filename? ", filename IF...

Nice generative tree generator - both code and result.

70 and 66.

You guys rock!

Thank you fxm for all the help and coding wisdom you give to others.

I expect some readers may have already recognized the patterns generated by ganache's and BasicCoder2's programs. The equation generates a Gumowski-Mira 'fractal', which was developed at CERN in 1980 to calculate the trajectories of sub-atomic particles. A long time ago I used FreeBASIC to generate ...

csde_rats is right. I think Zamaster created this example as a prototype / proof-of-concept. IMHO, I think what he coded in 2007 is excellent - as a concept. Implementing an encryption cipher is not trivial, even when meticulously following the official specs. However, this code example is dangerous...

Really good Joshy. The stirring smoothness and speed are impressive. OpenGL is a good move. (I believe Duke4e did a Jos Stam conversion in the forum a few years ago, which was good, but pixelated.) Processing, usually fast at graphics, can struggle with this sort of thing: http://www.openprocessing....

Excellent work TJF.

Perhaps this is the first Linux FreeBASIC compiler that can be installed via a package manager?

Being ARMv7, I assume this package works well on a Raspberry Pi 2 ?
If so, it might be good to mention this in your English and German documentation?

What a superb clone.

I wish only that you'd chosen a 'better' game to convert ... ;)

Hello Jason,

Looks impressive in the video - fast, smooth, nice background. Just a bit dark in the foreground.

Very promising.

Impressive and interesting program.

Did you create your data section in an ASCII art program, or do it from scratch?

Yes, an impressive program for its size.

Your site documentation is clear and neat.

The Standard Version's key size of 64-bits would bother me (re: DES cipher).
But looking at a contemporary stream cipher, Achterbahn, its lower version is only 80-bit (http://en.wikipedia.org/wiki/Achterbahn).

Would that be Playfair? http://en.wikipedia.org/wiki/Playfair_cipher The cipher was apparently quite good for the time, but "modern computers could easily break the cipher within seconds" symmetric-key stream-cipher I believe that, generally, you would want a block cipher for file storage ...

@nymair Yes, I agree. On my CentOS 6.5 32-bit, the following enabled FBC, FBC-GCC, and GUI-executable creation: cd <extracted_directory> sudo ./install.sh -i sudo yum install gcc sudo yum install ncurses-devel.i686 libX11-devel.i686 libXext-devel.i686 libXpm-devel.i686 libXrandr-devel.i686

@rollie
Yes, SHR should be the fastest way to divide by powers of 2, without resorting to ASM.
Ages ago, when I compared in FBC 0.18b (?), SHR was ~15% faster than using the equivalent division operator.

Multiplying by the reciprocal of the divisor is another way to avoid slow division.