Solving WordBrain - A Depth First Search of a Problem Of Great Breadth

Solving WordBrain - A Depth First Search of a Problem Of Great Breadth

By Robert Stone (‎drzigman‎) from
Date: Monday, 20 June 2016 15:30
Duration: 50 minutes
Target audience: Intermediate
Language: English
Tags: algorithms games nytprof perl theory

You can find more information on the speaker's site:

(Updated slides available at Talk URL)
(Game::WordBrain released to CPAN - )

WordBrain is a highly rated Word Game in the various app stores. This presentations begins with a high level discussion of Depth First vs Breadth First Search and then dives into the various components required in order to "Solve" the game.

Beginning with an explanation of the rules and gotchas of WordBrain, we next dive into the key steps of solving a game:

1. Modeling the Problem
2. Creating Logic that Implements the Rules of the Game
3. Implementing a Solver that plays the game
4. Enumerating Potential Solutions using the Solver

After we have a working implementation we identify areas to optimize and speed up our solution finding through the use of NYTProf as well as various algorithm changes that could be made.

Not only will word game fans find this a fun and interesting talk but it's also an excellent introduction to how software can be written to solve game problems in addition to using profiling to find bottlenecks and improve performance.

Attended by: Todd Rinaldo (‎toddr‎), Jeff Till, Turd Furgison (‎fartfart‎), Rish, Ross Steiner (‎rdsteiner‎), Thomas Glase, vroom, Julian Brown, Dawn Wallis (‎wallisds‎), Michael Hamlin (‎myrrhlin‎), Thomas Stanton (‎tstanton‎), R Geoffrey Avery (‎rGeoffrey‎),