domino-dungeon/game.c

231 lines
7.6 KiB
C
Raw Normal View History

2025-10-13 21:18:09 +02:00
#include <GLFW/glfw3.h>
2025-10-14 14:48:54 +02:00
#include <stddef.h>
2025-10-14 06:17:32 +02:00
#include <stdint.h>
#include <stdio.h>
2025-10-15 10:40:39 +02:00
#include <stdbool.h>
2025-10-15 15:50:18 +02:00
#include <stdlib.h>
2025-10-13 21:18:09 +02:00
#include "game.h"
2025-10-14 14:48:54 +02:00
#include "domino.h"
2025-10-18 17:32:37 +02:00
#include "draw.h"
2025-10-14 21:39:22 +02:00
#include "assets/white_and_blue_dominoes.h"
#include "assets/red_and_peach_dominoes.h"
2025-10-13 21:18:09 +02:00
2025-10-14 04:11:36 +02:00
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))
#define CLAMP(x,a,b) (MIN(MAX(x,a),b))
2025-10-13 21:18:09 +02:00
2025-10-18 17:32:37 +02:00
const uint32_t glyph_heart = 0b00010101111111111011100010000000;
const uint32_t glyph_flag = 0b00011000111001100010000100011100;
const uint32_t glyph_monster = 0b00111011111101011111111111101010;
2025-10-15 14:08:17 +02:00
int mouse_x = 0, mouse_y = 0;
2025-10-14 04:11:36 +02:00
2025-10-14 14:48:54 +02:00
struct bricks bricks = {0};
2025-10-14 16:32:45 +02:00
struct brick hand[5];
size_t hand_count = 0;
2025-10-14 17:47:34 +02:00
struct brick active = {0};
2025-10-15 10:40:39 +02:00
bool has_active = 0;
2025-10-14 17:47:34 +02:00
2025-10-18 17:32:37 +02:00
struct bricks preview = {0};
2025-10-15 07:18:13 +02:00
2025-10-15 14:08:17 +02:00
int camera_x = 0;
int camera_y = 0;
bool is_dragging = 0;
2025-10-15 15:50:18 +02:00
int goal_x = 5;
int goal_y = 5;
bool is_goal_reached = 0;
2025-10-15 17:01:30 +02:00
struct enemy {
int x, y, attack, health;
};
struct enemy enemies[20] = {0};
size_t enemy_count = 0;
2025-10-15 10:40:39 +02:00
2025-10-14 04:11:36 +02:00
void key_callback(int key, int scancode, int action, int mods) {
2025-10-15 10:40:39 +02:00
(void) scancode;
(void) mods;
2025-10-13 21:18:09 +02:00
if (action != GLFW_PRESS) return;
switch (key) {
2025-10-15 10:40:39 +02:00
case GLFW_KEY_R:
if (active.front.vertical) {
struct eye tmp = active.front;
active.front.val = active.back.val;
active.back.val = tmp.val;
}
active.front.vertical = !active.front.vertical;
2025-10-18 17:32:37 +02:00
brick_previews(active, bricks, &preview);
2025-10-15 10:40:39 +02:00
printf("rotate\n");
break;
2025-10-13 21:18:09 +02:00
case GLFW_KEY_ENTER:
break;
case GLFW_KEY_BACKSPACE:
break;
}
}
2025-10-14 04:11:36 +02:00
void cursor_position_callback(int xpos, int ypos) {
2025-10-15 14:08:17 +02:00
if (is_dragging) {
camera_x += xpos - mouse_x;
camera_y += ypos - mouse_y;
}
2025-10-14 04:11:36 +02:00
mouse_x = xpos;
mouse_y = ypos;
}
void mouse_button_callback(int button, int action, int mods) {
2025-10-15 10:40:39 +02:00
(void) mods;
2025-10-18 17:32:37 +02:00
printf("click!\n");
2025-10-15 10:40:39 +02:00
2025-10-15 14:08:17 +02:00
if (button == GLFW_MOUSE_BUTTON_RIGHT) {
is_dragging = (action == GLFW_PRESS);
}
2025-10-14 06:17:32 +02:00
if (button == GLFW_MOUSE_BUTTON_LEFT && action == GLFW_PRESS) {
2025-10-15 07:18:13 +02:00
// pick up brick from hand
2025-10-14 17:47:34 +02:00
for (size_t i = 0; i < hand_count; i++) {
struct brick *b = &hand[i];
2025-10-18 17:32:37 +02:00
if (has_active) {
2025-10-14 17:47:34 +02:00
hand[i - 1] = hand[i];
2025-10-18 17:32:37 +02:00
continue;
}
if (b->front.x <= mouse_x && mouse_x <= b->front.x + DOMINO_WIDTH &&
b->front.y <= mouse_y && mouse_y <= b->front.y + DOMINO_HEIGHT
) {
has_active = 1;
active = *b;
active.front.x -= mouse_x;
active.front.y -= mouse_y;
2025-10-14 17:47:34 +02:00
}
2025-10-14 06:17:32 +02:00
}
2025-10-15 07:18:13 +02:00
if (has_active) {
hand_count--;
2025-10-18 17:32:37 +02:00
brick_previews(active, bricks, &preview);
2025-10-15 07:18:13 +02:00
}
2025-10-14 06:17:32 +02:00
}
2025-10-14 17:47:34 +02:00
if (button == GLFW_MOUSE_BUTTON_LEFT && action == GLFW_RELEASE) {
2025-10-14 21:39:22 +02:00
if (has_active) {
has_active = 0;
2025-10-15 07:18:13 +02:00
2025-10-18 17:32:37 +02:00
// get preview with minimal distance from active brick
2025-10-15 07:18:13 +02:00
size_t min_dist = -1;
2025-10-18 17:32:37 +02:00
for (size_t i = 0; i < preview.count; i++) {
2025-10-15 07:18:13 +02:00
int active_x = active.front.x + mouse_x + DOMINO_WIDTH / 2;
int active_y = active.front.y + mouse_y + DOMINO_HEIGHT / 2;
2025-10-18 17:32:37 +02:00
int preview_x = camera_x + preview.items.brick[i].front.x * EYE_SIZE + DOMINO_WIDTH / 2;
int preview_y = camera_y + preview.items.brick[i].front.y * EYE_SIZE + DOMINO_HEIGHT / 2;
preview.items.brick[i].front.val = (active_x - preview_x) * (active_x - preview_x) + (active_y - preview_y) * (active_y - preview_y);
2025-10-15 14:14:08 +02:00
if (min_dist == (size_t)-1) min_dist = i;
2025-10-18 17:32:37 +02:00
if (preview.items.brick[i].front.val < preview.items.brick[min_dist].front.val) min_dist = i;
2025-10-15 07:18:13 +02:00
}
2025-10-18 17:32:37 +02:00
if (preview.items.brick[min_dist].front.val < EYE_SIZE * EYE_SIZE && preview.count) {
preview.items.brick[min_dist].front.val = active.front.val;
preview.items.brick[min_dist].front.vertical = active.front.vertical;
preview.items.brick[min_dist].back.val = active.back.val;
bricks_append(&bricks, preview.items.brick[min_dist]);
2025-10-15 15:50:18 +02:00
hand[hand_count++] = (struct brick) {
.front = {.val = rand() % 6},
.back = {.val = rand() % 6},
};
2025-10-18 17:32:37 +02:00
if ((preview.items.brick[min_dist].front.x == goal_x &&
preview.items.brick[min_dist].front.y == goal_y) ||
(preview.items.brick[min_dist].back.x == goal_x &&
preview.items.brick[min_dist].back.y == goal_y)) {
2025-10-15 15:50:18 +02:00
is_goal_reached = 1;
}
2025-10-18 17:32:37 +02:00
for (size_t i = 0; i < bricks.count; i++) brick_print(bricks.items.brick[i]);
2025-10-15 07:18:13 +02:00
} else {
hand[hand_count++] = active;
}
2025-10-18 17:32:37 +02:00
printf("dist: %d\n", preview.items.brick[min_dist].front.val);
preview.count = 0;
2025-10-14 21:39:22 +02:00
}
2025-10-14 17:47:34 +02:00
}
2025-10-14 04:11:36 +02:00
}
2025-10-18 17:32:37 +02:00
void draw_enemy(struct image canvas, int attack, int health, size_t xpos, size_t ypos) {
char a[] = {(attack + '0'), 0};
char h[] = {(health + '0'), 0};
draw_glyph(canvas, glyph_monster, camera_x + xpos * EYE_SIZE + 2, camera_y + ypos * EYE_SIZE + 3, (struct color) {255, 0, 0, 255});
draw_text(canvas, a, camera_x + xpos * EYE_SIZE + 8, camera_y + ypos * EYE_SIZE, (struct color) {255, 0, 0, 255});
draw_text(canvas, h, camera_x + xpos * EYE_SIZE + 8, camera_y + ypos * EYE_SIZE + 6, (struct color) {255, 0, 0, 255});
}
2025-10-15 15:11:47 +02:00
void init(struct image canvas) {
camera_x = canvas.width / 2;
camera_y = canvas.height / 2;
2025-10-14 14:48:54 +02:00
bricks_append(
&bricks,
(struct brick) {
2025-10-15 15:50:18 +02:00
.front = {.x = 0, .y = 0, .val = rand() % 6},
.back = {.x = 1, .y = 0, .val = rand() % 6},
2025-10-14 14:48:54 +02:00
}
);
2025-10-14 16:32:45 +02:00
2025-10-15 15:50:18 +02:00
for (size_t i = 0; i < 5; i++) {
hand[hand_count++] = (struct brick) {
.front = {.val = rand() % 6},
2025-10-15 16:07:56 +02:00
.back = {.val = rand() % 6},
2025-10-15 15:50:18 +02:00
};
}
2025-10-14 16:32:45 +02:00
}
void render(struct image canvas) {
2025-10-15 15:11:47 +02:00
for (size_t i = 0; i < canvas.bufsize; i++) canvas.buf[i] = 0;
2025-10-14 14:48:54 +02:00
2025-10-14 16:32:45 +02:00
// domino playground
2025-10-14 14:48:54 +02:00
for (size_t i = 0; i < bricks.count; i++) {
struct brick *b = &bricks.items.brick[i];
2025-10-18 17:32:37 +02:00
draw_image(canvas, red_and_peach_dominoes[b->back.val][b->front.val], camera_x + b->front.x * EYE_SIZE, camera_y + b->front.y * EYE_SIZE, b->front.vertical);
2025-10-14 21:39:22 +02:00
}
2025-10-15 14:08:17 +02:00
// preview
2025-10-18 17:32:37 +02:00
for (size_t i = 0; i < preview.count; i++) {
draw_image(canvas, white_and_blue_dominoes[active.back.val][active.front.val], camera_x + preview.items.brick[i].front.x * EYE_SIZE, camera_y + preview.items.brick[i].front.y * EYE_SIZE, active.front.vertical);
2025-10-14 14:48:54 +02:00
}
2025-10-14 06:17:32 +02:00
2025-10-18 17:32:37 +02:00
draw_glyph(canvas, glyph_flag, camera_x + goal_x * EYE_SIZE + 3, camera_y + goal_y * EYE_SIZE + 3, (struct color) {255, 255, 0, 255});
2025-10-15 16:25:55 +02:00
2025-10-15 17:01:30 +02:00
draw_enemy(canvas, 6, 3, 0, 3);
2025-10-14 17:47:34 +02:00
// hand
2025-10-14 16:32:45 +02:00
for (size_t i = 0; i < hand_count; i++) {
struct brick *b = &hand[i];
2025-10-14 17:47:34 +02:00
b->front.x = (canvas.width - hand_count *(DOMINO_WIDTH + 4))/2 + i * (DOMINO_WIDTH + 4);
b->front.y = canvas.height - DOMINO_WIDTH;
2025-10-18 17:32:37 +02:00
draw_image(canvas, red_and_peach_dominoes[b->back.val][b->front.val], b->front.x, b->front.y, b->front.vertical);
2025-10-14 06:17:32 +02:00
}
2025-10-14 16:32:45 +02:00
2025-10-14 17:47:34 +02:00
// active
if (has_active) {
2025-10-18 17:32:37 +02:00
draw_image(canvas, red_and_peach_dominoes[active.back.val][active.front.val], mouse_x + active.front.x, mouse_y + active.front.y, active.front.vertical);
2025-10-14 17:47:34 +02:00
}
2025-10-14 22:09:59 +02:00
// character
2025-10-15 15:50:18 +02:00
// char title[] = "domino dungeon";
2025-10-15 15:11:47 +02:00
char inventory[] = "Inventory";
2025-10-15 15:50:18 +02:00
char game_over[] = "You reached the goal!";
2025-10-15 15:11:47 +02:00
// print(canvas, title, (canvas.width - (sizeof(title)-1) * 5) / 2, 5, (struct color) {255, 255, 255, 255});
2025-10-18 17:32:37 +02:00
draw_text(canvas, inventory, (canvas.width - (sizeof(inventory)-1) * 5) / 2, canvas.height - DOMINO_WIDTH - 10, (struct color) {255, 255, 255, 255});
draw_text(canvas, "Drag Dominos from your inventory onto the chain to", 3, 2, (struct color) {255, 255, 255, 255});
draw_text(canvas, "reach the goal. Press [R] to rotate", 3, 9, (struct color) {255, 255, 255, 255});
draw_glyph(canvas, glyph_heart, 3, 20, (struct color) {255, 0, 0, 255});
draw_text(canvas, "10", 10, 20, (struct color) {255, 255, 255, 255});
2025-10-15 17:01:30 +02:00
2025-10-15 15:50:18 +02:00
if (is_goal_reached) {
2025-10-18 17:32:37 +02:00
draw_text(canvas, game_over, (canvas.width - (sizeof(game_over)-1) * 5) / 2, 20, (struct color) {255, 255, 255, 255});
2025-10-15 15:50:18 +02:00
}
2025-10-13 21:18:09 +02:00
}
2025-10-14 16:32:45 +02:00