def find_shortest_path(node_1,node_2):
    """
    Given two nodes indicated by a string of their move sequence from the start
    node (forward moves only), this method returns the shortest move sequence
    from node_1 to node_2.
    """
    # Change to lists
    node_1 = list(node_1)
    node_1_common = node_1.copy()
    node_2 = list(node_2)
    node_2_common = node_2.copy()
    # Get length of smaller
    small_length = min(len(node_1),len(node_2))
    # get to smallest common parent node
    for i in range(small_length):
        if (node_1[i] == node_2[i]):
            # then pop because they are the same
            node_1_common.pop(0)
            node_2_common.pop(0)
        else:
            # as soon as this isn't true cant get any closer parent node
            break
    # Now generate path by reversing path to node_1, and follow path to node_2
    shortest_path = [x.lower() for x in node_1_common[::-1]]
    shortest_path.extend(node_2_common)
    return shortest_path