Fix some dates in examples index. 9/5/93 less wrong than 1/1/93.
Chris Pressey
4 years ago
9 | 9 | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
10 | 10 | Name License Author Date Notes |
11 | 11 | ---------------------------- --------- --------------------- ---------- ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
12 | [anagram.bf](anagram.bf) Kalyna Zazelenchuk 1/1/93 This program will input a string of sixteen characters or less, and (p)ut those characters in order on line 3 (the line with the \*'s). It will then randomly find numbers from 1 to 16, (g)et the characters at line 3 in random order, replace them with \*'s, and print them out. Effectively produces anagrams of words you type in. It uses the code from 'rand2.bf' to generate random numbers. | |
12 | [anagram.bf](anagram.bf) Kalyna Zazelenchuk 9/5/93 This program will input a string of sixteen characters or less, and (p)ut those characters in order on line 3 (the line with the \*'s). It will then randomly find numbers from 1 to 16, (g)et the characters at line 3 in random order, replace them with \*'s, and print them out. Effectively produces anagrams of words you type in. It uses the code from 'rand2.bf' to generate random numbers. | |
13 | 13 | |
14 | [aturley.bf](aturley.bf) CC0 Andrew Turley 1/1/2999 aturley's .sig; cellular automata gasket generator. | |
14 | [aturley.bf](aturley.bf) CC0 Andrew Turley ?/?/? aturley's .sig; cellular automata gasket generator. | |
15 | 15 | |
16 | 16 | [beer.bf](beer.bf) Kevin Vigor 4/9/97 A simple program that prints the "beer song" (99 bottles of beer on the wall...) from 99 down to 0. Part of the Beer Song archive. |
17 | 17 | |
35 | 35 | |
36 | 36 | [befbef.bf](befbef.bf) CC0 Wim Rijnders 5/12/97 A small subset Befunge-93 interpreter written in Befunge-93. Barely smart enough to execute the helloworld program within the \#-delimited block. Runs like a cow. |
37 | 37 | |
38 | [befbef2.bf](befbef2.bf) CC0 Wim Rijnders ?/?/00 A version of befbef.bf with some bugs (pointed out by Amir Karger) fixed. | |
38 | [befbef2.bf](befbef2.bf) CC0 Wim Rijnders ?/?/100 A version of befbef.bf with some bugs (pointed out by Amir Karger) fixed. | |
39 | 39 | |
40 | 40 | [befunge1.bf](befunge1.bf) Denis Moskowitz 7/17/97 Befunge logo source. |
41 | 41 | |
51 | 51 | |
52 | 52 | [cascade.bf](cascade.bf) CC0 Chris Pressey 7/20/97 Like copyme.bf, but continues to replicate itself. |
53 | 53 | |
54 | [chars.bf](chars.bf) Kalyna Zazelenchuk 1/1/93 Generates a printable ASCII table, with characters and corresponding codes in decimal, from 34 to 127. | |
54 | [chars.bf](chars.bf) Kalyna Zazelenchuk 9/5/93 Generates a printable ASCII table, with characters and corresponding codes in decimal, from 34 to 127. | |
55 | 55 | |
56 | 56 | [chars2.bf](chars2.bf) ??? ?/?/9? Modified version of chars.bf that was distributed as chars.bf for the longest time. Outputs all chars on 1 line. Program is 3 rows tall instead of 2. Unclear who made these modifications, or why. |
57 | 57 | |
59 | 59 | |
60 | 60 | [copyme.bf](copyme.bf) CC0 Wim Rijnders 6/5/97 Program which reproduces itself in Befunge-space. |
61 | 61 | |
62 | [digitalr.bf](digitalr.bf) Keymaker 9/3/08 Computes the digital root (see numer.bf) of the input. | |
62 | [digitalr.bf](digitalr.bf) Keymaker 9/3/108 Computes the digital root (see numer.bf) of the input. | |
63 | 63 | |
64 | 64 | [dladv.bf](dladv.bf) CC0 Dmitry M Litvinov 12/1/96 A minimalist adventure game.\ |
65 | 65 | n - go north\ |
69 | 69 | d - dress\ |
70 | 70 | l - labour |
71 | 71 | |
72 | [drx.bf](drx.bf) CC0 Chris Pressey 1/1/93 "Like Eliza, except better :-)" | |
72 | [drx.bf](drx.bf) CC0 Chris Pressey 9/5/93 "Like Eliza, except better :-)" | |
73 | 73 | |
74 | [ea.bf](ea.bf) CC0 Chris Pressey 1/1/93 Makes 'enigmatic aphorisms.' A loose interpretation of a program in '1001 things to do with your Commodore 64.' This is an example of how to simulate a 'gosub' with a value. | |
74 | [ea.bf](ea.bf) CC0 Chris Pressey 9/5/93 Makes 'enigmatic aphorisms.' A loose interpretation of a program in '1001 things to do with your Commodore 64.' This is an example of how to simulate a 'gosub' with a value. | |
75 | 75 | |
76 | [easm.bf](easm.bf) CC0 Chris Pressey 1/1/93 Same as 'ea.bf', but uses self-modifying code. | |
76 | [easm.bf](easm.bf) CC0 Chris Pressey 9/5/93 Same as 'ea.bf', but uses self-modifying code. | |
77 | 77 | |
78 | 78 | [euclid.bf](euclid.bf) Greg Wright 6/5/97 Euclidean algorithm. |
79 | 79 | |
80 | [fact.bf](fact.bf) CC0 Chris Pressey 1/1/93 Asks for a number, and supplies the factorial of that number. | |
80 | [fact.bf](fact.bf) CC0 Chris Pressey 9/5/93 Asks for a number, and supplies the factorial of that number. | |
81 | 81 | |
82 | 82 | [fact2.bf](fact2.bf) Jason Reed 5/18/97 Factorial generator, (3x12) |
83 | 83 | |
84 | 84 | [fact3.bf](fact3.bf) Chris Lahey 6/8/97 (23x1) factorial generator. |
85 | 85 | |
86 | [hello.bf](hello.bf) CC0 Chris Pressey 1/1/93 The ubiquitous "Hello, World!" program. | |
86 | [hello.bf](hello.bf) CC0 Chris Pressey 9/5/93 The ubiquitous "Hello, World!" program. | |
87 | 87 | |
88 | [hex.bf](hex.bf) CC0 Chris Pressey 1/1/93 Translates ASCII input into hex output. | |
88 | [hex.bf](hex.bf) CC0 Chris Pressey 9/5/93 Translates ASCII input into hex output. | |
89 | 89 | |
90 | [hwii.bf](hwii.bf) CC0 Chris Pressey 1/1/93 Prints out "Hello, World!' forwards, then backwards, then forwards, etc. Demonstrates how one can so easily change the direction of the PC to support their own wicked desires. | |
90 | [hwii.bf](hwii.bf) CC0 Chris Pressey 9/5/93 Prints out "Hello, World!' forwards, then backwards, then forwards, etc. Demonstrates how one can so easily change the direction of the PC to support their own wicked desires. | |
91 | 91 | |
92 | [kmquine.bf](kmquine.bf) Keymaker 9/3/08 The first of a series of really fine quines (self-printing programs) by Keymaker. | |
92 | [kmquine.bf](kmquine.bf) Keymaker 9/3/108 The first of a series of really fine quines (self-printing programs) by Keymaker. | |
93 | 93 | |
94 | [kmquine2.bf](kmquine2.bf) Keymaker 9/3/08 The second of a series of really fine quines by Keymaker. | |
94 | [kmquine2.bf](kmquine2.bf) Keymaker 9/3/108 The second of a series of really fine quines by Keymaker. | |
95 | 95 | |
96 | [kmquine3.bf](kmquine3.bf) Keymaker 9/3/08 The third of a series of really fine quines by Keymaker. | |
96 | [kmquine3.bf](kmquine3.bf) Keymaker 9/3/108 The third of a series of really fine quines by Keymaker. | |
97 | 97 | |
98 | 98 | [life.bf](life.bf) CC0 Dmitry M Litvinov 6/1/97 An implementation of John Conway's game of Life. |
99 | 99 | |
101 | 101 | |
102 | 102 | [mandel.bf](mandel.bf) Chris Lahey 4/11/97 A Mandelbrot fractal generator. |
103 | 103 | |
104 | [maze.bf](maze.bf) CC0 Chris Pressey 1/1/93 A conversion of a Commodore-64 graphical pastime: a dead-simple random maze generator. | |
104 | [maze.bf](maze.bf) CC0 Chris Pressey 9/5/93 A conversion of a Commodore-64 graphical pastime: a dead-simple random maze generator. | |
105 | 105 | |
106 | 106 | [namegame.bf](namegame.bf) CC0 Dmitry M Litvinov 2/1/96 "First, example easy writed stupid prog." Befunge bypasses cultural and lingual backgrounds. Try this "easily written" program and see what it does. |
107 | 107 | |
108 | [numer.bf](numer.bf) CC0 Chris Pressey 1/1/93 Produces single-digit numerological equivalents of words you type in. (Users should be warned that the significance of the output of this program is of extremely questionable practical value. But it is consistant.) (This algorithm is also known as the "digital root".) | |
108 | [numer.bf](numer.bf) CC0 Chris Pressey 9/5/93 Produces single-digit numerological equivalents of words you type in. (Users should be warned that the significance of the output of this program is of extremely questionable practical value. But it is consistant.) (This algorithm is also known as the "digital root".) | |
109 | 109 | |
110 | 110 | [pairing.bf](pairing.bf) Aaron Dale 3/20/97 A program to implement the "pairing function" (\<x1,x2\> = (2\^(x1) \* (2\*(x2) + 1)) - 1), which maps any two natural numbers onto the set of natural numbers, without repetition. |
111 | 111 | |
112 | [pangram.bf](pangram.bf) CC0 Chris Pressey 8/25/12 Checks if the first line of input is a pangram -- a sentence which contains all the letters of the alphabet, such as "The quick brown fox jumps over the lazy dog" or "Pack my lunch box with five dozen liquor jugs." Case-insensitive, and ignores most punctuation, but "high" punctuation (above ASCII character 90) will likely confuse it. | |
112 | [pangram.bf](pangram.bf) CC0 Chris Pressey 8/25/112 Checks if the first line of input is a pangram -- a sentence which contains all the letters of the alphabet, such as "The quick brown fox jumps over the lazy dog" or "Pack my lunch box with five dozen liquor jugs." Case-insensitive, and ignores most punctuation, but "high" punctuation (above ASCII character 90) will likely confuse it. | |
113 | 113 | |
114 | 114 | [pascserp.bf](pascserp.bf) CC0 Chris Pressey 7/12/97 Generates a gasket (Serpinsky triangle) using Pascal's Triangle. |
115 | 115 | |
117 | 117 | |
118 | 118 | [pi2.bf](pi2.bf) Kevin Vigor 7/2/97 Generates the first hundred digits of Pi. It does this not by cheating, but actually calculating Pi; unfortunately it far exceeds 100 characters of Befunge code. |
119 | 119 | |
120 | [prime.bf](prime.bf) Kalyna Zazelenchuk 1/1/93 Lists the counting numbers incrementally from one and checks if each is prime. | |
120 | [prime.bf](prime.bf) Kalyna Zazelenchuk 9/5/93 Lists the counting numbers incrementally from one and checks if each is prime. | |
121 | 121 | |
122 | [rand.bf](rand.bf) Chris Pressey 1/1/93 Generates random numbers between 1 and 9 as statistically evenly distributed as the computer's random number generator. | |
122 | [rand.bf](rand.bf) Chris Pressey 9/5/93 Generates random numbers between 1 and 9 as statistically evenly distributed as the computer's random number generator. | |
123 | 123 | |
124 | 124 | [rand10.bf](rand10.bf) Ken Bateman 4/12/97 A 3x10 random number generator. |
125 | 125 | |
133 | 133 | |
134 | 134 | [rand15.bf](rand15.bf) Artyom Baranov 4/5/96 THE smallest Befunge RNG-16. (16x1) |
135 | 135 | |
136 | [rand2.bf](rand2.bf) Kalyna Zazelenchuk 1/1/93 This program, crammed into a 14x14 block, makes random numbers from 1 to 16 using multiple "?" statements. | |
136 | [rand2.bf](rand2.bf) Kalyna Zazelenchuk 9/5/93 This program, crammed into a 14x14 block, makes random numbers from 1 to 16 using multiple "?" statements. | |
137 | 137 | |
138 | [rand3.bf](rand3.bf) Chris Pressey 1/1/93 12x9 random number generator, like rand.bf and rand2.bf. | |
138 | [rand3.bf](rand3.bf) Chris Pressey 9/5/93 12x9 random number generator, like rand.bf and rand2.bf. | |
139 | 139 | |
140 | 140 | [rand4.bf](rand4.bf) Matthew D Moss 2/1/96 A 7x7 random number generator in the tradition of rand.bf .. rand3.bf, but using mathematics to reduce the problem before writing the code |
141 | 141 | |
153 | 153 | |
154 | 154 | [rdp2.bf](rdp2.bf) Kimberley Burchette 12/1/96 A version of rdp.bf crammed into a 23x12 block. |
155 | 155 | |
156 | [robot.bf](robot.bf) CC0 Chris Pressey 1/1/93 You control an 'O' going through a maze of '\*''s. You can type in 'n', 's', 'e', or 'w', and the 'O' travels in that map direction. This not-particularly-challenging game ends when you hit a '\*'. | |
156 | [robot.bf](robot.bf) CC0 Chris Pressey 9/5/93 You control an 'O' going through a maze of '\*''s. You can type in 'n', 's', 'e', or 'w', and the 'O' travels in that map direction. This not-particularly-challenging game ends when you hit a '\*'. | |
157 | 157 | |
158 | 158 | [rot13.bf](rot13.bf) ??? 9/11/97 Performs the rot13 algorithm. |
159 | 159 | |
165 | 165 | |
166 | 166 | [selflis6.bf](selflis6.bf) Denis Moskowitz 5/8/97 14-byte quine. |
167 | 167 | |
168 | [selflist.bf](selflist.bf) ??? 12/1/196 A self-reproducing Befunge program, 13x4. | |
168 | [selflist.bf](selflist.bf) ??? ?/?/? A self-reproducing Befunge program, 13x4. | |
169 | 169 | |
170 | 170 | [serp.bf](serp.bf) Kevin Vigor 4/9/97 Generates and prints a Serpinsky triangle, a simple type of fractal. Since the resolution is 20x30, the detail of the fractal isn't really visible, but hey, what can you do? |
171 | 171 | |
174 | 174 | [sinus.bf](sinus.bf) CC0 Dmitry M Litvinov 12/1/96 Program to generate sine wave patterns.\ |
175 | 175 | Based on cos(a+b)=cos(a)\*cos(b)-sin(a)\*sin(b) and sin(a+b)=sin(a)\*cos(b)+cos(a)\*sin(b). sin and cos values are kept in one stack cell = abs(sin) \* 2\^16 + abs(cos) |
176 | 176 | |
177 | [sort.bf](sort.bf) Kalyna Zazelenchuk 1/1/93 Same as anagram.bf, except sorts the letters of your word in ascending order. | |
177 | [sort.bf](sort.bf) Kalyna Zazelenchuk 9/5/93 Same as anagram.bf, except sorts the letters of your word in ascending order. | |
178 | 178 | |
179 | 179 | [surprise.bf](surprise.bf) ??? 6/1/97 A big surprise. |
180 | 180 | |
181 | 181 | [switchbx.bf](switchbx.bf) Zach Baker 7/10/97 A real purty 'switch' statement. |
182 | 182 | |
183 | [testbrdg.bf](testbrdg.bf) CC0 Chris Pressey 10/27/11 Tests whether the \# instruction interacts properly with wrapping. | |
183 | [testbrdg.bf](testbrdg.bf) CC0 Chris Pressey 10/27/111 Tests whether the \# instruction interacts properly with wrapping. | |
184 | 184 | |
185 | [testmodu.bf](testmodu.bf) CC0 Chris Pressey 8/23/11 Tests how your implementation of Befunge-93 calculates modulus (there is no right way.) | |
185 | [testmodu.bf](testmodu.bf) CC0 Chris Pressey 8/23/111 Tests how your implementation of Befunge-93 calculates modulus (there is no right way.) | |
186 | 186 | |
187 | [toupper.bf](toupper.bf) CC0 Chris Pressey 9/1/93 Converts letters to upper-case. An example of the \` (greater) statement. | |
187 | [toupper.bf](toupper.bf) CC0 Chris Pressey 9/5/93 Converts letters to upper-case. An example of the \` (greater) statement. | |
188 | 188 | |
189 | 189 | [wumpus.bf](wumpus.bf) CC0 Wim Rijnders 8/15/97 The classic game of Hunt the Wumpus! |
190 | 190 | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |