diff options
| author | JP Appel <jeanpierre.appel01@gmail.com> | 2023-10-25 23:52:32 -0700 |
|---|---|---|
| committer | JP Appel <jeanpierre.appel01@gmail.com> | 2023-10-25 23:52:32 -0700 |
| commit | 99a1c02c80ee2d1154c163644a4e341aba4db192 (patch) | |
| tree | bc7fa105e78f7d6b27fa67335723b781400a1e5d /site/index.html | |
| parent | 33680b9a238ffda3a2efca654591e53e423b310f (diff) | |
made css more dynamic for mobile
Diffstat (limited to 'site/index.html')
| -rw-r--r-- | site/index.html | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/site/index.html b/site/index.html index 8043b0d..1aef62e 100644 --- a/site/index.html +++ b/site/index.html @@ -4,10 +4,10 @@ <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <link rel="stylesheet" href="style.css"> - <title>Toggle</title> + <title>Exploring Toggle Games on Graphs</title> </head> <body> - <h1>Toggle</h1> + <h1>Exploring Toggle Games on Graphs</h1> <nav> <a href="game"><button>Heat Toggle Demo</button></a> </nav> @@ -15,17 +15,17 @@ <section id="history"> <h2>History of Toggle</h2> <p> - Lights Out<b>TM</b> is a commercial one-player game that consists of sequentially turning lights on or off on a 5 × 5 array. The game can be represented as a 5 × 5 lattice with vertex labels 1 (on) and 0 (off). A move involves toggling the 0/1 status of a vertex as well as the 0/1 status of all its orthogonal neighbors. A complete strategy for this game is detailed by Anderson and Feil in <a href="#">Turning Lights Out with Linear Algebra</a>. + Lights Out™ is a commercial one-player game that consists of sequentially turning lights on or off on a 5 × 5 array. The game can be represented as a 5 × 5 lattice with vertex labels 1 (on) and 0 (off). A move involves toggling the 0/1 status of a vertex as well as the 0/1 status of all its orthogonal neighbors. A complete strategy for this game is detailed by Anderson and Feil in <a href="#">Turning Lights Out with Linear Algebra</a>. </p> <p> - <b style="color">Fiorint Et. Al</b> + <b>Fiorint Et. Al</b> </p> </section> <section id="information"> <h2>Toggle Information</h2> <h3>Abstract</h3> <p> - <i>In the commercial one-player game Lights Out<b>TM</b> a grid of lights is randomly generated with some lights on and some lights off. The player can press a light to flip its on/off state as well as the state of its neighbors. Toggle seeks to transform Lights OutTM into a variety of impartial two-player games. Two players take turns toggling the on/off state of lights in an attempt to leave the other player with no available legal moves. We analyze Toggle on various finite simple graphs and use impartial game theory to determine which player has a winning strategy given an initial Toggle configuration. Finally, we prove that determining the winning player given an arbitrary Toggle configuration is PSpace-complete.</i> + <i>In the commercial one-player game Lights Out™ a grid of lights is randomly generated with some lights on and some lights off. The player can press a light to flip its on/off state as well as the state of its neighbors. Toggle seeks to transform Lights OutTM into a variety of impartial two-player games. Two players take turns toggling the on/off state of lights in an attempt to leave the other player with no available legal moves. We analyze Toggle on various finite simple graphs and use impartial game theory to determine which player has a winning strategy given an initial Toggle configuration. Finally, we prove that determining the winning player given an arbitrary Toggle configuration is PSpace-complete.</i> </p> </section> </main> |