aboutsummaryrefslogtreecommitdiff
path: root/projects.html
diff options
context:
space:
mode:
Diffstat (limited to 'projects.html')
-rw-r--r--projects.html16
1 files changed, 10 insertions, 6 deletions
diff --git a/projects.html b/projects.html
index 6078702..267b541 100644
--- a/projects.html
+++ b/projects.html
@@ -2,6 +2,10 @@
<head>
<title>Personal Projects</title>
<link rel="stylesheet" href="style.css" />
+ <link rel="apple-touch-icon" sizes="180x180" href="data/favicon/apple-touch-icon.png">
+ <link rel="icon" type="image/png" sizes="32x32" href="data/favicon/favicon-32x32.png">
+ <link rel="icon" type="image/png" sizes="16x16" href="data/favicon/favicon-16x16.png">
+ <link rel="manifest" href="data/favicon/site.webmanifest">
<style>
code {
color: #505050;
@@ -30,7 +34,7 @@
interpret and run the supplied binary file. You are also given a document
outlining the
<a
- href="https://raw.githubusercontent.com/waffle87/synacor_challenge/master/arch-spec"
+ href="https://git.pngu.org/synacor_challenge/tree/arch-spec"
target="_blank"
>architecture specification</a
>
@@ -47,14 +51,14 @@
>
for providing a binary file and matching checksums for the codes. I wrote a
<a
- href="https://github.com/waffle87/synacor_challenge/blob/master/tools/validate.py"
+ href="https://git.pngu.org/synacor_challenge/tree/tools/validate.py"
target="_blank"
>small script</a
>
to validate them from a text file. I chose to implement my solution in C
with a simple stack data structure, as that seems most fitting for the task
at hand. My implementation and related tools can be found
- <a href="https://github.com/waffle87/synacor_challenge" target="_blank"
+ <a href="https://git.pngu.org/synacor_challenge" target="_blank"
>here</a
>
for those interested. The rest of what's here is likely to be spoilers...
@@ -139,7 +143,7 @@ _ + _ * _^2 + _^3 - _ = 399
</ul>
This is easy enough to be by hand, but why not make another
<a
- href="https://github.com/waffle87/synacor_challenge/blob/master/tools/coin.py"
+ href="https://git.pngu.org/synacor_challenge/tree/tools/coin.py"
target="_blank"
>script</a
>
@@ -167,7 +171,7 @@ You activate the teleporter! As you spiral through time and space, you think yo
>Ackermann function</a
>. The modified function can be found in the
<a
- href="https://github.com/waffle87/synacor_challenge/blob/master/tools/ackermann.c"
+ href="https://git.pngu.org/synacor_challenge/tree/tools/ackermann.c"
target="_blank"
>program</a
>
@@ -188,7 +192,7 @@ It begins to rain. The message washes away. You take a deep breath and feel firm
This is a BFS application to construct the shortest path to the door. I made
another
<a
- href="https://github.com/waffle87/synacor_challenge/blob/master/tools/orb_maze.py"
+ href="https://git.pngu.org/synacor_challenge/tree/tools/orb_maze.py"
target="_blank"
>script</a
>