-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathscript.js
More file actions
144 lines (126 loc) · 3.7 KB
/
script.js
File metadata and controls
144 lines (126 loc) · 3.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
const canvas = document.getElementById("waveCanvas");
const ctx = canvas.getContext("2d");
canvas.width = 1000;
canvas.height = 800;
const canvasWidth = canvas.width;
const canvasHeight = canvas.height;
const tilesUsed = sockets;
const veritcalCells = Math.floor(canvas.height / size);
const horizontalCells = Math.floor(canvas.width / size);
let grid = [];
function collapseAndPropagate(grid, tileToFile) {
const neighbors = neumannNeighborhood(grid, tileToFile);
const option =
tileToFile.options[Math.floor(Math.random() * tileToFile.options.length)];
grid[tileToFile.y][tileToFile.x].options = [];
grid[tileToFile.y][tileToFile.x].tile = option.name;
grid[tileToFile.y][tileToFile.x].collapsed = true;
for (let j = 0; j < neighbors.length; j++) {
const cell = neighbors[j].cell;
const direction = neighbors[j].direction;
const valid = option.connections[direction];
if (!grid[cell.y][cell.x].collapsed) {
const validOptions = grid[cell.y][cell.x].options.filter((entry) => {
return valid.includes(entry.name);
});
grid[cell.y][cell.x].options = validOptions;
}
}
return {
x: tileToFile.x,
y: tileToFile.y,
tile: option.tile,
};
}
function pickTileWithLowestenthropy(grid) {
let minOptions = null;
// First, find an initial non-collapsed cell to start with
for (let j = 0; j < veritcalCells; j++) {
for (let i = 0; i < horizontalCells; i++) {
if (!grid[j][i].collapsed) {
minOptions = grid[j][i];
break;
}
}
if (minOptions !== null) {
break;
}
}
// If all cells are collapsed, return null
if (minOptions === null) {
return null;
}
// Find a non-collapsed cell with the minimum number of options
for (let j = 0; j < veritcalCells; j++) {
for (let i = 0; i < horizontalCells; i++) {
if (
!grid[j][i].collapsed &&
grid[j][i].options.length < minOptions.options.length
) {
minOptions = grid[j][i];
}
}
}
// Collect all non-collapsed cells with the same number of minimum options
const sameSize = [];
for (let j = 0; j < veritcalCells; j++) {
for (let i = 0; i < horizontalCells; i++) {
if (
!grid[j][i].collapsed &&
grid[j][i].options.length === minOptions.options.length
) {
sameSize.push(grid[j][i]);
}
}
}
// Return a random cell among those with the same minimum number of options
return sameSize[Math.floor(Math.random() * sameSize.length)];
}
function drawGrid() {
ctx.clearRect(0, 0, canvas.width, canvas.height);
for (let j = 0; j < veritcalCells; j++) {
for (let i = 0; i < horizontalCells; i++) {
ctx.beginPath();
ctx.rect(i * size, j * size, size, size);
ctx.fill();
}
}
}
function recreateGrid() {
grid = [];
for (let j = 0; j < veritcalCells; j++) {
const gridRow = [];
for (let i = 0; i < horizontalCells; i++) {
const cell = {
x: i,
y: j,
collapsed: false,
options: tilesUsed,
tile: "empty",
};
gridRow.push(cell);
}
grid.push(gridRow);
}
}
function drawEmptyGrid() {}
// drawing
function animate() {
let option = pickTileWithLowestenthropy(grid);
if (option === null) {
return;
} else if (!option.collapsed && option.options.length === 0) {
recreateGrid();
ctx.clearRect(0, 0, canvas.width, canvas.height);
option = pickTileWithLowestenthropy(grid);
const tile = collapseAndPropagate(grid, option);
tile.tile.draw(ctx, tile.x, tile.y);
requestAnimationFrame(animate);
} else {
const tile = collapseAndPropagate(grid, option);
tile.tile.draw(ctx, tile.x, tile.y);
requestAnimationFrame(animate);
}
}
recreateGrid();
animate();