Befunge 93 solutions to Advent of Code

This repository contains some solutions to the Advent of Code challenges, written in Befunge 93. For some reason I try to do day 2 part 1 in Befunge 93 every year.

Befunge is a two-dimensional esoteric programming language invented in 1993 by Chris Pressey with the goal of being as difficult to compile as possible. Code is laid out on a two-dimensional grid of instructions, and execution can proceed in any direction of that grid.

2024 day 2 part 1

• Challenge https://adventofcode.com/2024/day/2
• Run on https://esolangpark.vercel.app/ide/befunge93
• Input format notes: input needs empty trailing newline

>0 >&01p>~52*-!#v_>&11p21g" "-#v_3  >:01g+11g-#v_99*21p  v
   ^  +1p12< " "< ^    <       9    |:       -1<
       >+.@                         $
       1                       9    >3>:11g+01g-#v_89*21pv
       $   ^" "<               *      |:       -1<       $
 ~:1+!#^_25*-!#^_11g01p^       >21g-| > v                >
                                    >3>:01g+11g-#v_$     ^
                         @.$<         |:       -1<
   v         p12" "_v#!-*25_^# +1:~< $<
                    >              ^  $$<

2023 day 2 part 1

• Challenge https://adventofcode.com/2023/day/2
• Run on https://esolangpark.vercel.app/ide/befunge93
• Input format notes: input needs empty trailing newline

v000      >~# 5# 2# *# -#       _^       >v
0    >"G"-|                     0< >:"g"-|
>~:1+|    >~~~~$$$$&~~>$$>&~$~:"r"-|>   v
     >$.@                ^         >^   ~~~
                                        ~~~
  v < $$$<             <<                ~~
  "      |!:-1p03-1g03<                  ~
  0>27*1+>#    30g"0"-|                 $$$
  " #            v*72$<|!:-1p02-1g02<   $$$
  :              >     >##   20g"0"-|   $$$
  :        >10g1-10p1-:!|                $$
  1        |     -"0"g01<     +1*62$<    $
  0        $                            123
^<p        :                            000
 p2        !                            ggg
 00 ^    +$_25*1++       |              +++
 3p^             -*25$<  >+.@           123
 ^<                  !|        -","::~p0<<<
^                                <

2022 day 2 part 1

• Challenge https://adventofcode.com/2022/day/2
• Run on https://esolangpark.vercel.app/ide/befunge93
• Input format notes: input requires that there is no empty trailing newline (sorry for the inconsistency!)

v     v_v
       +>$+.@
       1
       :
v  v6:< ~<             $   >v
>~:52*-| +             $   $7
   *   >$^            >|>1+|
   2    >$~$~56*3*-::#+$|  $
   *   >|    >$$4    #1     v
   5   ->$~$~:56*3*-::|$$  #
^  +#  1#<   #        >$$$$9>
   >-::|     |+1<      56  2
   v$$$< ^8$$<         >>  >^
   >~$~:56*3*-::|      >   1^
                >$$    $3   ^

2021 day 2 part 1

• Challenge https://adventofcode.com/2022/day/2
• Run on https://esolangpark.vercel.app/ide/befunge93
• Output format notes: multiply the two remaining numbers when it starts going around in circles (lol)

v                  v   $  <         >$-v   >v
           >       >~:" "-|>$&\:"d"-|      -
     v     |  -*52:<
     v                              #  #   $
      @.* $< >:"b"-|      >^     >$&\:"f"->|
>00  >~ :"f"-|     >$\"b">~:" "-!|  $      $
             >$\"f"      ^  #$   <  +      +
     ^$~                            <  <  \<<