Nordic Perl Workshop 2007

About
  What
  When
  Where
Information
  Call for Papers
  Sponsorship
  Presskit
  Wiki
Register
  Log in
Users
  Search
  Statistics
Presentations
  Favorite Talks
  Schedule
  iCal export
  Submit a talk proposal
Previous workshops
  NPW 2006
  NPW 2005
  NPW 2004
  SPW 2003
Related conferences
 YAPC::Europe 2014
 Dynamic Languages Conference 2014
 Swiss Perl Workshop 2014
 Barcelona Perl Workshop 2014
 Perl::Dancer Conference 2014
 Austrian Perl Workshop 2014
 London Perl Workshop

By Abigail from Philadelphia.pm NY.pm
Date: Sunday, 29 April 2007 14:15
Duration: 30 minutes
Language:

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


Regular expressions are capable of calculating more than most people expect them to. In this presentation we will show how the popular Sudokus can be solved using regular expressions. Given a Sudoku, we will construct a regular expression that, after matching, yields the Sudokus solution in $1, $2, $3, etc.



LogicLab FULLRATE ActiveState
Adapt Code3 Stonehenge
Versed Solutions The Perl Review YEF
Sifira DKUUG
Copenhagen Perl Mongers Nordic Perl Workshop 2007 is organized by the Copenhagen Perl Mongers and made possible by our sponsors

Valid XHTML 1.0 Transitional