___agram

Inspiration

Dylan just took CSE 100 last quarter, and he couldn't stop yapping about Burrows–Wheeler transformation, the result of which is an anagram of the original string. Benny had seen videos in which people try to guess the original word by looking at its anagram, and we thought it would be fun.

What it does

A word is displayed as an anagram and the user attempts to guess the original word in as little tries as possible. The player can either choose for the word to come from a predetermined word bank associated with a category, or they can input their own word.

How we built it

We used Java, plus an API which finds anagram for a word.

Challenges we ran into

The API we use cannot take words longer than 9 characters, so we have to find a workaround.

Accomplishments that we're proud of

Benny used a random permutation generator instead of a sequential permutation generator, which increased the speed of finding a valid anagram by 50x. Dylan was able to implement the category system, using file I/O rather than just scanner.

What we learned

The structure of the code is the most important thing, and we should not head right into coding before determining what components and methods the class should have.

What's next for ___agram

Adding a GUI instead of using console for the users; Allowing users to play with their friends remotely.

Built With

• anagramica
• java