Python adjacent_moves示例

示例#1

文件： ia_exploring_and_chasing.py 项目： sniperkit/snk.dev-assistant

def compute_ghost_pos(pos, level, memory):
    visits_count = memory.setdefault('visits_count', defaultdict(lambda: 0))
    moves = adjacent_moves(pos)
    for blocked_pos in get_blocked_coords(list(moves), level):
        moves.remove(blocked_pos)
    if not moves:
        return pos
    if len(moves) == 1:
        return moves[0]
    for move in moves:
        for x, y in iter_coords(pos, move, level):
            if level[y][x] == 'H':
                memory['last_pos'] = pos
                visits_count[pos] += 1
                return move
    if 'last_pos' in memory and memory['last_pos'] in moves:
        moves.remove(memory['last_pos'])

    def sort_key(pos):
        return visits_count.get(pos, 0)

    new_pos = sorted(moves, key=sort_key)[0]
    memory['last_pos'] = pos
    visits_count[pos] += 1
    return new_pos

示例#2

def compute_ghost_pos(pos, level, _):
    moves = adjacent_moves(pos)
    for blocked_pos in get_blocked_coords(list(moves), level):
        moves.remove(blocked_pos)
    if not moves:
        return pos
    return random.choice(moves)

示例#3

文件： ia_random.py 项目： Lucas-C/linux_configuration

def compute_ghost_pos(pos, level, _):
    moves = adjacent_moves(pos)
    for blocked_pos in get_blocked_coords(list(moves), level):
        moves.remove(blocked_pos)
    if not moves:
        return pos
    return random.choice(moves)

示例#4

文件： ia_no_backtrack.py 项目： sniperkit/snk.dev-assistant

def compute_ghost_pos(pos, level, memory):
    moves = adjacent_moves(pos)
    for blocked_pos in get_blocked_coords(list(moves), level):
        moves.remove(blocked_pos)
    if not moves:
        return pos
    if len(moves) == 1:
        return moves[0]
    if 'last_pos' in memory:
        moves.remove(memory['last_pos'])
    new_pos = random.choice(moves)
    memory['last_pos'] = pos
    return new_pos

示例#5

文件： ia_chasing.py 项目： Lucas-C/linux_configuration

def compute_ghost_pos(pos, level, memory):
    moves = adjacent_moves(pos)
    for blocked_pos in get_blocked_coords(list(moves), level):
        moves.remove(blocked_pos)
    if not moves:
        return pos
    if len(moves) == 1:
        return moves[0]
    for move in moves:
        for x, y in iter_coords(pos, move, level):
            if level[y][x] == 'H':
                memory['last_pos'] = pos
                return move
    if 'last_pos' in memory and memory['last_pos'] in moves:
        moves.remove(memory['last_pos'])
    new_pos = random.choice(moves)
    memory['last_pos'] = pos
    return new_pos

示例#6

文件： ia_exploring_and_chasing.py 项目： Lucas-C/linux_configuration

def compute_ghost_pos(pos, level, memory):
    visits_count = memory.setdefault('visits_count', defaultdict(lambda: 0))
    moves = adjacent_moves(pos)
    for blocked_pos in get_blocked_coords(list(moves), level):
        moves.remove(blocked_pos)
    if not moves:
        return pos
    if len(moves) == 1:
        return moves[0]
    for move in moves:
        for x, y in iter_coords(pos, move, level):
            if level[y][x] == 'H':
                memory['last_pos'] = pos
                visits_count[pos] += 1
                return move
    if 'last_pos' in memory and memory['last_pos'] in moves:
        moves.remove(memory['last_pos'])
    def sort_key(pos):
        return visits_count.get(pos, 0)
    new_pos = sorted(moves, key=sort_key)[0]
    memory['last_pos'] = pos
    visits_count[pos] += 1
    return new_pos