tgorordo/titanic.caltech.edu
1
0
Fork 0
mirror of https://github.com/tgorordo/titanic.caltech.edu.git synced 2026-06-05 14:52:15 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions

Update README, cleanup

Browse source 
Removed installation link and redundant source reference.
This commit is contained in:
Thomas (Tom) C. Gorordo 2026-05-29 03:47:10 -07:00 • committed by GitHub
parent 14280f2ccd
commit 3e03ffc7ca
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
1 changed files with 1 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

7
README.md
View file

@ -15,12 +15,7 @@ Here are the things I have on [titanic](https://titanic.caltech.edu):
A discord bot & cli tool to play and solve [lightsout](https://en.wikipedia.org/wiki/Lights_Out_(game)) games, written for A discord bot & cli tool to play and solve [lightsout](https://en.wikipedia.org/wiki/Lights_Out_(game)) games, written for
Ditch Day 2020 as alum help. It was written in a day, so it's pretty hacky but it can manage arbitrary NxN prime-number-colored boards. Ditch Day 2020 as alum help. It was written in a day, so it's pretty hacky but it can manage arbitrary NxN prime-number-colored boards.
The bot runs from my account on titanic whenever I remember to have it running/restart it and can be played on the γδβall-discord bot interaction channel. The bot runs from my account on titanic whenever I remember to have it running/restart it and can be played on the γδβall-discord bot interaction channel.
([source](https://github.com/tgorordo/discord-lightsout))
Here's an installation link:
[`https://discord.com/oauth2/authorize?client_id=1239472456092094494`](https://discord.com/oauth2/authorize?client_id=1239472456092094494)
([source](https://github.com/tgorordo/discordbot-lightsout))
## Traveling Tommy's Problem ## Traveling Tommy's Problem
Here's a page with a solution to the traveling salesman problem for visiting every Here's a page with a solution to the traveling salesman problem for visiting every