We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. The Grid Search
  5. Discussions

The Grid Search

  • JedJulliard
     + 8 comments

    Python code

    check if first line of pattern fits into grid.

    if it does, check for every other line of the pattern.

    for every other line of pattern that checks off, add 1 to lineChecks

    once lineChecks == len(pattern) -1, return YES

    once a line of pattern does not check off, lineChecks return to zero.

    def gridSearch(G, P):
    lineChecks = 0
    for i in range(len(G[0])-len(P[0])+1):
        for j in range(len(G)-len(P)+1):
            if G[j][i:i+len(P[0])] == P[0]:
                for x in range(1,len(P)):
                    if G[j+x][i:i+len(P[0])] == P[x]:
                        lineChecks +=1
                        if lineChecks == len(P) - 1:
                            return "YES"
                    else:
                        lineChecks = 0
    return "NO"