git @ Cat's Eye Technologies Befunge-93 / rel_2_23_2014_0820
Convert example source index to Markdown. --HG-- rename : eg/index.html => eg/README.markdown catseye 8 years ago
2 changed file(s) with 189 addition(s) and 622 deletion(s). Raw diff Collapse all Expand all
0 Befunge-93 Example Programs
1 ===========================
2
3 Entries which have a **CC0** in the **License** column are in the public
4 domain, under the Creative Commons CC0 Public Domain Dedication. All
5 others are freely redistributable in this archive, but remain
6 copyrighted by their original authors. See the file LICENSE for more
7 information.
8
9 -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
10 Name License Author Date Notes
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.
13
14 [aturley.bf](aturley.bf) CC0 Andrew Turley 1/1/2999 aturley's .sig; cellular automata gasket generator.
15
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
18 [beer10.bf](beer10.bf) Chris Lahey 6/8/97 A squashed (22x10) beer singing program, gramatically correct.
19
20 [beer2.bf](beer2.bf) Keith Arner 4/10/97 Another "99 Bottles of Beer" program.
21
22 [beer3.bf](beer3.bf) Chris Lahey 4/11/97 Another singing algorithm.
23
24 [beer4.bf](beer4.bf) Denis Moskowitz 4/11/97 Yet another singing algorithm.
25
26 [beer5.bf](beer5.bf) David Johnston 4/11/97 Another singing program.
27
28 [beer6.bf](beer6.bf) Chris Lahey 4/11/97 A crammed (14x21) singing program.
29
30 [beer7.bf](beer7.bf) CC0 Wim Rijnders 5/2/97 A beer bottling program.
31
32 [beer8.bf](beer8.bf) CC0 Wim Rijnders 5/12/97 Again with the bottles.
33
34 [beer9.bf](beer9.bf) David Johnston 5/13/97 Crammed (22x9) singing beer program which doesn't use good grammar or punctuation.
35
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
38 [befbef2.bf](befbef2.bf) CC0 Wim Rijnders ?/?/00 A version of befbef.bf with some bugs (pointed out by Amir Karger) fixed.
39
40 [befunge1.bf](befunge1.bf) Denis Moskowitz 7/17/97 Befunge logo source.
41
42 [befunge2.bf](befunge2.bf) Sam Holden 7/17/97 Befunge logo source.
43
44 [befunge3.bf](befunge3.bf) Ben Olmstead 7/18/97 Befunge logo source.
45
46 [befunge4.bf](befunge4.bf) Kevin Vigor 8/13/97 Befunge logo source.
47
48 [befungex.bf](befungex.bf) Kevin Vigor 7/18/97 Non-standard (oversize) Befunge logo source.
49
50 [calc.bf](calc.bf) Bryan L 4/10/97 This is a befunged calculator. Meaning ".", the print command, will also pop the result off the stack. Fortunately, the duplication command ":" is supported. This calculator will blithely ignore anything that isn't a number or a supported command. The list of commands is found on line 3.
51
52 [cascade.bf](cascade.bf) CC0 Chris Pressey 7/20/97 Like copyme.bf, but continues to replicate itself.
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.
55
56 [copyme.bf](copyme.bf) CC0 Wim Rijnders 6/5/97 Program which reproduces itself in Befunge-space.
57
58 [digitalr.bf](digitalr.bf) Keymaker 9/3/08 Computes the digital root (see numer.bf) of the input.
59
60 [dladv.bf](dladv.bf) CC0 Dmitry M Litvinov 12/1/96 A minimalist adventure game.\
61 n - go north\
62 s - go south\
63 e - go east\
64 w - go west\
65 d - dress\
66 l - labour
67
68 [drx.bf](drx.bf) CC0 Chris Pressey 1/1/93 "Like Eliza, except better :-)"
69
70 [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.
71
72 [easm.bf](easm.bf) CC0 Chris Pressey 1/1/93 Same as 'ea.bf', but uses self-modifying code.
73
74 [euclid.bf](euclid.bf) Greg Wright 6/5/97 Euclidean algorithm.
75
76 [fact.bf](fact.bf) CC0 Chris Pressey 1/1/93 Asks for a number, and supplies the factorial of that number.
77
78 [fact2.bf](fact2.bf) Jason Reed 5/18/97 Factorial generator, (3x12)
79
80 [fact3.bf](fact3.bf) Chris Lahey 6/8/97 (23x1) factorial generator.
81
82 [hello.bf](hello.bf) CC0 Chris Pressey 1/1/93 The ubiquitous "Hello, World!" program.
83
84 [hex.bf](hex.bf) CC0 Chris Pressey 1/1/93 Translates ASCII input into hex output.
85
86 [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.
87
88 [kmquine.bf](kmquine.bf) Keymaker 9/3/08 The first of a series of really fine quines (self-printing programs) by Keymaker.
89
90 [kmquine2.bf](kmquine2.bf) Keymaker 9/3/08 The second of a series of really fine quines by Keymaker.
91
92 [kmquine3.bf](kmquine3.bf) Keymaker 9/3/08 The third of a series of really fine quines by Keymaker.
93
94 [life.bf](life.bf) CC0 Dmitry M Litvinov 6/1/97 An implementation of John Conway's game of Life.
95
96 [madd.bf](madd.bf) Greg Wright 6/5/97 3x3-Matrix Addition
97
98 [mandel.bf](mandel.bf) Chris Lahey 4/11/97 A Mandelbrot fractal generator.
99
100 [maze.bf](maze.bf) CC0 Chris Pressey 1/1/93 A conversion of a Commodore-64 graphical pastime: a dead-simple random maze generator.
101
102 [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.
103
104 [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".)
105
106 [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.
107
108 [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.
109
110 [pascserp.bf](pascserp.bf) CC0 Chris Pressey 7/12/97 Generates a gasket (Serpinsky triangle) using Pascal's Triangle.
111
112 [pi.bf](pi.bf) Ben Olmstead 6/25/97 Produces the first hundred digits of pi in under one hundred characters of Befunge, but cheats in that it simply decompresses the digits encoded in the source code.
113
114 [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.
115
116 [prime.bf](prime.bf) Kalyna Zazelenchuk 1/1/93 Lists the counting numbers incrementally from one and checks if each is prime.
117
118 [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.
119
120 [rand10.bf](rand10.bf) Ken Bateman 4/12/97 A 3x10 random number generator.
121
122 [rand11.bf](rand11.bf) Ken Bateman 4/12/97 A 5x7 flexible random number generator. The number of bits is set with the 88+ at the top left. As shown this program will generate a random number from 0 to 32767.
123
124 [rand12.bf](rand12.bf) Ben Olmstead 4/24/97 A 2x13, 0..255 random number generator.
125
126 [rand13.bf](rand13.bf) Ben Olmstead 4/24/97 A 2x12, infinitely looping 0..31 random number generator.
127
128 [rand14.bf](rand14.bf) Greg Wright 5/18/97 4x7 random number generator.
129
130 [rand15.bf](rand15.bf) Artyom Baranov 4/5/96 THE smallest Befunge RNG-16. (16x1)
131
132 [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.
133
134 [rand3.bf](rand3.bf) Chris Pressey 1/1/93 12x9 random number generator, like rand.bf and rand2.bf.
135
136 [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
137
138 [rand5.bf](rand5.bf) CC0 Dmitry M Litvinov 2/1/96 A 4x10 random number generator which produces the same output as rand.bf .. rand4.bf. Unlike most Befunge sources this one has a symmetrical beauty to it.
139
140 [rand6.bf](rand6.bf) Artyom Baranov? 12/1/96 An 8x4 random number generator a la rand5.bf.
141
142 [rand7.bf](rand7.bf) ??? 12/1/96 A 13x3 random number generator a la rand5.bf and rand6.bf.
143
144 [rand8.bf](rand8.bf) Chris Howe 4/9/97 A 4x9 flexible random number generator; if you change the 4 in position (1,2) to another integer n it will generate a number between 1 and 2\^n (inclusive) for 0\<n\<9.
145
146 [rand9.bf](rand9.bf) Chris Lahey 4/11/97 A 3x7 random number generator.
147
148 [rdp.bf](rdp.bf) CC0 Dmitry M Litvinov 2/1/96 A command-line calculator with postfix notation.
149
150 [rdp2.bf](rdp2.bf) Kimberley Burchette 12/1/96 A version of rdp.bf crammed into a 23x12 block.
151
152 [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 '\*'.
153
154 [rot13.bf](rot13.bf) ??? 9/11/97 Performs the rot13 algorithm.
155
156 [selflis2.bf](selflis2.bf) CC0 Chris Pressey 12/1/96 A self-reproducing 80x1 program. This program can also be used to test for the @ vs StringMode bug.
157
158 [selflis3.bf](selflis3.bf) Kevin Vigor 5/28/97 A 14-byte Quine (self-reproducing program.)
159
160 [selflis5.bf](selflis5.bf) David Johnston 5/7/97 Crammed (14x6) self-listing program.
161
162 [selflis6.bf](selflis6.bf) Denis Moskowitz 5/8/97 14-byte quine.
163
164 [selflist.bf](selflist.bf) ??? 12/1/196 A self-reproducing Befunge program, 13x4.
165
166 [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?
167
168 [serp2.bf](serp2.bf) Kevin Vigor 4/10/97 Improved Serpinsky Triangle generator.
169
170 [sinus.bf](sinus.bf) CC0 Dmitry M Litvinov 12/1/96 Program to generate sine wave patterns.\
171 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)
172
173 [sort.bf](sort.bf) Kalyna Zazelenchuk 1/1/93 Same as anagram.bf, except sorts the letters of your word in ascending order.
174
175 [surprise.bf](surprise.bf) ??? 6/1/97 A big surprise.
176
177 [switchbx.bf](switchbx.bf) Zach Baker 7/10/97 A real purty 'switch' statement.
178
179 [testbrdg.bf](testbrdg.bf) CC0 Chris Pressey 10/27/11 Tests whether the \# instruction interacts properly with wrapping.
180
181 [testmodu.bf](testmodu.bf) CC0 Chris Pressey 8/23/11 Tests how your implementation of Befunge-93 calculates modulus (there is no right way.)
182
183 [toupper.bf](toupper.bf) CC0 Chris Pressey 9/1/93 Converts letters to upper-case. An example of the \` (greater) statement.
184
185 [wumpus.bf](wumpus.bf) CC0 Wim Rijnders 8/15/97 The classic game of Hunt the Wumpus!
186 -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
187
188
+0
-622
eg/index.html less more
0 <!DOCTYPE html>
1 <html>
2 <head>
3 <title>Cat's Eye Technologies: Befunge Source Code (*.bf)</TITLE>
4 <meta http-equiv="Content-Type" content="text/html;CHARSET=iso-8859-1">
5 </head>
6 <body>
7 <h1>Befunge-93 Example Programs</h1>
8
9 <p>Entries which have a <b>CC0</b> in the <b>License</b> column are in the
10 public domain, under the Creative Commons CC0 Public Domain Dedication.
11 All others are freely redistributable in this archive, but remain
12 copyrighted by their original authors. See the file LICENSE for more
13 information.</p>
14
15 <table border="1" width="100%"><tr>
16 <th>Name</th>
17 <th>License</th>
18 <th>Author</th>
19 <th>Date</th>
20 <th>Notes</th>
21 </tr>
22 <tr>
23 <td><a href="anagram.bf">anagram.bf</a></td>
24 <td></td>
25 <td>Kalyna Zazelenchuk</td>
26 <td>1/1/93</td>
27 <td>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.</td>
28 </tr>
29 <tr>
30 <td><a href="aturley.bf">aturley.bf</a></td>
31 <td>CC0</td>
32 <td>Andrew Turley</td>
33 <td>1/1/2999</td>
34 <td>aturley's .sig; cellular automata gasket generator.</td>
35 </tr>
36 <tr>
37 <td><a href="beer.bf">beer.bf</a></td>
38 <td></td>
39 <td>Kevin Vigor</td>
40 <td>4/9/97</td>
41 <td>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.</td>
42 </tr>
43 <tr>
44 <td><a href="beer10.bf">beer10.bf</a></td>
45 <td></td>
46 <td>Chris Lahey</td>
47 <td>6/8/97</td>
48 <td>A squashed (22x10) beer singing program, gramatically correct.</td>
49 </tr>
50 <tr>
51 <td><a href="beer2.bf">beer2.bf</a></td>
52 <td></td>
53 <td>Keith Arner</td>
54 <td>4/10/97</td>
55 <td>Another "99 Bottles of Beer" program.</td>
56 </tr>
57 <tr>
58 <td><a href="beer3.bf">beer3.bf</a></td>
59 <td></td>
60 <td>Chris Lahey</td>
61 <td>4/11/97</td>
62 <td>Another singing algorithm.</td>
63 </tr>
64 <tr>
65 <td><a href="beer4.bf">beer4.bf</a></td>
66 <td></td>
67 <td>Denis Moskowitz</td>
68 <td>4/11/97</td>
69 <td>Yet another singing algorithm.</td>
70 </tr>
71 <tr>
72 <td><a href="beer5.bf">beer5.bf</a></td>
73 <td></td>
74 <td>David Johnston</td>
75 <td>4/11/97</td>
76 <td>Another singing program.</td>
77 </tr>
78 <tr>
79 <td><a href="beer6.bf">beer6.bf</a></td>
80 <td></td>
81 <td>Chris Lahey</td>
82 <td>4/11/97</td>
83 <td>A crammed (14x21) singing program.</td>
84 </tr>
85 <tr>
86 <td><a href="beer7.bf">beer7.bf</a></td>
87 <td>CC0</td>
88 <td>Wim Rijnders</td>
89 <td>5/2/97</td>
90 <td>A beer bottling program.</td>
91 </tr>
92 <tr>
93 <td><a href="beer8.bf">beer8.bf</a></td>
94 <td>CC0</td>
95 <td>Wim Rijnders</td>
96 <td>5/12/97</td>
97 <td>Again with the bottles.</td>
98 </tr>
99 <tr>
100 <td><a href="beer9.bf">beer9.bf</a></td>
101 <td></td>
102 <td>David Johnston</td>
103 <td>5/13/97</td>
104 <td>Crammed (22x9) singing beer program which doesn't use good grammar or punctuation.</td>
105 </tr>
106 <tr>
107 <td><a href="befbef.bf">befbef.bf</a></td>
108 <td>CC0</td>
109 <td>Wim Rijnders</td>
110 <td>5/12/97</td>
111 <td>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.</td>
112 </tr>
113 <tr>
114 <td><a href="befbef2.bf">befbef2.bf</a></td>
115 <td>CC0</td>
116 <td>Wim Rijnders</td>
117 <td>?/?/00</td>
118 <td>A version of befbef.bf with some bugs (pointed out by Amir Karger) fixed.</td>
119 </tr>
120 <tr>
121 <td><a href="befunge1.bf">befunge1.bf</a></td>
122 <td></td>
123 <td>Denis Moskowitz</td>
124 <td>7/17/97</td>
125 <td>Befunge logo source.</td>
126 </tr>
127 <tr>
128 <td><a href="befunge2.bf">befunge2.bf</a></td>
129 <td></td>
130 <td>Sam Holden</td>
131 <td>7/17/97</td>
132 <td>Befunge logo source.</td>
133 </tr>
134 <tr>
135 <td><a href="befunge3.bf">befunge3.bf</a></td>
136 <td></td>
137 <td>Ben Olmstead</td>
138 <td>7/18/97</td>
139 <td>Befunge logo source.</td>
140 </tr>
141 <tr>
142 <td><a href="befunge4.bf">befunge4.bf</a></td>
143 <td></td>
144 <td>Kevin Vigor</td>
145 <td>8/13/97</td>
146 <td>Befunge logo source.</td>
147 </tr>
148 <tr>
149 <td><a href="befungex.bf">befungex.bf</a></td>
150 <td></td>
151 <td>Kevin Vigor</td>
152 <td>7/18/97</td>
153 <td>Non-standard (oversize) Befunge logo source.</td>
154 </tr>
155 <tr>
156 <td><a href="calc.bf">calc.bf</a></td>
157 <td></td>
158 <td>Bryan L</td>
159 <td>4/10/97</td>
160 <td>This is a befunged calculator. Meaning ".", the print command, will also pop the result off the stack. Fortunately, the duplication command ":" is supported. This calculator will blithely ignore anything that isn't a number or a supported command. The list of commands is found on line 3.</td>
161 </tr>
162 <tr>
163 <td><a href="cascade.bf">cascade.bf</a></td>
164 <td>CC0</td>
165 <td>Chris Pressey</td>
166 <td>7/20/97</td>
167 <td>Like copyme.bf, but continues to replicate itself.</td>
168 </tr>
169 <tr>
170 <td><a href="chars.bf">chars.bf</a></td>
171 <td></td>
172 <td>Kalyna Zazelenchuk</td>
173 <td>1/1/93</td>
174 <td>Generates a printable ASCII table, with characters and corresponding codes in decimal, from 34 to 127.</td>
175 </tr>
176 <tr>
177 <td><a href="copyme.bf">copyme.bf</a></td>
178 <td>CC0</td>
179 <td>Wim Rijnders</td>
180 <td>6/5/97</td>
181 <td>Program which reproduces itself in Befunge-space.</td>
182 </tr>
183 <tr>
184 <td><a href="digitalr.bf">digitalr.bf</a></td>
185 <td></td>
186 <td>Keymaker</td>
187 <td>9/3/08</td>
188 <td>Computes the digital root (see numer.bf) of the input.</td>
189 </tr>
190 <tr>
191 <td><a href="dladv.bf">dladv.bf</a></td>
192 <td>CC0</td>
193 <td>Dmitry M Litvinov</td>
194 <td>12/1/96</td>
195 <td>A minimalist adventure game.<br>
196 n - go north<br/>
197 s - go south<br/>
198 e - go east<br/>
199 w - go west<br/>
200 d - dress<br/>
201 l - labour</td>
202 </tr>
203 <tr>
204 <td><a href="drx.bf">drx.bf</a></td>
205 <td>CC0</td>
206 <td>Chris Pressey</td>
207 <td>1/1/93</td>
208 <td>"Like Eliza, except better :-)"</td>
209 </tr>
210 <tr>
211 <td><a href="ea.bf">ea.bf</a></td>
212 <td>CC0</td>
213 <td>Chris Pressey</td>
214 <td>1/1/93</td>
215 <td>
216 Makes 'enigmatic aphorisms.' A loose interpretation of a program in
217 '1001 things to do with your Commodore 64.' This is an example of how to
218 simulate a 'gosub' with a value.
219 </td>
220 </tr>
221 <tr>
222 <td><a href="easm.bf">easm.bf</a></td>
223 <td>CC0</td>
224 <td>Chris Pressey</td>
225 <td>1/1/93</td>
226 <td>Same as 'ea.bf', but uses self-modifying code.</td>
227 </tr>
228 <tr>
229 <td><a href="euclid.bf">euclid.bf</a></td>
230 <td></td>
231 <td>Greg Wright</td>
232 <td>6/5/97</td>
233 <td>Euclidean algorithm.</td>
234 </tr>
235 <tr>
236 <td><a href="fact.bf">fact.bf</a></td>
237 <td>CC0</td>
238 <td>Chris Pressey</td>
239 <td>1/1/93</td>
240 <td>Asks for a number, and supplies the factorial of that number.</td>
241 </tr>
242 <tr>
243 <td><a href="fact2.bf">fact2.bf</a></td>
244 <td></td>
245 <td>Jason Reed</td>
246 <td>5/18/97</td>
247 <td>Factorial generator, (3x12)</td>
248 </tr>
249 <tr>
250 <td><a href="fact3.bf">fact3.bf</a></td>
251 <td></td>
252 <td>Chris Lahey</td>
253 <td>6/8/97</td>
254 <td>(23x1) factorial generator.</td>
255 </tr>
256 <tr>
257 <td><a href="hello.bf">hello.bf</a></td>
258 <td>CC0</td>
259 <td>Chris Pressey</td>
260 <td>1/1/93</td>
261 <td>The ubiquitous "Hello, World!" program.</td>
262 </tr>
263 <tr>
264 <td><a href="hex.bf">hex.bf</a></td>
265 <td>CC0</td>
266 <td>Chris Pressey</td>
267 <td>1/1/93</td>
268 <td>Translates ASCII input into hex output.</td>
269 </tr>
270 <tr>
271 <td><a href="hwii.bf">hwii.bf</a></td>
272 <td>CC0</td>
273 <td>Chris Pressey</td>
274 <td>1/1/93</td>
275 <td>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.</td>
276 </tr>
277 <tr>
278 <td><a href="kmquine.bf">kmquine.bf</a></td>
279 <td></td>
280 <td>Keymaker</td>
281 <td>9/3/08</td>
282 <td>The first of a series of really fine quines (self-printing programs) by Keymaker.</td>
283 </tr>
284 <tr>
285 <td><a href="kmquine2.bf">kmquine2.bf</a></td>
286 <td></td>
287 <td>Keymaker</td>
288 <td>9/3/08</td>
289 <td>The second of a series of really fine quines by Keymaker.</td>
290 </tr>
291 <tr>
292 <td><a href="kmquine3.bf">kmquine3.bf</a></td>
293 <td></td>
294 <td>Keymaker</td>
295 <td>9/3/08</td>
296 <td>The third of a series of really fine quines by Keymaker.</td>
297 </tr>
298 <tr>
299 <td><a href="life.bf">life.bf</a></td>
300 <td>CC0</td>
301 <td>Dmitry M Litvinov</td>
302 <td>6/1/97</td>
303 <td>An implementation of John Conway's game of Life.</td>
304 </tr>
305 <tr>
306 <td><a href="madd.bf">madd.bf</a></td>
307 <td></td>
308 <td>Greg Wright</td>
309 <td>6/5/97</td>
310 <td>3x3-Matrix Addition</td>
311 </tr>
312 <tr>
313 <td><a href="mandel.bf">mandel.bf</a></td>
314 <td></td>
315 <td>Chris Lahey</td>
316 <td>4/11/97</td>
317 <td>A Mandelbrot fractal generator.</td>
318 </tr>
319 <tr>
320 <td><a href="maze.bf">maze.bf</a></td>
321 <td>CC0</td>
322 <td>Chris Pressey</td>
323 <td>1/1/93</td>
324 <td>A conversion of a Commodore-64 graphical pastime: a dead-simple random maze generator.</td>
325 </tr>
326 <tr>
327 <td><a href="namegame.bf">namegame.bf</a></td>
328 <td>CC0</td>
329 <td>Dmitry M Litvinov</td>
330 <td>2/1/96</td>
331 <td>"First, example easy writed stupid prog." Befunge bypasses cultural and lingual backgrounds. Try this "easily written" program and see what it does.</td>
332 </tr>
333 <tr>
334 <td><a href="numer.bf">numer.bf</a></td>
335 <td>CC0</td>
336 <td>Chris Pressey</td>
337 <td>1/1/93</td>
338 <td>
339 Produces single-digit numerological equivalents of words you type in.
340 (Users should be warned that the significance of the output of this
341 program is of extremely questionable practical value. But it is
342 consistant.) (This algorithm is also known as the "digital root".)
343 </td>
344 </tr>
345 <tr>
346 <td><a href="pairing.bf">pairing.bf</a></td>
347 <td></td>
348 <td>Aaron Dale</td>
349 <td>3/20/97</td>
350 <td>A program to implement the "pairing function" (&lt;x1,x2&gt; = (2^(x1) * (2*(x2) + 1)) - 1), which maps any two natural numbers onto the set of natural numbers, without repetition.</td>
351 </tr>
352 <tr>
353 <td><a href="pangram.bf">pangram.bf</a></td>
354 <td>CC0</td>
355 <td>Chris Pressey</td>
356 <td>8/25/12</td>
357 <td>Checks if the first line of input is a pangram --
358 a sentence which contains all the letters of the alphabet, such as
359 "The quick brown fox jumps over the lazy dog" or
360 "Pack my lunch box with five dozen liquor jugs." Case-insensitive,
361 and ignores most punctuation, but "high" punctuation (above ASCII
362 character 90) will likely confuse it.
363 </td>
364 </tr>
365 <tr>
366 <td><a href="pascserp.bf">pascserp.bf</a></td>
367 <td>CC0</td>
368 <td>Chris Pressey</td>
369 <td>7/12/97</td>
370 <td>Generates a gasket (Serpinsky triangle) using Pascal's Triangle.</td>
371 </tr>
372 <tr>
373 <td><a href="pi.bf">pi.bf</a></td>
374 <td></td>
375 <td>Ben Olmstead</td>
376 <td>6/25/97</td>
377 <td>Produces the first hundred digits of pi in under one hundred characters of Befunge, but cheats in that it simply decompresses the digits encoded in the source code.</td>
378 </tr>
379 <tr>
380 <td><a href="pi2.bf">pi2.bf</a></td>
381 <td></td>
382 <td>Kevin Vigor</td>
383 <td>7/2/97</td>
384 <td>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.</td>
385 </tr>
386 <tr>
387 <td><a href="prime.bf">prime.bf</a></td>
388 <td></td>
389 <td>Kalyna Zazelenchuk</td>
390 <td>1/1/93</td>
391 <td>Lists the counting numbers incrementally from one and checks if each is prime.</td>
392 </tr>
393 <tr>
394 <td><a href="rand.bf">rand.bf</a></td>
395 <td></td>
396 <td>Chris Pressey</td>
397 <td>1/1/93</td>
398 <td>Generates random numbers between 1 and 9 as statistically evenly distributed as the computer's random number generator.</td>
399 </tr>
400 <tr>
401 <td><a href="rand10.bf">rand10.bf</a></td>
402 <td></td>
403 <td>Ken Bateman</td>
404 <td>4/12/97</td>
405 <td>A 3x10 random number generator.</td>
406 </tr>
407 <tr>
408 <td><a href="rand11.bf">rand11.bf</a></td>
409 <td></td>
410 <td>Ken Bateman</td>
411 <td>4/12/97</td>
412 <td>A 5x7 flexible random number generator. The number of bits is set with the 88+ at the top left. As shown this program will generate a random number from 0 to 32767.</td>
413 </tr>
414 <tr>
415 <td><a href="rand12.bf">rand12.bf</a></td>
416 <td></td>
417 <td>Ben Olmstead</td>
418 <td>4/24/97</td>
419 <td>A 2x13, 0..255 random number generator.</td>
420 </tr>
421 <tr>
422 <td><a href="rand13.bf">rand13.bf</a></td>
423 <td></td>
424 <td>Ben Olmstead</td>
425 <td>4/24/97</td>
426 <td>A 2x12, infinitely looping 0..31 random number generator.</td>
427 </tr>
428 <tr>
429 <td><a href="rand14.bf">rand14.bf</a></td>
430 <td></td>
431 <td>Greg Wright</td>
432 <td>5/18/97</td>
433 <td>4x7 random number generator.</td>
434 </tr>
435 <tr>
436 <td><a href="rand15.bf">rand15.bf</a></td>
437 <td></td>
438 <td>Artyom Baranov</td>
439 <td>4/5/96</td>
440 <td>THE smallest Befunge RNG-16. (16x1)</td>
441 </tr>
442 <tr>
443 <td><a href="rand2.bf">rand2.bf</a></td>
444 <td></td>
445 <td>Kalyna Zazelenchuk</td>
446 <td>1/1/93</td>
447 <td>This program, crammed into a 14x14 block, makes random numbers from 1 to 16 using multiple "?" statements.</td>
448 </tr>
449 <tr>
450 <td><a href="rand3.bf">rand3.bf</a></td>
451 <td></td>
452 <td>Chris Pressey</td>
453 <td>1/1/93</td>
454 <td>12x9 random number generator, like rand.bf and rand2.bf.</td>
455 </tr>
456 <tr>
457 <td><a href="rand4.bf">rand4.bf</a></td>
458 <td></td>
459 <td>Matthew D Moss</td>
460 <td>2/1/96</td>
461 <td>A 7x7 random number generator in the tradition of rand.bf .. rand3.bf, but using mathematics to reduce the problem before writing the code</td>
462 </tr>
463 <tr>
464 <td><a href="rand5.bf">rand5.bf</a></td>
465 <td>CC0</td>
466 <td>Dmitry M Litvinov</td>
467 <td>2/1/96</td>
468 <td>A 4x10 random number generator which produces the same output as rand.bf .. rand4.bf. Unlike most Befunge sources this one has a symmetrical beauty to it.</td>
469 </tr>
470 <tr>
471 <td><a href="rand6.bf">rand6.bf</a></td>
472 <td></td>
473 <td>Artyom Baranov?</td>
474 <td>12/1/96</td>
475 <td>An 8x4 random number generator a la rand5.bf.</td>
476 </tr>
477 <tr>
478 <td><a href="rand7.bf">rand7.bf</a></td>
479 <td></td>
480 <td>???</td>
481 <td>12/1/96</td>
482 <td>A 13x3 random number generator a la rand5.bf and rand6.bf.</td>
483 </tr>
484 <tr>
485 <td><a href="rand8.bf">rand8.bf</a></td>
486 <td></td>
487 <td>Chris Howe</td>
488 <td>4/9/97</td>
489 <td>A 4x9 flexible random number generator; if you change the 4 in position (1,2) to another integer n it will generate a number between 1 and 2^n (inclusive) for 0&lt;n&lt;9.</td>
490 </tr>
491 <tr>
492 <td><a href="rand9.bf">rand9.bf</a></td>
493 <td></td>
494 <td>Chris Lahey</td>
495 <td>4/11/97</td>
496 <td>A 3x7 random number generator.</td>
497 </tr>
498 <tr> <td><a href="rdp.bf">rdp.bf</a></td>
499 <td>CC0</td>
500 <td>Dmitry M Litvinov</td>
501 <td>2/1/96</td>
502 <td>A command-line calculator with postfix notation.</td>
503 </tr>
504 <tr> <td><a href="rdp2.bf">rdp2.bf</a></td>
505 <td></td>
506 <td>Kimberley Burchette</td>
507 <td>12/1/96</td>
508 <td>A version of rdp.bf crammed into a 23x12 block.</td>
509 </tr>
510 <tr> <td><a href="robot.bf">robot.bf</a></td>
511 <td>CC0</td>
512 <td>Chris Pressey</td>
513 <td>1/1/93</td>
514 <td>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 '*'.</td>
515 </tr>
516 <tr> <td><a href="rot13.bf">rot13.bf</a></td>
517 <td></td>
518 <td>???</td>
519 <td>9/11/97</td>
520 <td>Performs the rot13 algorithm.</td>
521 </tr>
522 <tr> <td><a href="selflis2.bf">selflis2.bf</a></td>
523 <td>CC0</td>
524 <td>Chris Pressey</td>
525 <td>12/1/96</td>
526 <td>A self-reproducing 80x1 program. This program can also be used to test for the @ vs StringMode bug.</td>
527 </tr>
528 <tr> <td><a href="selflis3.bf">selflis3.bf</a></td>
529 <td></td>
530 <td>Kevin Vigor</td>
531 <td>5/28/97</td>
532 <td>A 14-byte Quine (self-reproducing program.)</td>
533 </tr>
534 <tr> <td><a href="selflis5.bf">selflis5.bf</a></td>
535 <td></td>
536 <td>David Johnston</td>
537 <td>5/7/97</td>
538 <td>Crammed (14x6) self-listing program.</td>
539 </tr>
540 <tr> <td><a href="selflis6.bf">selflis6.bf</a></td>
541 <td></td>
542 <td>Denis Moskowitz</td>
543 <td>5/8/97</td>
544 <td>14-byte quine.</td>
545 </tr>
546 <tr> <td><a href="selflist.bf">selflist.bf</a></td>
547 <td></td>
548 <td>???</td>
549 <td>12/1/196</td>
550 <td>A self-reproducing Befunge program, 13x4.</td>
551 </tr>
552 <tr> <td><a href="serp.bf">serp.bf</a></td>
553 <td></td>
554 <td>Kevin Vigor</td>
555 <td>4/9/97</td>
556 <td>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?</td>
557 </tr>
558 <tr> <td><a href="serp2.bf">serp2.bf</a></td>
559 <td></td>
560 <td>Kevin Vigor</td>
561 <td>4/10/97</td>
562 <td>Improved Serpinsky Triangle generator.</td>
563 </tr>
564 <tr> <td><a href="sinus.bf">sinus.bf</a></td>
565 <td>CC0</td>
566 <td>Dmitry M Litvinov</td>
567 <td>12/1/96</td>
568 <td>Program to generate sine wave patterns.<br>
569 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)</td>
570 </tr>
571 <tr> <td><a href="sort.bf">sort.bf</a></td>
572 <td></td>
573 <td>Kalyna Zazelenchuk</td>
574 <td>1/1/93</td>
575 <td>Same as anagram.bf, except sorts the letters of your word in ascending order.</td>
576 </tr>
577 <tr> <td><a href="surprise.bf">surprise.bf</a></td>
578 <td></td>
579 <td>???</td>
580 <td>6/1/97</td>
581 <td>A big surprise.</td>
582 </tr>
583 <tr>
584 <td><a href="switchbx.bf">switchbx.bf</a></td>
585 <td></td>
586 <td>Zach Baker</td>
587 <td>7/10/97</td>
588 <td>A real purty 'switch' statement.</td>
589 </tr>
590 <tr>
591 <td><a href="testbrdg.bf">testbrdg.bf</a></td>
592 <td>CC0</td>
593 <td>Chris Pressey</td>
594 <td>10/27/11</td>
595 <td>Tests whether the # instruction interacts properly with wrapping.</td>
596 </tr>
597 <tr>
598 <td><a href="testmodu.bf">testmodu.bf</a></td>
599 <td>CC0</td>
600 <td>Chris Pressey</td>
601 <td>8/23/11</td>
602 <td>Tests how your implementation of Befunge-93 calculates modulus
603 (there is no right way.)</td>
604 </tr>
605 <tr>
606 <td><a href="toupper.bf">toupper.bf</a></td>
607 <td>CC0</td>
608 <td>Chris Pressey</td>
609 <td>9/1/93</td>
610 <td>Converts letters to upper-case. An example of the ` (greater) statement.</td>
611 </tr>
612 <tr>
613 <td><a href="wumpus.bf">wumpus.bf</a></td>
614 <td>CC0</td>
615 <td>Wim Rijnders</td>
616 <td>8/15/97</td>
617 <td>The classic game of Hunt the Wumpus!</td>
618 </tr>
619 </table>
620 </body>
621 </html>