wu :: forums - Print Page


    
      
        wu :: forums
        (http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi)
      

        riddles >> hard >> Group Jigsaw Puzzling (torturing little kids)
        
(Message started by: william wu on Feb 28^th, 2004, 5:12pm)

Title: Group Jigsaw Puzzling (torturing little kids)
Post by william wu on Feb 28^th, 2004, 5:12pm

I have a picture which I eventually intend to slice up into pieces of a jigsaw puzzle. After the pieces are sliced, I can also make multiple copies of any piece. I plan to distribute the pieces among K children such that the following statement holds:

When any group of m children share their pieces, they can reconstruct at least one picture if and only if m [ge] T, where T is a fixed integer in {1,...,K}. If any number of children less than T get together, they must be unable to reproduce the picture -- in other words, their combined pool of pieces must be missing at least one piece of the picture.

Questions:

For a given T and K, determine

1) the number of jigsaw pieces that should be made
2) how to distribute the pieces among the children such that the requirements are fulfilled

Title: Re: Group Jigsaw Puzzling (torturing little kids)
Post by william wu on Feb 29^th, 2004, 9:19am

Oops. This problem is on the site already :P

I'll delete this thread shortly.