-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #1 from KevinAst/next1
Initial Release
- Loading branch information
Showing
292 changed files
with
60,836 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,12 @@ | ||
| # node dependencies (defined via "npm install") | ||
| /node_modules/ | ||
|
|
||
| # logs | ||
| logs | ||
| *.log | ||
| npm-debug.log* | ||
|
|
||
| # runtime data | ||
| pids | ||
| *.pid | ||
| *.seed |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,21 @@ | ||
| MIT License | ||
|
|
||
| Copyright (c) 2018 Kevin Bridges | ||
|
|
||
| Permission is hereby granted, free of charge, to any person obtaining a copy | ||
| of this software and associated documentation files (the "Software"), to deal | ||
| in the Software without restriction, including without limitation the rights | ||
| to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | ||
| copies of the Software, and to permit persons to whom the Software is | ||
| furnished to do so, subject to the following conditions: | ||
|
|
||
| The above copyright notice and this permission notice shall be included in all | ||
| copies or substantial portions of the Software. | ||
|
|
||
| THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
| IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | ||
| FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | ||
| AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | ||
| LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | ||
| OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | ||
| SOFTWARE. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,93 @@ | ||
| <HTML> | ||
| <HEAD> | ||
| <TITLE>Maze Program</TITLE> | ||
| <!-- Author: Andrew Bridges [email protected] ... Copyright (c) 2001 --> | ||
| </HEAD> | ||
| <BODY BGCOLOR="#D0D0D0"> | ||
| <br> | ||
|
|
||
| <center><h1>Amazing Maze Applet</h1></center> | ||
|
|
||
| <div align="center"> | ||
| <table width="600" border="0" cellspacing="10" cellpadding="0"> | ||
| <tr> | ||
| <td> | ||
| <div align="center"> | ||
| Here is the actual program <b>running my Mice through the paces</b>.<br> | ||
| <font size="-1"><i>This is a Java Applet, requiring a 4.0 Java Enabled Browser to run.</i></font> | ||
| </div> | ||
| </td> | ||
| </tr> | ||
|
|
||
| <tr> | ||
| <td> | ||
| <div align="center"> | ||
| <applet code="MazeGen.class" archive="jar/AmazingMazes.jar" width="650" height="500" vspace="10" alt="Your browser does not support Java, or you have not enabled it :-("></applet> | ||
| </div> | ||
| </td> | ||
| </tr> | ||
|
|
||
| <tr> | ||
| <td> | ||
|
|
||
| <center> | ||
| <font size="-1" color="red"> | ||
| <i> | ||
| If no program appears above, either your browser does not | ||
| support Java or you have not enabled Java. | ||
| </i> | ||
| <br/><br/> | ||
| <b> | ||
| Unfortunantly, as of 2015 virtually no browser supports Java | ||
| Applets. | ||
|
|
||
| <br/><br/> | ||
|
|
||
| If time permits, I will post some videos of the app :-) | ||
| </b> | ||
| </font> | ||
| </center> | ||
|
|
||
| <ol> | ||
|
|
||
| <li>Below each Maze you can select the Mouse to run the puzzle. Be | ||
| careful with ScatterBrained ... he is not too smart, and may take a | ||
| long time to solve. | ||
|
|
||
| <li>The text box shows the results of each run (with an astrisk next to | ||
| the winner)! | ||
|
|
||
| <li>Each puzzle cycle will generate a new random maze and then make a | ||
| duplicate copy for each Mouse to traverse. It is then up to each | ||
| Mouse to solve the puzzle! Starting gates are at the green square, | ||
| and the finish line is in red. False moves are shown in gray, and the | ||
| solution is highlighted in yellow. Since this is a perfect maze, each | ||
| puzzle has only one solution. | ||
|
|
||
| <li>You may select the Maze Size, vary the Solve Speed, and put it in a | ||
| continous Cycle mode. | ||
|
|
||
| </ol> | ||
| If you want to learn more about Maze Generation, see <i><b>Bob Kirkland's</b></i> web site at | ||
| <a target="_top" href="http://www.mazeworks.com">http://www.mazeworks.com</a>. | ||
|
|
||
| </td> | ||
| </tr> | ||
|
|
||
| </table> | ||
| </div> | ||
|
|
||
| <p><hr width="50%"> | ||
| <center> | ||
| <font size="-1"> | ||
| Author: Andrew Bridges<br> | ||
| <!-- hhmts start --> | ||
| Last modified: Wed Aug 21 19:49:05 Central Daylight Time 2002 | ||
| <!-- hhmts end --> | ||
| <br> | ||
| Copyright © 2001 | ||
| </font> | ||
| </center><br> | ||
|
|
||
| </BODY> | ||
| </HTML> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,120 @@ | ||
| <HTML> | ||
| <HEAD> | ||
| <TITLE>Maze Abstract</TITLE> | ||
| <!-- Author: Andrew Bridges [email protected] ... Copyright (c) 2001 --> | ||
| </HEAD> | ||
| <BODY BGCOLOR="#D0D0D0"> | ||
| <br> | ||
| <ul> <!-- indentatation --> | ||
|
|
||
| <center><h1>Abstract</h1></center> | ||
|
|
||
| <center><h3>The Illinois Junior Academy of Science</h3></center> | ||
|
|
||
| <table border="0" cellspacing="5" cellpadding="0"> | ||
| <tr> | ||
| <td><b>Category:</b></td> | ||
| <td>Computer Science</td> | ||
| <td width="100"> </td> | ||
| <td><b>State</b></td> | ||
| </tr> | ||
| <tr> | ||
| <td><b>Name:</b></td> | ||
| <td>Andrew Bridges</td> | ||
| <td> </td> | ||
| <td><b>Region:</b> # 12</td> | ||
| </tr> | ||
| <tr> | ||
| <td><b>Address:</b></td> | ||
| <td><i><font size="-1">omitted for privacy reasons</font></i></td> | ||
| <td> </td> | ||
| <td><b> </b></td> | ||
| </tr> | ||
| <tr> | ||
| <td><b>City/Zip:</b></td> | ||
| <td>Glen Carbon/62034</td> | ||
| <td> </td> | ||
| <td><b> </b></td> | ||
| </tr> | ||
| <tr> | ||
| <td><b>Phone:</b></td> | ||
| <td><i><font size="-1">omitted for privacy reasons</font></i></td> | ||
| <td> </td> | ||
| <td><b> </b></td> | ||
| </tr> | ||
| <tr> | ||
| <td><b>Grade:</b></td> | ||
| <td>7th</td> | ||
| <td> </td> | ||
| <td><b> </b></td> | ||
| </tr> | ||
|
|
||
| <tr> | ||
| <td><b>School:</b></td> | ||
| <td>Good Shepherd Lutheran School</td> | ||
| <td> </td> | ||
| <td><b>IJAS</b></td> | ||
| </tr> | ||
| <tr> | ||
| <td><b>City/Zip:</b></td> | ||
| <td>Collinsville/62234</td> | ||
| <td> </td> | ||
| <td><b>School:</b> # 12019</td> | ||
| </tr> | ||
| <tr> | ||
| <td><b>Sponsor:</b></td> | ||
| <td>Mr. Rincker</td> | ||
| <td> </td> | ||
| <td><b> </b></td> | ||
| </tr> | ||
|
|
||
| <tr> | ||
| <td><b>Project Title:</b></td> | ||
| <td>Amazing Mazes</td> | ||
| <td> </td> | ||
| <td><b> </b></td> | ||
| </tr> | ||
| </table> | ||
|
|
||
| <br> | ||
| <b>Purpose:</b><br> | ||
| What strategy can a computer-simulated mouse use to solve a maze the | ||
| fastest (using the fewest number of moves)? I think that a | ||
| computer-simulated mouse that uses a random pattern will be able to | ||
| solve the maze in the fewest numbers of moves.<p> | ||
|
|
||
| <b>Procedure:</b><br> | ||
| <ol> | ||
|
|
||
| <li>Program several mice with different maze solving strategies.<p> | ||
|
|
||
| <li>Run several tests to tell which mouse can solve a maze the fastest | ||
| (using the fewest number of moves). For each test, all the mice will | ||
| solve the same maze. A lot of tests will be run with different mazes.<p> | ||
|
|
||
| <li>Summarize the data. This step will have a lot of data to average | ||
| since the computer can run many tests. Chart and average the data. | ||
| Determine if there is a clear trend, or pattern.<p> | ||
|
|
||
| </ol> | ||
|
|
||
| <b>Conclusion:</b><br> | ||
| The exhibitor's hypothesis was wrong. Goaly(the mouse that will | ||
| always go in the open direction that is nearest to the end of the | ||
| maze) was the winner by far. All the other strategies were worse.<p> | ||
|
|
||
| </ul> <!-- indentatation --> | ||
| <p><hr width="50%"> | ||
| <center> | ||
| <font size="-1"> | ||
| Author: Andrew Bridges<br> | ||
| <!-- hhmts start --> | ||
| Last modified: Wed Aug 21 19:48:47 Central Daylight Time 2002 | ||
| <!-- hhmts end --> | ||
| <br> | ||
| Copyright © 2001 | ||
| </font> | ||
| </center><br> | ||
|
|
||
| </BODY> | ||
| </HTML> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,38 @@ | ||
| <HTML> | ||
| <HEAD> | ||
| <TITLE>Maze Acknowledgments</TITLE> | ||
| <!-- Author: Andrew Bridges [email protected] ... Copyright (c) 2001 --> | ||
| </HEAD> | ||
| <BODY BGCOLOR="#D0D0D0"> | ||
| <br> | ||
| <ul> <!-- indentatation --> | ||
|
|
||
| <center><h1>Acknowledgments</h1></center> | ||
|
|
||
| I would like to thank my Dad for writing the Maze Solving engine. He | ||
| also taught me about objects and Java. He also helped me analyze the | ||
| data, and taught me how to use Visio to draw my diagrams. He also | ||
| converted my report to the Internet.<p> | ||
|
|
||
| I would like to thank Mr. Bob Kirkland | ||
| (<a target="_top" href="http://www.mazeworks.com">http://www.mazeworks.com</a>) | ||
| for letting me use his MazeGen program for generating mazes.<p> | ||
|
|
||
| I would like to thank my Mother for helping with the display board.<p> | ||
|
|
||
|
|
||
| </ul> <!-- indentatation --> | ||
| <p><hr width="50%"> | ||
| <center> | ||
| <font size="-1"> | ||
| Author: Andrew Bridges<br> | ||
| <!-- hhmts start --> | ||
| Last modified: Wed Aug 21 19:48:55 Central Daylight Time 2002 | ||
| <!-- hhmts end --> | ||
| <br> | ||
| Copyright © 2001 | ||
| </font> | ||
| </center><br> | ||
|
|
||
| </BODY> | ||
| </HTML> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,22 @@ | ||
| <HTML> | ||
| <HEAD> | ||
| <TITLE>Maze Banner</TITLE> | ||
| <!-- Author: Andrew Bridges [email protected] ... Copyright (c) 2001 --> | ||
| </HEAD> | ||
| <body bgcolor="#404040" text="#D0D0D0" link="#FFCC99" vlink="#FFCC99" alink="#FFCC99"> | ||
|
|
||
| <!-- Main Table --> | ||
| <center> | ||
| <table border="0" cellspacing="0" width="95%"> | ||
| <tr valign="center"> | ||
| <td align="left"><img alt="Amazing Mazes" src="images/logo.gif"></td> | ||
| <td align="right"> | ||
| <font size="+1"> | ||
| <i><b>By: AJ Bridges </b></i></font> | ||
| </td> | ||
| </tr> | ||
| </table> | ||
| </center> | ||
|
|
||
| </BODY> | ||
| </HTML> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,45 @@ | ||
| <HTML> | ||
| <HEAD> | ||
| <TITLE>Maze Conclusion</TITLE> | ||
| <!-- Author: Andrew Bridges [email protected] ... Copyright (c) 2001 --> | ||
| </HEAD> | ||
| <BODY BGCOLOR="#D0D0D0"> | ||
| <br> | ||
| <ul> <!-- indentatation --> | ||
|
|
||
| <center><h1>Conclusion</h1></center> | ||
|
|
||
| The exhibitor's hypothesis was wrong. <b>Goaly</b> (the mouse that | ||
| will always go in the open direction that is nearest to the end of the | ||
| maze) was the winner. All the other strategies were worse.<p> | ||
|
|
||
| <br> | ||
| <br> | ||
|
|
||
| <h1>Project Variations</h1> | ||
|
|
||
| Several things could change the results of this project.<p> | ||
|
|
||
| If the exhibitor had more time he could try a more complex type of | ||
| maze (other than a "perfect" maze), or a maze that has cells with more | ||
| than four walls.<p> | ||
|
|
||
| The mice used have total recall (they remember every place they have | ||
| been). If the exhibitor had more time he could build mice that would | ||
| only remember so many past steps. <p> | ||
|
|
||
| </ul> <!-- indentatation --> | ||
| <p><hr width="50%"> | ||
| <center> | ||
| <font size="-1"> | ||
| Author: Andrew Bridges<br> | ||
| <!-- hhmts start --> | ||
| Last modified: Wed Aug 21 19:49:10 Central Daylight Time 2002 | ||
| <!-- hhmts end --> | ||
| <br> | ||
| Copyright © 2001 | ||
| </font> | ||
| </center><br> | ||
|
|
||
| </BODY> | ||
| </HTML> |
Oops, something went wrong.