Writing a TextTwist Implementation
Table of Contents
Github | http://github.com/ambuc/text-twist |
---|
$ runhaskell text-twist.hs
┌ T E X T T W I S T
├ Please enter a seed word:
domino
┏━━━━━━━━━━━━━━━━━━━━━┓
┃ ~~~ ~~~ ~~~~ ~~~~ ┃
┃ ~~~ ~~~ ~~~~ domino ┃
┃ ~~~ ~~~ ~~~~ ┃
┃ ~~~ ~~~ ~~~~ ┃
┗┯━━━━━━━━━━━━━━━━━━━━┛
├ Please enter a guess:
mind
┏━━━━━━━━━━━━━━━━━━━━━┓
┃ ~~~ ~~~ ~~~~ ~~~~ ┃
┃ ~~~ ~~~ mind domino ┃
┃ ~~~ ~~~ ~~~~ ┃
┃ ~~~ ~~~ ~~~~ ┃
┗┯━━━━━━━━━━━━━━━━━━━━┛
├ Please enter a guess:
mood
┏━━━━━━━━━━━━━━━━━━━━━┓
┃ ~~~ ~~~ ~~~~ ~~~~ ┃
┃ ~~~ ~~~ mind domino ┃
┃ ~~~ ~~~ ~~~~ ┃
┃ ~~~ ~~~ mood ┃
┗━━━━━━━━━━━━━━━━━━━━━┛
Text Twist is a classic old internet flash game in which the objective is to, given a starting word, find all the unique words which can be made from its letters.
This is a implementation in Haskell, playable from the shell. I hope the code is fairly readable.
You can just play the game:
$ runhaskell text-twist.hs
or, compile it first if you like:
$ ghc text-twist.hs
[1 of 1] Compiling Main ( text-twist.hs, text-twist.o )
Linking text-twist ...
$ ./text-twist
┌ T E X T T W I S T
│ Please enter a seed word:
...