el_diablo/src/level_generator.rs

316 lines
12 KiB
Rust
Raw Normal View History

2023-12-04 18:41:21 +01:00
use petgraph::algo::min_spanning_tree;
use petgraph::data::*;
use petgraph::graph::Graph;
use petgraph::graph::UnGraph;
2024-10-20 14:59:20 +02:00
use rand::Rng;
use rand::{rngs::ThreadRng, seq::SliceRandom};
2023-12-04 18:41:21 +01:00
2024-10-30 08:56:45 +01:00
use crate::artifacts::Artifact;
use crate::artifacts::Chest;
use crate::artifacts::Potion;
use crate::constants::get_monsters_per_level;
use crate::constants::ROOM_HEIGHT;
use crate::constants::ROOM_WIDTH;
2024-10-30 08:56:45 +01:00
use crate::monster::create_monster_by_type;
use crate::monster::Monster;
use crate::position::Position;
use crate::room::Connection;
use crate::{
constants::{
get_room_type_per_level, LEVEL_HEIGHT, LEVEL_WIDTH, ROOMS_HORIZONAL, ROOMS_VERTICAL,
},
level::{Level, StructureElement},
room::{Room, RoomType},
};
2023-12-04 18:41:21 +01:00
pub struct LevelGenerator {
2023-12-07 10:12:44 +01:00
level: usize,
rooms: [[Room; ROOMS_VERTICAL]; ROOMS_HORIZONAL],
2024-10-30 08:56:45 +01:00
rng: ThreadRng,
}
enum Direction {
Horizontal,
Vertical,
2023-12-04 18:41:21 +01:00
}
impl LevelGenerator {
2023-12-09 22:43:06 +01:00
pub fn generate(level: usize, first: bool, last: bool) -> Self {
2023-12-04 18:41:21 +01:00
let mut rng = rand::thread_rng();
let mut rooms = [[Room::new(&mut rng); ROOMS_VERTICAL]; ROOMS_HORIZONAL];
2023-12-04 18:41:21 +01:00
/*
Fill grid with unconnected rooms
*/
2023-12-04 18:41:21 +01:00
let mut rooms_to_place: Vec<Room> = Vec::with_capacity(ROOMS_VERTICAL * ROOMS_HORIZONAL);
2023-12-04 18:41:21 +01:00
let mut start_room = Room::new(&mut rng);
if first {
start_room.kind = RoomType::Start;
} else {
start_room.kind = RoomType::StairUp;
}
rooms_to_place.push(start_room);
let mut end_room = Room::new(&mut rng);
if last {
end_room.kind = RoomType::End;
} else {
end_room.kind = RoomType::StairDown;
}
rooms_to_place.push(end_room);
for _ in 2..ROOMS_HORIZONAL * ROOMS_VERTICAL {
let mut room = Room::new(&mut rng);
room.kind = LevelGenerator::select_room_type(level, &mut rng);
if room.kind != RoomType::EmptyRoom {
rooms_to_place.push(room);
2023-12-04 18:41:21 +01:00
}
}
let mut room_row = rng.gen_range(1..ROOMS_VERTICAL);
let mut room_col = rng.gen_range(1..ROOMS_HORIZONAL);
rooms[room_col][room_row] = rooms_to_place.pop().unwrap();
while let Some(room) = rooms_to_place.pop() {
let mut directions_to_try = vec![Direction::Horizontal, Direction::Vertical];
directions_to_try.shuffle(&mut rng);
while !directions_to_try.is_empty() {
match directions_to_try.pop().unwrap() {
Direction::Horizontal => {
let mut free_cols: Vec<usize> = vec![];
for col in 0..ROOMS_HORIZONAL {
if rooms[col][room_row].kind == RoomType::EmptyRoom {
free_cols.push(col);
}
}
if free_cols.is_empty() {
continue;
}
free_cols.shuffle(&mut rng);
room_col = *free_cols.first().unwrap();
rooms[room_col][room_row] = room;
2023-12-04 18:41:21 +01:00
break;
}
Direction::Vertical => {
let mut free_rows: Vec<usize> = vec![];
for row in 0..ROOMS_VERTICAL {
if rooms[room_col][row].kind == RoomType::EmptyRoom {
free_rows.push(row);
}
}
if free_rows.is_empty() {
continue;
}
free_rows.shuffle(&mut rng);
room_row = *free_rows.first().unwrap();
rooms[room_col][room_row] = room;
2023-12-04 18:41:21 +01:00
break;
}
}
}
}
2024-10-30 08:56:45 +01:00
// debug print a text view of the dungeon
println!(" 0 1 2 3 4 5 6 7");
for r in 0..ROOMS_VERTICAL {
print!("{} ", r);
for c in 0..ROOMS_HORIZONAL {
match rooms[c][r].kind {
RoomType::Start => print!("S "),
RoomType::End => print!("E "),
RoomType::StairUp => print!("< "),
RoomType::StairDown => print!("> "),
RoomType::BasicRoom => print!("B "),
RoomType::ArtifactRoom => print!("A "),
RoomType::MonsterRoom => print!("M "),
RoomType::EmptyRoom => print!(" "),
2024-10-20 14:59:20 +02:00
};
2023-12-04 18:41:21 +01:00
}
println!();
}
/*
Construct a graph from the unconnected rooms and make a minum spanning tree of it
*/
let mut graph = UnGraph::<(usize, usize), u16>::default();
// collect nodes
for col in 0..ROOMS_HORIZONAL {
for row in 0..ROOMS_VERTICAL {
if rooms[col][row].kind != RoomType::EmptyRoom {
graph.add_node((col, row));
2023-12-04 18:41:21 +01:00
}
}
}
// collect edges between nodes, each right and down till we find the next room
for col in 0..ROOMS_HORIZONAL {
for row in 0..ROOMS_VERTICAL {
if rooms[col][row].kind == RoomType::EmptyRoom {
continue;
}
if let Some(src_index) = graph.node_indices().find(|i| graph[*i] == (col, row)) {
for col_1 in col + 1..ROOMS_HORIZONAL {
if rooms[col_1][row].kind != RoomType::EmptyRoom {
if let Some(tgt_index) =
graph.node_indices().find(|i| graph[*i] == (col_1, row))
{
graph.add_edge(src_index, tgt_index, 1);
break;
}
2023-12-04 18:41:21 +01:00
}
}
for row_1 in row + 1..ROOMS_VERTICAL {
if rooms[col][row_1].kind != RoomType::EmptyRoom {
if let Some(tgt_index) =
graph.node_indices().find(|i| graph[*i] == (col, row_1))
{
graph.add_edge(src_index, tgt_index, 1);
break;
}
2023-12-04 18:41:21 +01:00
}
}
}
}
}
let mst: Graph<(usize, usize), u16, petgraph::Undirected> =
Graph::from_elements(min_spanning_tree(&graph));
for edge in mst.raw_edges() {
// the tuples are (col, row)
let (src_node_col, src_node_row) = mst[edge.source()];
let (tgt_node_col, tgt_node_row) = mst[edge.target()];
// println!("MST Edge from {:?} to {:?}", (src_node_col, src_node_row), (tgt_node_col, tgt_node_row));
if src_node_col == tgt_node_col {
// println!("Down");
2024-10-30 08:56:45 +01:00
let start_col = src_node_col * ROOM_WIDTH + ROOM_WIDTH / 2;
let start_row = src_node_row * ROOM_HEIGHT + ROOM_HEIGHT;
let end_col = tgt_node_col * ROOM_WIDTH + ROOM_WIDTH / 2;
let end_row = tgt_node_row * ROOM_HEIGHT;
rooms[src_node_col][src_node_row].connection_down = Some(Connection {
start_pos: (start_col, start_row),
end_pos: (end_col, end_row),
});
} else {
// println!("Right");
2024-10-30 08:56:45 +01:00
let start_col = src_node_col * ROOM_WIDTH + ROOM_WIDTH;
let start_row = src_node_row * ROOM_HEIGHT + ROOM_HEIGHT / 2;
let end_col = tgt_node_col * ROOM_WIDTH;
2024-10-30 08:56:45 +01:00
let end_row = tgt_node_row * ROOM_HEIGHT + ROOM_HEIGHT / 2;
rooms[src_node_col][src_node_row].connection_right = Some(Connection {
start_pos: (start_col, start_row),
end_pos: (end_col, end_row),
});
}
}
2024-10-30 08:56:45 +01:00
LevelGenerator {
level,
rooms,
rng,
}
}
fn select_monster(position: Position, rng: &mut ThreadRng) -> Box<dyn Monster> {
let level = position.get_level();
let value = rng.gen_range(1..=100);
let t = get_monsters_per_level();
if level < t.len() {
for (mtype, range) in &t[level] {
if range.contains(&value) {
return create_monster_by_type(mtype, position);
}
}
}
panic!("no monster selectable!");
2023-12-04 18:41:21 +01:00
}
2024-10-24 08:57:52 +02:00
fn select_room_type(level: usize, rng: &mut ThreadRng) -> RoomType {
2024-10-24 08:57:52 +02:00
let value = rng.gen_range(1..=100);
let t = get_room_type_per_level();
2024-10-24 08:57:52 +02:00
if level < t.len() {
for (mtype, range) in &t[level] {
if range.contains(&value) {
return *mtype;
2024-10-24 08:57:52 +02:00
}
}
}
panic!("no room selectable!");
2024-10-24 08:57:52 +02:00
}
pub fn render(&mut self) -> Level {
let mut structure = [[StructureElement::Wall; LEVEL_HEIGHT]; LEVEL_WIDTH];
let mut start_pos = (0, 0);
let mut end_pos = (0, 0);
2024-10-30 08:56:45 +01:00
let mut monsters: Vec<Box<dyn Monster>> = Vec::with_capacity(10);
let mut artifacts: Vec<Box<dyn Artifact>> = Vec::with_capacity(10);
for col in 0..ROOMS_HORIZONAL {
for row in 0..ROOMS_VERTICAL {
2024-10-30 08:56:45 +01:00
let room = self.rooms[col][row];
let position = room.render(&mut structure, col, row);
match room.kind {
RoomType::Start => {start_pos=position},
RoomType::End => {end_pos=position},
RoomType::StairUp => {start_pos=position},
RoomType::StairDown => {end_pos=position},
RoomType::BasicRoom => {},
RoomType::ArtifactRoom => {
match self.rng.gen_range(1..=100) {
1..=50 => {
artifacts
.push(Box::new(Chest::new(Position::new(self.level, position.0, position.1))));
}
_ => {
artifacts
.push(Box::new(Potion::new(Position::new(self.level, position.0, position.1))));
}
};
},
RoomType::MonsterRoom => {
monsters.push(LevelGenerator::select_monster(
Position::new(self.level, position.0, position.1),
&mut self.rng,
));
},
RoomType::EmptyRoom => {},
2023-12-04 18:41:21 +01:00
}
}
}
for col in 0..ROOMS_HORIZONAL {
for row in 0..ROOMS_VERTICAL {
if let Some(connection) = self.rooms[col][row].connection_down {
// println!("down");
connection.render(&mut structure);
2023-12-04 18:41:21 +01:00
}
if let Some(connection) = self.rooms[col][row].connection_right {
// println!("right");
connection.render(&mut structure);
2023-12-04 18:41:21 +01:00
}
}
}
Level {
2023-12-07 10:12:44 +01:00
level: self.level,
2023-12-04 18:41:21 +01:00
structure,
discovered: [[false; LEVEL_HEIGHT]; LEVEL_WIDTH],
2024-10-30 08:56:45 +01:00
monsters,
artifacts,
start: start_pos,
end: end_pos,
2023-12-26 19:11:41 +01:00
rng: rand::thread_rng(),
2023-12-04 18:41:21 +01:00
}
}
}
2023-12-07 10:12:44 +01:00
#[test]
fn test_level_gen() {
for _ in 0..1000 {
LevelGenerator::generate(0, true, false).render();
}
}
#[test]
fn test_level_gen_respects_level() {
let level = LevelGenerator::generate(0, true, false).render();
assert_eq!(0, level.level);
let level = LevelGenerator::generate(1, true, false).render();
assert_eq!(1, level.level);
2023-12-09 22:43:06 +01:00
}