Skip to content

Instantly share code, notes, and snippets.

@drewhutchison

drewhutchison/gist:9747015

Last active August 29, 2015 13:57
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save drewhutchison/9747015 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save drewhutchison/9747015 to your computer and use it in GitHub Desktop.
Download ZIP

Revisions

  1. drewhutchison revised this gist Mar 25, 2014. 1 changed file with 78 additions and 52 deletions.
    130 changes: 78 additions & 52 deletions gistfile1.py
    View file
    Original file line number Diff line number Diff line change
    @@ -1,74 +1,100 @@
    #!/usr/bin/env python

    from copy import deepcopy
    from random import shuffle

    X = 10
    Y = 12

    grid = [[None for i in range(X)] for j in range(Y)]
    indices = [(i,j) for j in range(Y) for i in range(X)]
    shuffle(indices)

    # patterns will be a dict of dict of lists, such that:
    # patterns[c1][c2] = [(dx, dy), ...] where (dx, dy) are the offsets
    # from a tile of color c2 to a tile of color c1
    patterns = {}

    for j in range(Y):
    for i in range(X):
    c = 0
    while True:
    c += 1

    # check if we're the same color of adjacent tiles
    print 'on tile ', i, j, ' trying ', c
    if j>0:
    if i>0:
    if grid[j-1][i-1] == c:
    print 'matches above left'
    continue
    if i+1<X:
    if grid[j-1][i+1] == c:
    print 'matches above right'
    continue
    if grid[j-1][i] == c:
    print 'matches above'
    for i,j in indices:
    c = 0
    while True:
    c += 1

    # check if we're the same color of adjacent tiles
    print 'on tile ', i, j, ' trying ', c
    if j>0:
    if i>0:
    if grid[j-1][i-1] == c:
    print 'matches above left'
    continue
    if i+1<X:
    if grid[j-1][i+1] == c:
    print 'matches above right'
    continue
    if grid[j-1][i] == c:
    print 'matches above'
    continue
    if i>0:
    if grid[j][i-1] == c:
    print 'matches left'
    continue
    if i+1<X:
    if grid[j][i+1] == c:
    print 'matches right'
    continue
    if j+1<Y:
    if i>0:
    if grid[j][i-1] == c:
    print 'matches left'
    if grid[j+1][i-1] == c:
    print 'matches below left'
    continue

    # now check the offsets. the test algorithm is destructive, so
    # copy the dict
    if not c in patterns: patterns[c] = {}
    newpatterns = deepcopy(patterns)
    flag = False
    if i+1<X:
    if grid[j+1][i+1] == c:
    print 'matches below right'
    continue
    if grid[j+1][i] == c:
    print 'matches below'
    continue


    # now check the offsets. the test algorithm is destructive, so
    # copy the dict
    newpatterns = deepcopy(patterns)
    flag = False

    for ii,jj in [(ii,jj)
    for jj in range(Y)
    for ii in range(X)]:
    # skip testing ourself
    if i == ii and j == jj: continue

    # check all tiles in above rows and to the left of us in present row
    for ii,jj in [(ii,jj)
    for jj in range(j)
    for ii in range(X)] + [(ii, j)
    for ii in range(i)]:
    dx = ii-i
    dy = jj-j
    testcolor = grid[jj][ii]
    matches = newpatterns[c].setdefault(testcolor, [])
    if (dx, dy) in matches:
    print 'matches %d at (%d, %d)' % (testcolor, dx, dy)
    flag = True
    break
    newpatterns[c][testcolor].append((dx,dy))

    # can't tell if we broke the loop or fell off the end.
    # flags are unpythonic but this was a quick hack. if the flag was
    # never set, we didn't conflict with any existing patterns, so
    # overwrite the old dict with the ones we've testing by the append
    # statement above
    if not flag:
    patterns = newpatterns
    dx = ii-i
    dy = jj-j
    testcolor = grid[jj][ii]

    # skip if there's no one there
    if not testcolor: continue

    matches = newpatterns.setdefault(c, {}).setdefault(testcolor, [])
    if (dx, dy) in matches:
    print 'matches %d at (%d, %d)' % (testcolor, dx, dy)
    flag = True
    break
    newpatterns[c][testcolor].append((dx,dy))
    newpatterns.setdefault(testcolor,
    {}).setdefault(c, []).append((-dx,-dy))

    # can't tell if we broke the loop or fell off the end. I know
    # flags are unpythonic but this was a quick hack. if the flag was
    # never set, we didn't conflict with any existing patterns, so
    # overwrite the old dict with the ones we've testing by the append
    # statement above
    if not flag:
    patterns = newpatterns
    break

    print 'setting (%d, %d) to %d' % (i, j, c)
    grid[j][i] = c
    print 'setting (%d, %d) to %d' % (i, j, c)
    grid[j][i] = c

    for line in grid:
    print ' '.join(['%02d' % tile for tile in line])
    print ' '.join(['%02d' % tile for tile in line])
    print 'total used: ', max([max(row) for row in grid])
  2. drewhutchison created this gist Mar 24, 2014.
    74 changes: 74 additions & 0 deletions gistfile1.py
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,74 @@
    #!/usr/bin/env python

    from copy import deepcopy

    X = 10
    Y = 12

    grid = [[None for i in range(X)] for j in range(Y)]

    # patterns will be a dict of dict of lists, such that:
    # patterns[c1][c2] = [(dx, dy), ...] where (dx, dy) are the offsets
    # from a tile of color c2 to a tile of color c1
    patterns = {}

    for j in range(Y):
    for i in range(X):
    c = 0
    while True:
    c += 1

    # check if we're the same color of adjacent tiles
    print 'on tile ', i, j, ' trying ', c
    if j>0:
    if i>0:
    if grid[j-1][i-1] == c:
    print 'matches above left'
    continue
    if i+1<X:
    if grid[j-1][i+1] == c:
    print 'matches above right'
    continue
    if grid[j-1][i] == c:
    print 'matches above'
    continue
    if i>0:
    if grid[j][i-1] == c:
    print 'matches left'
    continue

    # now check the offsets. the test algorithm is destructive, so
    # copy the dict
    if not c in patterns: patterns[c] = {}
    newpatterns = deepcopy(patterns)
    flag = False

    # check all tiles in above rows and to the left of us in present row
    for ii,jj in [(ii,jj)
    for jj in range(j)
    for ii in range(X)] + [(ii, j)
    for ii in range(i)]:
    dx = ii-i
    dy = jj-j
    testcolor = grid[jj][ii]
    matches = newpatterns[c].setdefault(testcolor, [])
    if (dx, dy) in matches:
    print 'matches %d at (%d, %d)' % (testcolor, dx, dy)
    flag = True
    break
    newpatterns[c][testcolor].append((dx,dy))

    # can't tell if we broke the loop or fell off the end.
    # flags are unpythonic but this was a quick hack. if the flag was
    # never set, we didn't conflict with any existing patterns, so
    # overwrite the old dict with the ones we've testing by the append
    # statement above
    if not flag:
    patterns = newpatterns
    break

    print 'setting (%d, %d) to %d' % (i, j, c)
    grid[j][i] = c

    for line in grid:
    print ' '.join(['%02d' % tile for tile in line])