Delete game with huggingface_hub

game/data/Block3D/generate.py

@@ -1,57 +0,0 @@
-import random
-STATIC_LEVELS = [{'name': '入门 - 一字型 (2块)', 'blocks': [(2, 2, 0), (3, 2, 0)]}, {'name': '简单 - 椅子 (4块)', 'blocks': [(2, 2, 0), (2, 3, 0), (2, 2, 1), (2, 2, 2)]}, {'name': '中等 - 拱门 (9块)', 'blocks': [(1, 2, 0), (1, 2, 1), (1, 2, 2), (3, 2, 0), (3, 2, 1), (3, 2, 2), (1, 2, 3), (2, 2, 3), (3, 2, 3)]}, {'name': '困难 - 螺旋梯 (10块)', 'blocks': [(2, 2, 0), (2, 3, 0), (3, 3, 0), (3, 2, 0), (3, 1, 1), (2, 1, 1), (1, 1, 1), (1, 2, 1), (1, 3, 2), (2, 3, 2)]}, {'name': '进阶 - 实心立方体 (8块)', 'blocks': [(2, 2, 0), (3, 2, 0), (2, 3, 0), (3, 3, 0), (2, 2, 1), (3, 2, 1), (2, 3, 1), (3, 3, 1)]}, {'name': '进阶 - 金字塔 (15块)', 'blocks': [(1, 1, 0), (2, 1, 0), (3, 1, 0), (1, 2, 0), (2, 2, 0), (3, 2, 0), (1, 3, 0), (2, 3, 0), (3, 3, 0), (2, 1, 1), (1, 2, 1), (2, 2, 1), (3, 2, 1), (2, 3, 1), (2, 2, 2)]}, {'name': '挑战 - 字母 H (10块)', 'blocks': [(1, 2, 0), (1, 2, 1), (1, 2, 2), (1, 2, 3), (3, 2, 0), (3, 2, 1), (3, 2, 2), (3, 2, 3), (2, 2, 1), (2, 2, 2)]}, {'name': '挑战 - 枯井 (16块)', 'blocks': [(1, 1, 0), (2, 1, 0), (3, 1, 0), (1, 3, 0), (2, 3, 0), (3, 3, 0), (1, 2, 0), (3, 2, 0), (1, 1, 1), (2, 1, 1), (3, 1, 1), (1, 3, 1), (2, 3, 1), (3, 3, 1), (1, 2, 1), (3, 2, 1)]}, {'name': '专家 - 浮空十字 (8块)', 'blocks': [(2, 2, 0), (2, 2, 1), (2, 2, 2), (2, 2, 3), (1, 2, 2), (3, 2, 2), (2, 1, 2), (2, 3, 2)]}]
-
-def generate_random_level_data(num_blocks, grid_size=6):
-    """Helpers."""
-    blocks = set()
-    start_pos = (random.randint(1, grid_size - 2), random.randint(1, grid_size - 2), 0)
-    blocks.add(start_pos)
-    attempts = 0
-    while len(blocks) < num_blocks and attempts < 1000:
-        attempts += 1
-        base = random.choice(list(blocks))
-        bx, by, bz = base
-        directions = [(1, 0, 0), (-1, 0, 0), (0, 1, 0), (0, -1, 0), (0, 0, 1), (0, 0, -1)]
-        dx, dy, dz = random.choice(directions)
-        nx, ny, nz = (bx + dx, by + dy, bz + dz)
-        if 0 <= nx < grid_size and 0 <= ny < grid_size and (0 <= nz < grid_size):
-            blocks.add((nx, ny, nz))
-    return sorted(list(blocks))
-
-def export_to_file(filename='level_data.py'):
-    all_levels = []
-    all_levels.extend(STATIC_LEVELS)
-    random_counts = [1, 1, 1, 3, 3, 3, 4, 4, 4, 5, 5]
-    for count in random_counts:
-        blocks = generate_random_level_data(count)
-        all_levels.append({'name': f'随机生成 - 未知结构 ({count}块)', 'blocks': blocks})
-    all_levels.sort(key=lambda x: len(x['blocks']))
-    with open(filename, 'w', encoding='utf-8') as f:
-        f.write('# Auto-generated Level Data\n')
-        f.write('# Sorted by block count (Easy -> Hard)\n\n')
-        f.write('LEVEL_DESIGNS = {\n')
-        for index, data in enumerate(all_levels):
-            new_id = str(index + 1)
-            block_count = len(data['blocks'])
-            f.write(f'    "{new_id}": {{\n')
-            f.write(f"""        "name": "[Lv.{new_id}] {data['name']} (共{block_count}块)",\n""")
-            f.write(f'        "blocks": [\n')
-            blocks = data['blocks']
-            line_buffer = ''
-            for b in blocks:
-                s = str(b) + ', '
-                if len(line_buffer) + len(s) > 80:
-                    f.write(f'            {line_buffer}\n')
-                    line_buffer = s
-                else:
-                    line_buffer += s
-            if line_buffer:
-                f.write(f'            {line_buffer}\n')
-            f.write(f'        ]\n')
-            f.write(f'    }},\n')
-        f.write('}\n')
-    print(f'成功生成 {filename}!')
-    print(f'共导出 {len(all_levels)} 个关卡，已按物块数量从小到大排序。')
-    print(f'现在你可以按顺序游玩：python game.py 1, python game.py 2 ...')
-if __name__ == '__main__':
-    export_to_file()

game/data/Block3D/level_data.py

@@ -1 +0,0 @@
-LEVEL_DESIGNS = {'1': {'name': '[Lv.1] 随机生成 - 未知结构 (1块) (共1块)', 'blocks': [(2, 2, 0)]}, '2': {'name': '[Lv.2] 随机生成 - 未知结构 (1块) (共1块)', 'blocks': [(4, 4, 0)]}, '3': {'name': '[Lv.3] 随机生成 - 未知结构 (1块) (共1块)', 'blocks': [(1, 3, 0)]}, '4': {'name': '[Lv.4] 入门 - 一字型 (2块) (共2块)', 'blocks': [(2, 2, 0), (3, 2, 0)]}, '5': {'name': '[Lv.5] 随机生成 - 未知结构 (3块) (共3块)', 'blocks': [(1, 1, 0), (1, 1, 1), (1, 2, 0)]}, '6': {'name': '[Lv.6] 随机生成 - 未知结构 (3块) (共3块)', 'blocks': [(0, 4, 1), (1, 4, 0), (1, 4, 1)]}, '7': {'name': '[Lv.7] 随机生成 - 未知结构 (3块) (共3块)', 'blocks': [(4, 4, 0), (4, 5, 0), (5, 5, 0)]}, '8': {'name': '[Lv.8] 简单 - 椅子 (4块) (共4块)', 'blocks': [(2, 2, 0), (2, 3, 0), (2, 2, 1), (2, 2, 2)]}, '9': {'name': '[Lv.9] 随机生成 - 未知结构 (4块) (共4块)', 'blocks': [(2, 0, 0), (2, 1, 0), (3, 1, 0), (4, 1, 0)]}, '10': {'name': '[Lv.10] 随机生成 - 未知结构 (4块) (共4块)', 'blocks': [(3, 1, 0), (3, 2, 0), (4, 1, 0), (5, 1, 0)]}, '11': {'name': '[Lv.11] 随机生成 - 未知结构 (4块) (共4块)', 'blocks': [(1, 3, 0), (2, 2, 0), (2, 3, 0), (3, 2, 0)]}, '12': {'name': '[Lv.12] 随机生成 - 未知结构 (5块) (共5块)', 'blocks': [(4, 1, 0), (4, 2, 0), (4, 2, 1), (4, 2, 2), (5, 2, 0)]}, '13': {'name': '[Lv.13] 随机生成 - 未知结构 (5块) (共5块)', 'blocks': [(1, 2, 0), (1, 2, 1), (1, 2, 2), (1, 3, 1), (2, 2, 0)]}, '14': {'name': '[Lv.14] 进阶 - 实心立方体 (8块) (共8块)', 'blocks': [(2, 2, 0), (3, 2, 0), (2, 3, 0), (3, 3, 0), (2, 2, 1), (3, 2, 1), (2, 3, 1), (3, 3, 1)]}, '15': {'name': '[Lv.15] 专家 - 浮空十字 (8块) (共8块)', 'blocks': [(2, 2, 0), (2, 2, 1), (2, 2, 2), (2, 2, 3), (1, 2, 2), (3, 2, 2), (2, 1, 2), (2, 3, 2)]}, '16': {'name': '[Lv.16] 中等 - 拱门 (9块) (共9块)', 'blocks': [(1, 2, 0), (1, 2, 1), (1, 2, 2), (3, 2, 0), (3, 2, 1), (3, 2, 2), (1, 2, 3), (2, 2, 3), (3, 2, 3)]}, '17': {'name': '[Lv.17] 困难 - 螺旋梯 (10块) (共10块)', 'blocks': [(2, 2, 0), (2, 3, 0), (3, 3, 0), (3, 2, 0), (3, 1, 1), (2, 1, 1), (1, 1, 1), (1, 2, 1), (1, 3, 2), (2, 3, 2)]}, '18': {'name': '[Lv.18] 挑战 - 字母 H (10块) (共10块)', 'blocks': [(1, 2, 0), (1, 2, 1), (1, 2, 2), (1, 2, 3), (3, 2, 0), (3, 2, 1), (3, 2, 2), (3, 2, 3), (2, 2, 1), (2, 2, 2)]}, '19': {'name': '[Lv.19] 进阶 - 金字塔 (15块) (共15块)', 'blocks': [(1, 1, 0), (2, 1, 0), (3, 1, 0), (1, 2, 0), (2, 2, 0), (3, 2, 0), (1, 3, 0), (2, 3, 0), (3, 3, 0), (2, 1, 1), (1, 2, 1), (2, 2, 1), (3, 2, 1), (2, 3, 1), (2, 2, 2)]}, '20': {'name': '[Lv.20] 挑战 - 枯井 (16块) (共16块)', 'blocks': [(1, 1, 0), (2, 1, 0), (3, 1, 0), (1, 3, 0), (2, 3, 0), (3, 3, 0), (1, 2, 0), (3, 2, 0), (1, 1, 1), (2, 1, 1), (3, 1, 1), (1, 3, 1), (2, 3, 1), (3, 3, 1), (1, 2, 1), (3, 2, 1)]}}

game/data/maze3d/Level_01.txt

@@ -1,5 +0,0 @@
-#####
-#  S#
-# ###
-#E  #
-#####

game/data/maze3d/Level_02.txt

@@ -1,5 +0,0 @@
-#####
-# #S#
-# # #
-#E  #
-#####

game/data/maze3d/Level_03.txt

@@ -1,5 +0,0 @@
-#####
-#S  #
-### #
-#  E#
-#####

game/data/maze3d/Level_04.txt

@@ -1,7 +0,0 @@
-#######
-#    E#
-# ### #
-# #   #
-# # ###
-#S#   #
-#######

game/data/maze3d/Level_05.txt

@@ -1,7 +0,0 @@
-#######
-#S    #
-##### #
-#   # #
-# ### #
-#    E#
-#######

game/data/maze3d/Level_06.txt

@@ -1,7 +0,0 @@
-#######
-#    E#
-##### #
-#     #
-# ### #
-#S#   #
-#######

game/data/maze3d/Level_07.txt

@@ -1,7 +0,0 @@
-#######
-#S#   #
-# # # #
-# # # #
-# ### #
-#    E#
-#######

game/data/maze3d/Level_08.txt

@@ -1,7 +0,0 @@
-#######
-#S#   #
-# # # #
-# # # #
-# # # #
-#   #E#
-#######

game/data/maze3d/Level_09.txt

@@ -1,9 +0,0 @@
-#########
-#S    # #
-##### # #
-#   # # #
-# # # # #
-# # # # #
-# ### # #
-#      E#
-#########

game/data/maze3d/Level_10.txt

@@ -1,9 +0,0 @@
-#########
-#      S#
-# #######
-# #     #
-# ### ###
-#   #   #
-### ### #
-#E      #
-#########

game/data/maze3d/Level_11.txt

@@ -1,9 +0,0 @@
-#########
-#      E#
-# ##### #
-# #   # #
-# ### # #
-#     # #
-####### #
-#S      #
-#########

game/data/maze3d/Level_12.txt

@@ -1,9 +0,0 @@
-#########
-#      E#
-# # #####
-# # #   #
-# ### # #
-#     # #
-####### #
-#S      #
-#########

game/data/maze3d/Level_13.txt

@@ -1,11 +0,0 @@
-###########
-#S#       #
-# # ### # #
-# #   # # #
-# ##### # #
-#     # # #
-##### # ###
-#   # #   #
-# ### ### #
-#        E#
-###########

game/data/maze3d/Level_14.txt

@@ -1,11 +0,0 @@
-###########
-#S        #
-######### #
-#         #
-# #########
-# #       #
-# ####### #
-#         #
-######### #
-#        E#
-###########

game/data/maze3d/Level_15.txt

@@ -1,11 +0,0 @@
-###########
-#S  # #   #
-### # # # #
-#   # # # #
-# ### # # #
-#   #   # #
-### ##### #
-# #     # #
-# ##### # #
-#        E#
-###########

game/data/maze3d/Level_16.txt

@@ -1,11 +0,0 @@
-###########
-#S#       #
-# # # ### #
-# # # #   #
-# # # # ###
-# # # # # #
-# ### # # #
-#     #   #
-######### #
-#        E#
-###########

game/data/maze3d/Level_17.txt

@@ -1,11 +0,0 @@
-###########
-#S#     # #
-# # ### # #
-# # #   # #
-# # # ### #
-# # # #   #
-# # # ### #
-#   #     #
-######### #
-#        E#
-###########

game/data/maze3d/Level_18.txt

@@ -1,13 +0,0 @@
-#############
-#S#         #
-# # ####### #
-# #     #   #
-# # ### #####
-# #   #     #
-# ### ##### #
-# # #   #   #
-# # ### # ###
-# #     #   #
-# ######### #
-#          E#
-#############

game/data/maze3d/Level_19.txt

@@ -1,13 +0,0 @@
-#############
-#S        # #
-######### # #
-# #     #   #
-# # # ##### #
-# # #     # #
-# # ##### # #
-# # #   # # #
-# # # # # # #
-#   # # # # #
-# ##### # # #
-#       #  E#
-#############

game/data/maze3d/Level_20.txt

@@ -1,13 +0,0 @@
-#############
-#S# #       #
-# # # ### ###
-# #     #   #
-# ######### #
-# #       # #
-# # ##### # #
-#   #   # # #
-##### # # # #
-#     # # # #
-# # ##### # #
-# #        E#
-#############

game/data/maze3d/generate.py

@@ -1,202 +0,0 @@
-import os
-import random
-import collections
-import matplotlib.pyplot as plt
-import numpy as np
-OUTPUT_DIR = 'D:\\work\\agent\\3Dplanning\\spatial_planning_game\\data\\maze3d'
-WALL = '#'
-EMPTY = ' '
-START = 'S'
-EXIT = 'E'
-if not os.path.exists(OUTPUT_DIR):
-    os.makedirs(OUTPUT_DIR)
-
-def _generate_single_attempt(width, height, straightness, dead_end_removal, difficulty):
-    grid = [[WALL for _ in range(width)] for _ in range(height)]
-    sx, sy = (1, 1)
-    ex, ey = (width - 2, height - 2)
-    obstacle_coords = set()
-    if width >= 15:
-        raw_len = int(min(width, height) * (0.05 + difficulty * 0.15))
-        safe_limit = min(width, height) // 4
-        protrude_len = max(2, min(raw_len, safe_limit))
-        start_top_x = 5
-        start_left_y = 5
-        end_bottom_x = width - 6
-        end_right_y = height - 6
-        if start_top_x < width - 2:
-            for i in range(protrude_len):
-                obstacle_coords.add((start_top_x, 1 + i))
-        if start_left_y < height - 2:
-            for i in range(protrude_len):
-                obstacle_coords.add((1 + i, start_left_y))
-        if end_bottom_x > 2:
-            for i in range(protrude_len):
-                obstacle_coords.add((end_bottom_x, height - 2 - i))
-        if end_right_y > 2:
-            for i in range(protrude_len):
-                obstacle_coords.add((width - 2 - i, end_right_y))
-    if width > 13:
-        area = width * height
-        density_base = 0.005 if width < 21 else 0.01
-        num_random = int(area * density_base * (1 + difficulty * 2))
-        num_random = min(num_random, area // 15)
-        for _ in range(num_random):
-            cx = random.randrange(3, width - 3, 2)
-            cy = random.randrange(3, height - 3, 2)
-            if abs(cx - sx) + abs(cy - sy) > 4 and abs(cx - ex) + abs(cy - ey) > 4:
-                obstacle_coords.add((cx, cy))
-    grid[sy][sx] = START
-    visited = set([(sx, sy)]) | obstacle_coords
-    stack = [(sx, sy, 0, 0)]
-    directions = [(0, -2), (0, 2), (-2, 0), (2, 0)]
-    while stack:
-        cx, cy, last_dx, last_dy = stack[-1]
-        neighbors = []
-        for dx, dy in directions:
-            nx, ny = (cx + dx, cy + dy)
-            if 1 <= nx < width - 1 and 1 <= ny < height - 1:
-                if (nx, ny) not in visited:
-                    neighbors.append((nx, ny, dx, dy))
-        if neighbors:
-            same_dir_n = next((n for n in neighbors if n[2] == last_dx and n[3] == last_dy), None)
-            if same_dir_n and random.random() < straightness:
-                chosen = same_dir_n
-            else:
-                chosen = random.choice(neighbors)
-            nx, ny, dx, dy = chosen
-            grid[cy + dy // 2][cx + dx // 2] = EMPTY
-            grid[ny][nx] = EMPTY
-            visited.add((nx, ny))
-            stack.append((nx, ny, dx, dy))
-        else:
-            stack.pop()
-    grid[ey][ex] = EXIT
-    if dead_end_removal > 0:
-        dead_ends = []
-        for y in range(1, height - 1):
-            for x in range(1, width - 1):
-                if grid[y][x] == EMPTY:
-                    w_count = sum((1 for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)] if grid[y + dy][x + dx] == WALL))
-                    if w_count == 3:
-                        dead_ends.append((x, y))
-        random.shuffle(dead_ends)
-        remove_count = int(len(dead_ends) * dead_end_removal)
-        for i in range(remove_count):
-            dx, dy = dead_ends[i]
-            valid_n = []
-            for nx, ny in [(0, 1), (0, -1), (1, 0), (-1, 0)]:
-                tx, ty = (dx + nx, dy + ny)
-                if 1 <= tx < width - 1 and 1 <= ty < height - 1:
-                    if grid[ty][tx] == WALL and (tx, ty) not in obstacle_coords:
-                        valid_n.append((nx, ny))
-            if valid_n:
-                wx, wy = random.choice(valid_n)
-                grid[dy + wy][dx + wx] = EMPTY
-    return (grid, (sx, sy), (ex, ey), obstacle_coords)
-
-def solve_bfs(grid, width, height, start, end):
-    """Helpers."""
-    queue = collections.deque([[start]])
-    visited = set([start])
-    while queue:
-        path = queue.popleft()
-        cx, cy = path[-1]
-        if (cx, cy) == end:
-            return path
-        for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:
-            nx, ny = (cx + dx, cy + dy)
-            if 0 <= nx < width and 0 <= ny < height and (grid[ny][nx] != WALL) and ((nx, ny) not in visited):
-                visited.add((nx, ny))
-                new_path = list(path)
-                new_path.append((nx, ny))
-                queue.append(new_path)
-    return []
-
-def generate_maze_robust(width, height, straightness, removal, difficulty):
-    """Helpers."""
-    attempt = 0
-    while True:
-        attempt += 1
-        grid, start, end, obstacles = _generate_single_attempt(width, height, straightness, removal, difficulty)
-        if solve_bfs(grid, width, height, start, end):
-            return (grid, start, end, obstacles)
-        if attempt > 30:
-            return _generate_single_attempt(width, height, straightness, removal, 0.0)
-
-def hash_grid(grid, start, end):
-    """Helpers."""
-    grid_str = ''.join([''.join(row) for row in grid])
-    return f'{grid_str}|{start}|{end}'
-
-def save_unique_level(index, width, height, straightness, removal, difficulty, seen_hashes):
-    MAX_RETRIES = 50
-    for attempt in range(MAX_RETRIES):
-        grid, start, end, obstacles = generate_maze_robust(width, height, straightness, removal, difficulty)
-        if width == height and width < 10:
-            ops = random.choice(['none', 'flip_h', 'flip_v', 'transpose'])
-            if ops != 'none':
-                grid_np = np.array([list(r) for r in grid])
-                if ops == 'flip_h':
-                    grid_np = np.fliplr(grid_np)
-                    start = (width - 1 - start[0], start[1])
-                    end = (width - 1 - end[0], end[1])
-                elif ops == 'flip_v':
-                    grid_np = np.flipud(grid_np)
-                    start = (start[0], height - 1 - start[1])
-                    end = (end[0], height - 1 - end[1])
-                elif ops == 'transpose':
-                    grid_np = grid_np.T
-                    start = (start[1], start[0])
-                    end = (end[1], end[0])
-                grid = grid_np.tolist()
-        current_hash = hash_grid(grid, start, end)
-        if current_hash not in seen_hashes:
-            seen_hashes.add(current_hash)
-            filename_base = f'Level_{index + 1:02d}'
-            with open(os.path.join(OUTPUT_DIR, f'{filename_base}.txt'), 'w', encoding='utf-8') as f:
-                for line in grid:
-                    f.write(''.join(line) + '\n')
-            path = solve_bfs(grid, width, height, start, end)
-            matrix = np.zeros((height, width))
-            for y in range(height):
-                for x in range(width):
-                    if (x, y) in obstacles and width >= 13:
-                        matrix[y][x] = 0.3
-                    elif grid[y][x] == WALL:
-                        matrix[y][x] = 0.0
-                    else:
-                        matrix[y][x] = 1.0
-            plt.figure(figsize=(8, 8))
-            plt.imshow(matrix, cmap='gray', interpolation='nearest')
-            if path:
-                px, py = zip(*path)
-                plt.plot(px, py, color='red', linewidth=2, alpha=0.6)
-                plt.scatter(start[0], start[1], c='lime', s=100, label='Start')
-                plt.scatter(end[0], end[1], c='orange', s=100, label='Exit')
-            plt.title(f'Level {index + 1}: {width}x{height} | Obstacles: {len(obstacles)}')
-            plt.axis('off')
-            plt.savefig(os.path.join(OUTPUT_DIR, f'{filename_base}.png'), bbox_inches='tight')
-            plt.close()
-            return True
-    print(f'  [警告] Level {index + 1} ({width}x{height}): 尝试 {MAX_RETRIES} 次仍无法生成完全唯一的地图，保留最后一次结果。')
-    return True
-
-def main():
-    print(f'🚀 开始生成动态难度迷宫 (防重复增强版)...')
-    TOTAL_LEVELS = 20
-    MIN_SIZE, MAX_SIZE = (5, 13)
-    seen_hashes = set()
-    for i in range(TOTAL_LEVELS):
-        t = i / (TOTAL_LEVELS - 1)
-        size = int(MIN_SIZE + t * (MAX_SIZE - MIN_SIZE))
-        if size % 2 == 0:
-            size += 1
-        difficulty = t
-        straightness = 0.85 - t * 0.5
-        removal = 0.5 - t * 0.4
-        save_unique_level(i, size, size, straightness, removal, difficulty, seen_hashes)
-        print(f'  [进度 {i + 1}/{TOTAL_LEVELS}] 已生成 {size}x{size} 关卡')
-    print(f'\n✅ 全部完成！文件已保存至: {OUTPUT_DIR}')
-if __name__ == '__main__':
-    main()