Remove hint.html and index.html
As per discussions on GitHub the index.html and hint.html files should be deleted in favour of README.md files (from any .text/.txt/.markdown/.md files which will be turned into README.md in an upcoming commit).
This commit is contained in:
1 parent
ee8a36310f
commit
77fb0f11a2
143 files changed
-28606
No files matched your search
@@ -1,105 +0,0 @@
|
||||
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
|
||||
<html>
|
||||
<head>
|
||||
<meta name="GENERATOR" content="mkd2html 2.2.0">
|
||||
<meta http-equiv="Content-Type"
|
||||
content="text/html; charset=utf-8"> <link rel="stylesheet"
|
||||
type="text/css"
|
||||
href="../hint.css">
|
||||
<title>Most in need of whitespace</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1>Most in need of whitespace</h1>
|
||||
|
||||
<p>Joshua Karns<br>
|
||||
Twitter: @jkarnss</p>
|
||||
|
||||
<h2>Judges' comments:</h2>
|
||||
|
||||
<h3>To use:</h3>
|
||||
|
||||
<pre><code>make
|
||||
|
||||
./prog < textfile_that_fits_on_the_screen
|
||||
</code></pre>
|
||||
|
||||
<h3>Try:</h3>
|
||||
|
||||
<pre><code>make test
|
||||
|
||||
./prog < hint.text
|
||||
</code></pre>
|
||||
|
||||
<h3>Selected Judges Remarks:</h3>
|
||||
|
||||
<p>If you typically get lost in mazes, watching this program run might – or might not, YMMV –
|
||||
teach you how to find your way in a maze. The algorithm is well-known but the drawing is amazing!</p>
|
||||
|
||||
<p>Before running, make sure that your terminal can accommodate the whole file. Before running “make test”,
|
||||
make it about 120x40 to be safe, ensuring that you see the @ sign as well as the exclamation mark.</p>
|
||||
|
||||
<p>…Oh, and the first M in YMMV stands for “mazing”.</p>
|
||||
|
||||
<p>A puzzle for the reader: Can you change the program to consider a diagonal movement as one step?</p>
|
||||
|
||||
<h2>Author’s comments:</h2>
|
||||
|
||||
<h2>The Program</h2>
|
||||
|
||||
<p>This program is pretty simple! It performs a breadth first search on the
|
||||
specified graph. The graph can be any ascii text file that has an ‘at’
|
||||
character, which is going to be the starting location, and a ‘!’ character
|
||||
which will be the destination.</p>
|
||||
|
||||
<p>The nodes on this graph that are spaces are connected with any directly
|
||||
adjacent nodes that are also spaces. Nodes that aren’t spaces are not
|
||||
connected with anything.</p>
|
||||
|
||||
<h2>Compiling and Running</h2>
|
||||
|
||||
<p>This program usually compiles under both GCC and clang. Build with:</p>
|
||||
|
||||
<pre><code>$(CC) -std=c99 -o tbfs prog.c
|
||||
</code></pre>
|
||||
|
||||
<p>where $(CC) is cc, gcc, clang, or somet other c compiler.</p>
|
||||
|
||||
<p>You can then run it with:
|
||||
cat <input file> | ./tbfs</p>
|
||||
|
||||
<p>Examples:
|
||||
./tbfs < maze
|
||||
./tbfs < prog.c</p>
|
||||
|
||||
<h2>Issues</h2>
|
||||
|
||||
<ul>
|
||||
<li>The program must be ran in a terminal that supports ANSI escape codes for
|
||||
moving the cursor and changing colors.</li>
|
||||
<li>Segfaults happen sometimes.</li>
|
||||
<li>I don’t know what memergy management there is, if any.</li>
|
||||
<li>Ths program will not compile by an ANSI C compiler: it uses for loops, and
|
||||
it uses C++ style comments. It should compile cleanly using a C99 standard.</li>
|
||||
<li>Breadth first search is slow (and very slow on certain maps), but my A star
|
||||
version of this program is too big.</li>
|
||||
<li>Lots of extra whitespace may be needed if you want to feed in an arbitrary
|
||||
file.</li>
|
||||
<li>It fails to compile on GCC sometimes (according to a friend of mine, I’ve
|
||||
not encountered this myself).</li>
|
||||
<li>The program could be obfuscated much further.</li>
|
||||
<li>The program contains some unused code and data.</li>
|
||||
</ul>
|
||||
|
||||
|
||||
<hr />
|
||||
|
||||
<TABLE><TR>
|
||||
<TD><a rel="license" href="https://creativecommons.org/licenses/by-sa/3.0/"><img alt="Creative Commons License" style="border-width:0" src="/png/by-sa-3.0-88x31.png" /></a></TD>
|
||||
<TD><P>© Copyright 1984-2019,
|
||||
<A HREF="/judges.html">Leo Broukhis, Simon Cooper, Landon Curt Noll</A>
|
||||
- All rights reserved<BR>
|
||||
This work is licensed under a <a rel="license" href="https://creativecommons.org/licenses/by-sa/3.0/">Creative Commons Attribution-ShareAlike 3.0 Unported License</a>.</P></TD>
|
||||
<TD> <!--<a href="https://validator.w3.org/check?uri=referer"><img src="https://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional" height="31" width="88"></a>--></TD>
|
||||
</TR></TABLE>
|
||||
</body>
|
||||
</html>
|
||||
Reference in new issue
Block a user