width = 20  # This is the width of each piece
height = 20 # This is the height of each piece

x = 44 # This is the x co-ordinate of where the piece was placed
y = 71 # This is the y co-ordinate of where the piece was placed

def new_round(value, multiple):
    # Some dirty math to round "value" to the closest multiple of "multiple"
    return int(round(value / float(multiple)) * multiple)

newx = new_round(x, width)  # Round x to the closest width
newy = new_round(y, height) # Round y to the closest height

class puzzlePiece:
 
    def __init__(self, parent, x, y, width, height):
 
        self.parent = parent
        self.x = x # Piece's co-ordinates with respect to the origin of the image
        self.y = y
        self.width = width  # Width and height of the particular puzzle piece
        self.height = height
 
    def setPos(self, x, y):
 
        # The position with respect to the screen
        self.posx = x
        self.posy = y
 
    def setPrimaryAdjacencies(self, top=None, right=None, bottom=None, left=None):
 
        # Set the adjacency hash given that the puzzle piece is only just one piece
        # The adjacency hash defines what pieces CAN be connected to THIS puzzlePiece
        # Input is 4 other 'puzzlePiece' instances
        self.adjacencies = {}
        if top:
            self.adjacencies[top] = # Use some unique point of 'top' with respect to 'self', that can tell you when the pieces are close enough to connect :: This depends on *how* they are adjacent
        if right:
            # ...
        if bottom:  # yaddi yaddi yaddi ...
 
    def mergePieces(self, mergeWith):
 
        # Merge puzzlePiece instance 'self' with puzzlePiece instance 'mergeWith'
        # Remove mergeWith from self's adjacencies and vice-versa
        # Merge the two self.adjacencies
        # Assign a new width and height
        # Destroy mergeWith
 
    def render(self, x, y):
 
        self.parent.myParentsDrawOnScreenRoutine((self.x, self.y), (self.width, self.height))
 
 
class main:
 
    def isCloseEnough(self, a, b):
 
        # Check the adjacency list of 'a' to see if it is supposed to be adjacent to 'b', and close enough!
        if not a.adjacencies.has_key(b):
            return False
        connectPoint = a.adjacencies[b]
 
        # Check x proximity
        if b.posx > connectPoint[0] + a.posx - self.max_distance and b.posx < connectPoint[0] + a.posx + self.max_distance:
            # Check y proximity
            # Blah blah blah, etc.