133 lines
3.7 KiB
Python
133 lines
3.7 KiB
Python
# -*- coding: UTF-8 -*-
|
|
|
|
### Tangled Mind
|
|
### Author: Arthur 'Grizzly' Grisel-Davy
|
|
|
|
from glob import glob
|
|
import random
|
|
import pygame
|
|
|
|
def fetch_rooms(path):
|
|
"""Fetch all the basic tiles asset from the path.
|
|
Return a dictionary
|
|
"""
|
|
|
|
common_wildcard = '[A-Z]*-*.png'
|
|
unique_wildcard = '?-*.png'
|
|
common_filenames = glob(path+common_wildcard)
|
|
unique_filenames = glob(path+unique_wildcard)
|
|
#print(f"Found {len(common_filenames)} common rooms and {len(unique_filenames)} uniques rooms.")
|
|
|
|
assembly = {'T':[],
|
|
'R':[],
|
|
'D':[],
|
|
'L':[],}
|
|
|
|
for filename in common_filenames:
|
|
label = filename.split("/")[-1].split('-')[0]
|
|
if 'T' in label:
|
|
assembly['D'].append((label,filename))
|
|
if 'R' in label:
|
|
assembly['L'].append((label,filename))
|
|
if 'D' in label:
|
|
assembly['T'].append((label,filename))
|
|
if 'L' in label:
|
|
assembly['R'].append((label,filename))
|
|
|
|
background = glob(path+'*back*')[0]
|
|
|
|
return unique_filenames,assembly,background
|
|
|
|
def check_map(carte):
|
|
"""Function to check if a map is valid i.e. if no two rooms are at the same location
|
|
"""
|
|
positions = []
|
|
for room in carte:
|
|
if room[2] in positions:
|
|
return(False)
|
|
else:
|
|
positions.append(room[2])
|
|
return(True)
|
|
|
|
def map_generator(n):
|
|
"""Map generator generate a map with a main path of n rooms
|
|
"""
|
|
|
|
room_side = 1000
|
|
|
|
unique_filenames,assembly,back_path = fetch_rooms('./maps/rooms/')
|
|
#assembly = {'T/R/D/L':[(label1,path1),(label2,path2),...]}
|
|
|
|
|
|
unique_rooms = {filename.split("/")[-1][0].upper():pygame.image.load(filename).convert_alpha() for filename in unique_filenames}
|
|
|
|
current_label= random.choice(list(unique_rooms.keys()))
|
|
start_room = unique_rooms[current_label]
|
|
|
|
# Place the first room in the list
|
|
positions = []
|
|
position = [0,0]
|
|
mask = pygame.mask.from_surface(start_room)
|
|
carte = [(start_room,mask,position)]
|
|
|
|
|
|
counter = 0
|
|
while counter < n:
|
|
|
|
# select the next direction, can't be the direction of arrival
|
|
if len(current_label) > 1:
|
|
dir_next = random.choice(current_label.replace(dir_from,''))
|
|
else:
|
|
dir_next = current_label
|
|
|
|
|
|
# Select the next room
|
|
next_label,next_room = random.choice(assembly[dir_next])
|
|
asset = pygame.image.load(next_room).convert_alpha()
|
|
mask = pygame.mask.from_surface(asset)
|
|
|
|
# Compute the position of the next tile
|
|
if dir_next == 'T':
|
|
next_position = [position[0],position[1]-room_side]
|
|
dir_from = 'D'
|
|
|
|
if dir_next == 'R':
|
|
next_position = [position[0]+room_side,position[1]]
|
|
dir_from = 'L'
|
|
|
|
if dir_next == 'D':
|
|
next_position = [position[0],position[1]+room_side]
|
|
dir_from = 'T'
|
|
|
|
if dir_next == 'L':
|
|
next_position = [position[0]-room_side,position[1]]
|
|
dir_from = 'R'
|
|
|
|
# Check if we are not overwriting an existing room and store the current one.
|
|
if next_position not in positions:
|
|
counter += 1
|
|
# Build the map
|
|
carte.append((asset,mask,next_position))
|
|
positions.append(position)
|
|
|
|
# Update the variables for next turn
|
|
current_label = next_label
|
|
position = next_position
|
|
positions.append(position)
|
|
|
|
background = pygame.image.load(back_path).convert()
|
|
|
|
if not check_map(carte):
|
|
raise ValueError("Invalid Map.")
|
|
else:
|
|
print("Map checked and valid!")
|
|
|
|
for room in carte:
|
|
print(room)
|
|
|
|
return(carte,(int(room_side/2),int(room_side/2)),background)
|
|
|
|
|
|
|
|
|
|
|