![]() In all fairness, this is nothing more than an intellectual challenge at the moment and part of me wants to solve it myself, but I'd at least like to have a fallback or have that 'so that's how they do it.' moment. The annoying thing is that these cards have existed for years, so there must be a documented methodology somewhere, maybe even for making them by hand. The next thing I'm going to try is to determine 15 'useable' squares per grid beforehand and then fill with the numbers after but I'm not confident this will solve it. I'm thinking there might be a smarter placement method, possibly using recursion but I can't find one. The problems seems to be creating the right distribution and using purely random methods, most of the time, the rules start to work against you by the time you get into the 70s. See Bingo Cards - Numbers 1-90 - French Teacher Resources for an example (despite the fact that the downloaded pdf has 3 numbers in some of the columns in the individual boxes, the actual printed examples I have conform to the above rules) An individual box has 15 numbers, 5 per row and between 1 and 2 per column ![]() The numbers 1 - 9 (9 numbers) are in the first column and 80-90 (11 numbers) in the 9th, the intervening columns (2-8) contain 10 numbers each.ģ. A bingo 'card' is a set of 6 individual 3 x 9 grids, stacked vertically, which contain the numbers 1-90Ģ. ![]() Maybe my googling powers are not up to it but what I can't find anywhere is a proper bingo card generator. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |