eg/INDEX.html - Befunge-93 (rel_2_22_2011_0318)

Tree @rel_2_22_2011_0318 (Download .tar.gz)

INDEX.html @rel_2_22_2011_0318 — raw · history · blame

<HTML>
<HEAD>
<TITLE>Cat's Eye Technologies: Befunge Source Code (*.bf)</TITLE>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html;CHARSET=iso-8859-1">
<META NAME="Author" Content="Chris Pressey">
<META NAME="Keywords" Content=" Cat's Eye Technologies Example Befunge Source Code Software Programs">
</HEAD>
<BODY bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink = "#007F00">
<CENTER><H1>Befunge-93 Example Programs</H1>

<TABLE BORDER=0 WIDTH=100%><TR>
 <TD ALIGN=CENTER><B>Name</B><BR></TD>
 <TD ALIGN=CENTER><B>Author</B><BR></TD>
 <TD ALIGN=CENTER><B>Date</B><BR></TD>
 <TD ALIGN=CENTER><B>Notes</B><BR></TD>
</TR>
<P><TR> <TD><A HREF="anagram.bf">anagram.bf</A><BR></TD>
 <TD>Kalyna Zazelenchuk<BR></TD>
 <TD>1/1/93<BR></TD>
 <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.<BR></TD>
</TR>
<TR> <TD><A HREF="aturley.bf">aturley.bf</A><BR></TD>
 <TD>Andrew Turley<BR></TD>
 <TD>1/1/2999<BR></TD>
 <TD>aturley's .sig; cellular automata gasket generator.<BR></TD>
</TR>
<TR> <TD><A HREF="beer.bf">beer.bf</A><BR></TD>
 <TD>Kevin Vigor<BR></TD>
 <TD>4/9/97<BR></TD>
 <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.<BR></TD>
</TR>
<TR> <TD><A HREF="beer10.bf">beer10.bf</A><BR></TD>
 <TD>Chris Lahey<BR></TD>
 <TD>6/8/97<BR></TD>
 <TD>A squashed (22x10) beer singing program, gramatically correct.<BR></TD>
</TR>
<TR> <TD><A HREF="beer2.bf">beer2.bf</A><BR></TD>
 <TD>Keith Arner<BR></TD>
 <TD>4/10/97<BR></TD>
 <TD>Another "99 Bottles of Beer" program.<BR></TD>
</TR>
<TR> <TD><A HREF="beer3.bf">beer3.bf</A><BR></TD>
 <TD>Chris Lahey<BR></TD>
 <TD>4/11/97<BR></TD>
 <TD>Another singing algorithm.<BR></TD>
</TR>
<TR> <TD><A HREF="beer4.bf">beer4.bf</A><BR></TD>
 <TD>Denis Moskowitz<BR></TD>
 <TD>4/11/97<BR></TD>
 <TD>Yet another singing algorithm.<BR></TD>
</TR>
<TR> <TD><A HREF="beer5.bf">beer5.bf</A><BR></TD>
 <TD>David Johnston<BR></TD>
 <TD>4/11/97<BR></TD>
 <TD>Another singing program.<BR></TD>
</TR>
<TR> <TD><A HREF="beer6.bf">beer6.bf</A><BR></TD>
 <TD>Chris Lahey<BR></TD>
 <TD>4/11/97<BR></TD>
 <TD>A crammed (14x21) singing program.<BR></TD>
</TR>
<TR> <TD><A HREF="beer7.bf">beer7.bf</A><BR></TD>
 <TD>Wim Rijnders<BR></TD>
 <TD>5/2/97<BR></TD>
 <TD>A beer bottling program.<BR></TD>
</TR>
<TR> <TD><A HREF="beer8.bf">beer8.bf</A><BR></TD>
 <TD>Wim Rijnders<BR></TD>
 <TD>5/12/97<BR></TD>
 <TD>Again with the bottles.<BR></TD>
</TR>
<TR> <TD><A HREF="beer9.bf">beer9.bf</A><BR></TD>
 <TD>David Johnston<BR></TD>
 <TD>5/13/97<BR></TD>
 <TD>Crammed (22x9) singing beer program which doesn't use good grammar or punctuation.<BR></TD>
</TR>
<TR> <TD><A HREF="befbef.bf">befbef.bf</A><BR></TD>
 <TD>Wim Rijnders<BR></TD>
 <TD>5/12/97<BR></TD>
 <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.<BR></TD>
</TR>
<TR> <TD><A HREF="befunge1.bf">befunge1.bf</A><BR></TD>
 <TD>Denis Moskowitz<BR></TD>
 <TD>7/17/97<BR></TD>
 <TD>Befunge logo source.<BR></TD>
</TR>
<TR> <TD><A HREF="befunge2.bf">befunge2.bf</A><BR></TD>
 <TD>Sam Holden<BR></TD>
 <TD>7/17/97<BR></TD>
 <TD>Befunge logo source.<BR></TD>
</TR>
<TR> <TD><A HREF="befunge3.bf">befunge3.bf</A><BR></TD>
 <TD>Ben Olmstead<BR></TD>
 <TD>7/18/97<BR></TD>
 <TD>Befunge logo source.<BR></TD>
</TR>
<TR> <TD><A HREF="befunge4.bf">befunge4.bf</A><BR></TD>
 <TD>Kevin Vigor<BR></TD>
 <TD>8/13/97<BR></TD>
 <TD>Befunge logo source.<BR></TD>
</TR>
<TR> <TD><A HREF="befungex.bf">befungex.bf</A><BR></TD>
 <TD>Kevin Vigor<BR></TD>
 <TD>7/18/97<BR></TD>
 <TD>Non-standard (oversize) Befunge logo source.<BR></TD>
</TR>
<TR> <TD><A HREF="calc.bf">calc.bf</A><BR></TD>
 <TD>Bryan L<BR></TD>
 <TD>4/10/97<BR></TD>
 <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.<BR></TD>
</TR>
<TR> <TD><A HREF="cascade.bf">cascade.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>7/20/97<BR></TD>
 <TD>Like copyme.bf, but continues to replicate itself.<BR></TD>
</TR>
<TR> <TD><A HREF="chars.bf">chars.bf</A><BR></TD>
 <TD>Kalyna Zazelenchuk<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>Generates a printable ASCII table, with characters and corresponding codes in decimal, from 34 to 127.<BR></TD>
</TR>
<TR> <TD><A HREF="copyme.bf">copyme.bf</A><BR></TD>
 <TD>Wim Rijnders<BR></TD>
 <TD>6/5/97<BR></TD>
 <TD>Program which reproduces itself in Befunge-space.<BR></TD>
</TR>
<TR> <TD><A HREF="dladv.bf">dladv.bf</A><BR></TD>
 <TD>Dmitry M Litvinov<BR></TD>
 <TD>12/1/96<BR></TD>
 <TD>A minimalist adventure game.<BR>
  n - go north<BR>
  s - go south<BR>
  e - go east<BR>
 w - go west<BR>
 d - dress<BR>
  l - labour<BR></TD>
</TR>
<TR> <TD><A HREF="drx.bf">drx.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>"Like Eliza, except better :-)"<BR></TD>
</TR>
<TR> <TD><A HREF="ea.bf">ea.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>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.<BR></TD>
</TR>
<TR> <TD><A HREF="easm.bf">easm.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>Same as 'ea.bf', but uses self-modifying code.<BR></TD>
</TR>
<TR> <TD><A HREF="euclid.bf">euclid.bf</A><BR></TD>
 <TD>Greg Wright<BR></TD>
 <TD>6/5/97<BR></TD>
 <TD>Euclidean algorithm.<BR></TD>
</TR>
<TR> <TD><A HREF="fact.bf">fact.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>Asks for a number, and supplies the factorial of that number.<BR></TD>
</TR>
<TR> <TD><A HREF="fact2.bf">fact2.bf</A><BR></TD>
 <TD>Jason Reed<BR></TD>
 <TD>5/18/97<BR></TD>
 <TD>Factorial generator, (3x12)<BR></TD>
</TR>
<TR> <TD><A HREF="fact3.bf">fact3.bf</A><BR></TD>
 <TD>Chris Lahey<BR></TD>
 <TD>6/8/97<BR></TD>
 <TD>(23x1) factorial generator.<BR></TD>
</TR>
<TR> <TD><A HREF="hello.bf">hello.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>The ubiquitous "Hello, World!" program.<BR></TD>
</TR>
<TR> <TD><A HREF="hex.bf">hex.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>Translates ASCII input into hex output.<BR></TD>
</TR>
<TR> <TD><A HREF="hwii.bf">hwii.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <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.<BR></TD>
</TR>
<TR> <TD><A HREF="life.bf">life.bf</A><BR></TD>
 <TD>Dmitry M Litvinov<BR></TD>
 <TD>6/1/97<BR></TD>
 <TD>An implementation of John Conway's game of Life.<BR></TD>
</TR>
<TR> <TD><A HREF="madd.bf">madd.bf</A><BR></TD>
 <TD>Greg Wright<BR></TD>
 <TD>6/5/97<BR></TD>
 <TD>3x3-Matrix Addition<BR></TD>
</TR>
<TR> <TD><A HREF="mandel.bf">mandel.bf</A><BR></TD>
 <TD>Chris Lahey<BR></TD>
 <TD>4/11/97<BR></TD>
 <TD>A Mandelbrot fractal generator.<BR></TD>
</TR>
<TR> <TD><A HREF="maze.bf">maze.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>A conversion of a Commodore-64 graphical pastime: a dead-simple random maze generator.<BR></TD>
</TR>
<TR> <TD><A HREF="namegame.bf">namegame.bf</A><BR></TD>
 <TD>Dmitry M Litvinov<BR></TD>
 <TD>2/1/96<BR></TD>
 <TD>"First, example easy writed stupid prog."  Befunge bypasses cultural and lingual backgrounds.  Try this "easily written" program and see what it does.<BR></TD>
</TR>
<TR> <TD><A HREF="numer.bf">numer.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>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.)<BR></TD>
</TR>
<TR> <TD><A HREF="pairing.bf">pairing.bf</A><BR></TD>
 <TD>Aaron Dale<BR></TD>
 <TD>3/20/97<BR></TD>
 <TD>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.<BR></TD>
</TR>
<TR> <TD><A HREF="pascserp.bf">pascserp.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>7/12/97<BR></TD>
 <TD>Generates a gasket (Serpinsky triangle) using Pascal's Triangle.<BR></TD>
</TR>
<TR> <TD><A HREF="pi.bf">pi.bf</A><BR></TD>
 <TD>Ben Olmstead<BR></TD>
 <TD>6/25/97<BR></TD>
 <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.<BR></TD>
</TR>
<TR> <TD><A HREF="pi2.bf">pi2.bf</A><BR></TD>
 <TD>Kevin Vigor<BR></TD>
 <TD>7/2/97<BR></TD>
 <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.<BR></TD>
</TR>
<TR> <TD><A HREF="prime.bf">prime.bf</A><BR></TD>
 <TD>Kalyna Zazelenchuk<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>Lists the counting numbers incrementally from one and checks if each is prime.<BR></TD>
</TR>
<TR> <TD><A HREF="rand.bf">rand.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>Generates random numbers between 1 and 9 as statistically evenly distributed as the computer's random number generator.<BR></TD>
</TR>
<TR> <TD><A HREF="rand10.bf">rand10.bf</A><BR></TD>
 <TD>Ken Bateman<BR></TD>
 <TD>4/12/97<BR></TD>
 <TD>A 3x10 random number generator.<BR></TD>
</TR>
<TR> <TD><A HREF="rand11.bf">rand11.bf</A><BR></TD>
 <TD>Ken Bateman<BR></TD>
 <TD>4/12/97<BR></TD>
 <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.<BR></TD>
</TR>
<TR> <TD><A HREF="rand12.bf">rand12.bf</A><BR></TD>
 <TD>Ben Olmstead<BR></TD>
 <TD>4/24/97<BR></TD>
 <TD>A 2x13, 0..255  random number generator.<BR></TD>
</TR>
<TR> <TD><A HREF="rand13.bf">rand13.bf</A><BR></TD>
 <TD>Ben Olmstead<BR></TD>
 <TD>4/24/97<BR></TD>
 <TD>A 2x12, infinitely looping 0..31 random number generator.<BR></TD>
</TR>
<TR> <TD><A HREF="rand14.bf">rand14.bf</A><BR></TD>
 <TD>Greg Wright<BR></TD>
 <TD>5/18/97<BR></TD>
 <TD>4x7 random number generator.<BR></TD>
</TR>
<TR> <TD><A HREF="rand15.bf">rand15.bf</A><BR></TD>
 <TD>Artyom  Baranov<BR></TD>
 <TD>4/5/96<BR></TD>
 <TD>THE smallest Befunge RNG-16. (16x1)<BR></TD>
</TR>
<TR> <TD><A HREF="rand2.bf">rand2.bf</A><BR></TD>
 <TD>Kalyna Zazelenchuk<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>This program, crammed into a 14x14 block, makes random numbers from 1 to 16 using multiple "?" statements.<BR></TD>
</TR>
<TR> <TD><A HREF="rand3.bf">rand3.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>12x9 random number generator, like rand.bf and rand2.bf.<BR></TD>
</TR>
<TR> <TD><A HREF="rand4.bf">rand4.bf</A><BR></TD>
 <TD>Matthew D Moss<BR></TD>
 <TD>2/1/96<BR></TD>
 <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<BR></TD>
</TR>
<TR> <TD><A HREF="rand5.bf">rand5.bf</A><BR></TD>
 <TD>Dmitry M Litvinov<BR></TD>
 <TD>2/1/96<BR></TD>
 <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.<BR></TD>
</TR>
<TR> <TD><A HREF="rand6.bf">rand6.bf</A><BR></TD>
 <TD>Artyom?<BR></TD>
 <TD>12/1/96<BR></TD>
 <TD>An 8x4 random number generator a la rand5.bf.<BR></TD>
</TR>
<TR> <TD><A HREF="rand7.bf">rand7.bf</A><BR></TD>
 <TD>???<BR></TD>
 <TD>12/1/96<BR></TD>
 <TD>A 13x3 random number generator a la rand5.bf and rand6.bf.<BR></TD>
</TR>
<TR> <TD><A HREF="rand8.bf">rand8.bf</A><BR></TD>
 <TD>Chris Howe<BR></TD>
 <TD>4/9/97<BR></TD>
 <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<n<9.<BR></TD>
</TR>
<TR> <TD><A HREF="rand9.bf">rand9.bf</A><BR></TD>
 <TD>Chris Lahey<BR></TD>
 <TD>4/11/97<BR></TD>
 <TD>A 3x7 random number generator.<BR></TD>
</TR>
<TR> <TD><A HREF="rdp.bf">rdp.bf</A><BR></TD>
 <TD>Dmitry M Litvinov<BR></TD>
 <TD>2/1/96<BR></TD>
 <TD>A command-line calculator with postfix notation.<BR></TD>
</TR>
<TR> <TD><A HREF="rdp2.bf">rdp2.bf</A><BR></TD>
 <TD>Kimberley Burchette<BR></TD>
 <TD>12/1/96<BR></TD>
 <TD>A version of rdp.bf crammed into a 23x12 block.<BR></TD>
</TR>
<TR> <TD><A HREF="robot.bf">robot.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>1/1/93<BR></TD>
 <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 '*'.<BR></TD>
</TR>
<TR> <TD><A HREF="rot13.bf">rot13.bf</A><BR></TD>
 <TD>???<BR></TD>
 <TD>9/11/97<BR></TD>
 <TD>Performs the rot13 algorithm.<BR></TD>
</TR>
<TR> <TD><A HREF="selflis2.bf">selflis2.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>12/1/96<BR></TD>
 <TD>A self-repoducing 80x1 program.  This program can also be used to test for the @ vs StringMode bug.<BR></TD>
</TR>
<TR> <TD><A HREF="selflis3.bf">selflis3.bf</A><BR></TD>
 <TD>Kevin Vigor<BR></TD>
 <TD>5/28/97<BR></TD>
 <TD>A 14-byte Quine (self-reproducing program.)<BR></TD>
</TR>
<TR> <TD><A HREF="selflis5.bf">selflis5.bf</A><BR></TD>
 <TD>David Johnston<BR></TD>
 <TD>5/7/97<BR></TD>
 <TD>Crammed (14x6) self-listing program.<BR></TD>
</TR>
<TR> <TD><A HREF="selflis6.bf">selflis6.bf</A><BR></TD>
 <TD>Denis Moskowitz<BR></TD>
 <TD>5/8/97<BR></TD>
 <TD>14-byte quine.<BR></TD>
</TR>
<TR> <TD><A HREF="selflist.bf">selflist.bf</A><BR></TD>
 <TD>Andrew Turley?<BR></TD>
 <TD>12/1/196<BR></TD>
 <TD>A self-reproducing Befunge program, 13x4.<BR></TD>
</TR>
<TR> <TD><A HREF="serp.bf">serp.bf</A><BR></TD>
 <TD>Kevin Vigor<BR></TD>
 <TD>4/9/97<BR></TD>
 <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?<BR></TD>
</TR>
<TR> <TD><A HREF="serp2.bf">serp2.bf</A><BR></TD>
 <TD>Kevin Vigor<BR></TD>
 <TD>4/10/97<BR></TD>
 <TD>Improved Serpinsky Triangle generator.<BR></TD>
</TR>
<TR> <TD><A HREF="sinus.bf">sinus.bf</A><BR></TD>
 <TD>Dmitry M Litvinov<BR></TD>
 <TD>12/1/96<BR></TD>
 <TD>Program to generate sine wave patterns.<BR>
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)<BR></TD>
</TR>
<TR> <TD><A HREF="sort.bf">sort.bf</A><BR></TD>
 <TD>Kalyna Zazelenchuk<BR></TD>
 <TD>1/1/93<BR></TD>
 <TD>Same as anagram.bf, except sorts the letters of your word in ascending order.<BR></TD>
</TR>
<TR> <TD><A HREF="surprise.bf">surprise.bf</A><BR></TD>
 <TD>???<BR></TD>
 <TD>6/1/97<BR></TD>
 <TD>A big surprise.<BR></TD>
</TR>
<TR> <TD><A HREF="switchbx.bf">switchbx.bf</A><BR></TD>
 <TD>Zach Baker<BR></TD>
 <TD>7/10/97<BR></TD>
 <TD>A real purty 'switch' statement.<BR></TD>
</TR>
<TR> <TD><A HREF="toupper.bf">toupper.bf</A><BR></TD>
 <TD>Chris Pressey<BR></TD>
 <TD>9/1/93<BR></TD>
 <TD>Converts letters to upper-case.  An example of the ` (greater) statement.<BR></TD>
</TR>
<TR> <TD><A HREF="wumpus.bf">wumpus.bf</A><BR></TD>
 <TD>Wim Rijnders<BR></TD>
 <TD>8/15/97<BR></TD>
 <TD>The classic game of Hunt the Wumpus!<BR></TD>
</TR>
</TABLE></CENTER>
</BODY>
</HTML>