Matts has asked for the wisdom of the Perl Monks concerning the following question:
OK, here's a challenge for a budding perl programmer...
Given a 4x4 grid (i.e. 16 squares) that represent a bingo card, and given that you can win with a row in any direction or diagonal, the 4 corners, or ultimately with "BINGO" - all 16 squares, what is the minimum number of numbers you need to guarantee the following things:
1. Each card can win
2. Each card is unique (discounting ordering)
For extra kudos, generate the cards (ascii art is fine).
(note this isn't a college question - I'm trying to do this myself too (and other monks can confirm I'm no a student) - I was just curious as to what other solutions people come up with)
|
---|
Replies are listed 'Best First'. | |
---|---|
•Re: Bingo Challenge
by merlyn (Sage) on May 19, 2002 at 15:42 UTC | |
Re: Bingo Challenge
by Matts (Deacon) on May 19, 2002 at 16:29 UTC | |
by CharlesClarkson (Curate) on May 20, 2002 at 02:56 UTC | |
by Matts (Deacon) on May 20, 2002 at 06:47 UTC | |
by CharlesClarkson (Curate) on May 20, 2002 at 11:16 UTC | |
Bingo redux
by runrig (Abbot) on May 19, 2002 at 18:13 UTC | |
Re: Bingo Challenge
by Matts (Deacon) on May 19, 2002 at 15:53 UTC |
Back to
Seekers of Perl Wisdom