I suspect you could use bitmap data to achieve something along these lines - if each piece has a special pixel - you can use that pixel to check against a master bitmap to see if it's in the right place, combined with snapping it should make it quite easy. - if you know it's in the right place and one of it's neighbours has also been placed then you can make this a 'combined piece'.
Something along those lines anyhow. M > -----Original Message----- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] On Behalf Of lars > Sent: 10 March 2006 23:43 > To: Flashcoders mailing list > Subject: Re: [Flashcoders] puzzle: how to verify piece-fitting? > > yeah, kind of. one thing makes it easy that is that all > pieces can only be placed in a pre-defined area (a shape > showing the outline of the puzzle), but i'm still looking for > some kind of algorythm that makes the already fitted pieces > drag/drop together... like having a,b,c mixed up, all single > drag/drop-able, but when c fits to a they both "join" and get > drag/drop- able as one "piece". that's the problem i now > have. any solutions welcome. > thanks: lars _______________________________________________ Flashcoders@chattyfig.figleaf.com To change your subscription options or search the archive: http://chattyfig.figleaf.com/mailman/listinfo/flashcoders Brought to you by Fig Leaf Software Premier Authorized Adobe Consulting and Training http://www.figleaf.com http://training.figleaf.com
