|
996
|
1 Note that these examples mostly come from other sources. I have not written
|
|
|
2 most of them myself.
|
|
|
3
|
|
|
4 Those that are known:
|
|
|
5 * From http://catseye.tc/projects/befunge93/eg/INDEX.html :
|
|
|
6 * dladv.bf Simple (or rather minimal!) adventure game in Befunge93.
|
|
|
7 * life.bf Game of life in Befunge93.
|
|
|
8 * pi2.bf Generate first 100 digits of Pi.
|
|
|
9 * prime.bf Print all prime numbers up to 254.
|
|
|
10 * robot.b93 A simple game in Befunge93. Note this one does NOT work in
|
|
|
11 Befunge98 mode due to space in string issues.
|
|
|
12 Run with -s 93 option to cfunge.
|
|
|
13 * wumpus.bf Hunt the wumpus in Befunge93
|
|
|
14 * My own ones (all GPL3 with proxy like the main code):
|
|
|
15 * hello-concurrent1.b98
|
|
|
16 Use two threads to print hello world, uses several "mutexes" to lock.
|
|
|
17 For this example to work the interpreter must be compiled with concurrency.
|
|
|
18 * hello-concurrent2.b98
|
|
|
19 A lock free version of the above.
|
|
|
20 For this example to work the interpreter must be compiled with concurrency.
|
|
|
21 * roman.b98
|
|
|
22 This shows an example of how to use fingerprints. Also valid in unefunge98.
|
|
|
23 * count.b98
|
|
|
24 This one just asks for a number to be input, then prints all numbers from
|
|
|
25 1 up to (and including) that number. The number entered should be positive.
|
|
|
26 Unknown ones:
|
|
|
27 * fib.bf
|
|
|
28 Calculate the n-th element in the Fibonacci sequence.
|
|
|
29 * hello.bf
|
|
|
30 Standard Hello world, done in the most simple way possible.
|
