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

  • patrickgao2020
     + 0 comments

    Here is my Python code! It's probably not the most efficient but I couldn't find any faster algorithms.

    def gridSearch(G, P):
    for row in range(len(G) - len(P) + 1):
        for col in range(len(G[0]) - len(P[0]) + 1):
            if G[row][col:col + len(P[0])] == P[0]:
                found = True
                for nrow in range(1, len(P)):
                    if G[row + nrow][col: col + len(P[0])] != P[nrow]:
                        found = False
                        break
                if found:
                    return "YES"
    return "NO"