程序化内容生成：PCG程序化关卡生成

import randomfrom collections import deque class LevelGenerator:    def __init__(self, seed=42, width=50, height=30):        self.seed = seed        self.rng = random.Random(seed)        self.width = width        self.height = height        self.rooms = []        self.corridors = []        self.grid = [['#' for _ in range(width)] for _ in range(height)]     def _make_room(self):        w = self.rng.randint(3, 7)        h = self.rng.randint(3, 6)        x = self.rng.randint(1, self.width - w - 1)        y = self.rng.randint(1, self.height - h - 1)        return (x, y, w, h)     def _overlaps(self, room, margin=1):        for (x2, y2, w2, h2) in self.rooms:            if (room[0] < x2 + w2 + margin and room[0] + room[2] + margin > x2 and                room[1] < y2 + h2 + margin and room[1] + room[3] + margin > y2):                return True        return False     def _carve(self, room):        x, y, w, h = room        for i in range(x, x + w):            for j in range(y, y + h):                self.grid[j][i] = '.'     def generate_rooms(self):        while len(self.rooms) < 6:            room = self._make_room()            if not self._overlaps(room):                self.rooms.append(room)                self._carve(room)            if len(self.rooms) >= 8:                break     def generate_corridors(self):        for i in range(1, len(self.rooms)):            x1, y1, _, _ = self.rooms[i - 1]            x2, y2, _, _ = self.rooms[i]            x1 += 1; y1 += 1            x2 += 1; y2 += 1            mx = (x1 + x2) // 2            self._h_line(x1, mx, y1)            self._v_line(y1, y2, mx)            self._h_line(mx, x2, y2)            self.corridors.append((x1, y1, x2, y2))     def _h_line(self, x1, x2, y):        for x in range(min(x1, x2), max(x1, x2) + 1):            self.grid[y][x] = '.'     def _v_line(self, y1, y2, x):        for y in range(min(y1, y2), max(y1, y2) + 1):            self.grid[y][x] = '.'     def check_connectivity(self, start=0, end=-1):        if not self.rooms:            return False        start_room = self.rooms[start]        end_room = self.rooms[end]        start = (start_room[0] + 1, start_room[1] + 1)        end = (end_room[0] + 1, end_room[1] + 1)        q = deque([start])        seen = {start}        while q:            x, y = q.popleft()            if (x, y) == end:                return True            for dx, dy in ((1, 0), (-1, 0), (0, 1), (0, -1)):                nx, ny = x + dx, y + dy                if 0 <= nx < self.width and 0 <= ny < self.height and self.grid[ny][nx] == '.' and (nx, ny) not in seen:                    seen.add((nx, ny))                    q.append((nx, ny))        return False     def generate(self):        self.generate_rooms()        self.generate_corridors()        return {            'rooms': self.rooms,            'corridors': self.corridors,            'playable': self.check_connectivity(),            'grid': self.grid,        }  if __name__ == '__main__':    level = LevelGenerator(seed=2024)    data = level.generate()    print('rooms:', len(data['rooms']))    print('playable:', data['playable'])    for row in data['grid']:        print(''.join(row))