home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!sunic!dkuug!diku!torbenm
- From: torbenm@diku.dk (Torben AEgidius Mogensen)
- Newsgroups: sci.math
- Subject: Re: Tiling problem
- Message-ID: <1992Dec14.121909.1308@odin.diku.dk>
- Date: 14 Dec 92 12:19:09 GMT
- References: <israel.723716857@unixg.ubc.ca> <israel.723837962@unixg.ubc.ca> <1gggutINN29q@access.usask.ca>
- Sender: torbenm@thor.diku.dk
- Organization: Department of Computer Science, U of Copenhagen
- Lines: 43
-
- choy@skorpio.usask.ca (I am a terminator.) writes:
-
- >In article <israel.723837962@unixg.ubc.ca>, israel@unixg.ubc.ca (Robert B. Israel) writes:
- >|> In <rcbaaw.723228012@rwb.urc.tue.nl>, rwb.urc.tue.nl (Angelo
- >|> Wentzler) writes:
- >|>
- >|> >Given a grid of squares, tile it with black and white tiles and make
- >|> >the largest possible square so that no square contained in it has four
- >|> >equally colored corners.
-
-
- >Would the following be a recursive solution?
-
- >0
-
- >1
-
- >Kinda small--let's double the size.
-
- >00
- >00
-
- >Um ... no internal squares in these little squares so no 4 colored corners.
-
- Note that the posting did not say INTERNAL squares. The whole square
- also counts.
-
- >Doubling again:
-
- >0011
- >0011
- >1100
- >1100
-
- >Now your starting to worry. The internal squares have 4 (colored) corners.
- >In general, the internal 0 (or the internal 1) has two 0 corners and two
- >1 corners. So that's OK.
-
- Note also that ALL subsquares must be considered, not just those that
- are centered. The top-left 2x2 subsquare (and many more) has for
- identical corners.
-
- Torben Mogensen (torbenm@diku.dk)
-