Initial commit

build.zig

@@ -0,0 +1,67 @@
+const std = @import("std");
+
+// Although this function looks imperative, note that its job is to
+// declaratively construct a build graph that will be executed by an external
+// runner.
+pub fn build(b: *std.Build) void {
+    // Standard target options allows the person running `zig build` to choose
+    // what target to build for. Here we do not override the defaults, which
+    // means any target is allowed, and the default is native. Other options
+    // for restricting supported target set are available.
+    const target = b.standardTargetOptions(.{});
+
+    // Standard optimization options allow the person running `zig build` to select
+    // between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not
+    // set a preferred release mode, allowing the user to decide how to optimize.
+    const optimize = b.standardOptimizeOption(.{});
+
+
+    const exe = b.addExecutable(.{
+        .name = "sazzy",
+        .root_source_file = b.path("src/main.zig"),
+        .target = target,
+        .optimize = optimize,
+    });
+
+    // This declares intent for the executable to be installed into the
+    // standard location when the user invokes the "install" step (the default
+    // step when running `zig build`).
+    b.installArtifact(exe);
+
+    // This *creates* a Run step in the build graph, to be executed when another
+    // step is evaluated that depends on it. The next line below will establish
+    // such a dependency.
+    const run_cmd = b.addRunArtifact(exe);
+
+    // By making the run step depend on the install step, it will be run from the
+    // installation directory rather than directly from within the cache directory.
+    // This is not necessary, however, if the application depends on other installed
+    // files, this ensures they will be present and in the expected location.
+    run_cmd.step.dependOn(b.getInstallStep());
+
+    // This allows the user to pass arguments to the application in the build
+    // command itself, like this: `zig build run -- arg1 arg2 etc`
+    if (b.args) |args| {
+        run_cmd.addArgs(args);
+    }
+
+    // This creates a build step. It will be visible in the `zig build --help` menu,
+    // and can be selected like this: `zig build run`
+    // This will evaluate the `run` step rather than the default, which is "install".
+    const run_step = b.step("run", "Run the app");
+    run_step.dependOn(&run_cmd.step);
+
+    const exe_unit_tests = b.addTest(.{
+        .root_source_file = b.path("src/main.zig"),
+        .target = target,
+        .optimize = optimize,
+    });
+
+    const run_exe_unit_tests = b.addRunArtifact(exe_unit_tests);
+
+    // Similar to creating the run step earlier, this exposes a `test` step to
+    // the `zig build --help` menu, providing a way for the user to request
+    // running the unit tests.
+    const test_step = b.step("test", "Run unit tests");
+    test_step.dependOn(&run_exe_unit_tests.step);
+}

build.zig.zon

@@ -0,0 +1,72 @@
+.{
+    // This is the default name used by packages depending on this one. For
+    // example, when a user runs `zig fetch --save <url>`, this field is used
+    // as the key in the `dependencies` table. Although the user can choose a
+    // different name, most users will stick with this provided value.
+    //
+    // It is redundant to include "zig" in this name because it is already
+    // within the Zig package namespace.
+    .name = "sazzy",
+
+    // This is a [Semantic Version](https://semver.org/).
+    // In a future version of Zig it will be used for package deduplication.
+    .version = "0.0.0",
+
+    // This field is optional.
+    // This is currently advisory only; Zig does not yet do anything
+    // with this value.
+    //.minimum_zig_version = "0.11.0",
+
+    // This field is optional.
+    // Each dependency must either provide a `url` and `hash`, or a `path`.
+    // `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
+    // Once all dependencies are fetched, `zig build` no longer requires
+    // internet connectivity.
+    .dependencies = .{
+        // See `zig fetch --save <url>` for a command-line interface for adding dependencies.
+        //.example = .{
+        //    // When updating this field to a new URL, be sure to delete the corresponding
+        //    // `hash`, otherwise you are communicating that you expect to find the old hash at
+        //    // the new URL.
+        //    .url = "https://example.com/foo.tar.gz",
+        //
+        //    // This is computed from the file contents of the directory of files that is
+        //    // obtained after fetching `url` and applying the inclusion rules given by
+        //    // `paths`.
+        //    //
+        //    // This field is the source of truth; packages do not come from a `url`; they
+        //    // come from a `hash`. `url` is just one of many possible mirrors for how to
+        //    // obtain a package matching this `hash`.
+        //    //
+        //    // Uses the [multihash](https://multiformats.io/multihash/) format.
+        //    .hash = "...",
+        //
+        //    // When this is provided, the package is found in a directory relative to the
+        //    // build root. In this case the package's hash is irrelevant and therefore not
+        //    // computed. This field and `url` are mutually exclusive.
+        //    .path = "foo",
+
+        //    // When this is set to `true`, a package is declared to be lazily
+        //    // fetched. This makes the dependency only get fetched if it is
+        //    // actually used.
+        //    .lazy = false,
+        //},
+    },
+
+    // Specifies the set of files and directories that are included in this package.
+    // Only files and directories listed here are included in the `hash` that
+    // is computed for this package. Only files listed here will remain on disk
+    // when using the zig package manager. As a rule of thumb, one should list
+    // files required for compilation plus any license(s).
+    // Paths are relative to the build root. Use the empty string (`""`) to refer to
+    // the build root itself.
+    // A directory listed here means that all files within, recursively, are included.
+    .paths = .{
+        "build.zig",
+        "build.zig.zon",
+        "src",
+        // For example...
+        //"LICENSE",
+        //"README.md",
+    },
+}

src/board.zig

@@ -0,0 +1,311 @@
+const std = @import("std");
+
+
+const Symbol = enum {
+    Barret,
+    Chalice,
+    Flask,
+    Gallion,
+    Hourglass,
+    Scatter,
+    Witch,
+};
+
+const Variant = union(enum) {
+    Multiplier: u32,
+    Respin,
+    Symbol: Symbol,
+    Empty,
+
+    const Self = @This();
+
+    pub fn new_random() Self {
+        const rand = std.crypto.random;
+        const symbol = rand.enumValue(Symbol);
+        return Self{ .Symbol = symbol };
+    }
+};
+
+const Collection = struct {
+    Symbol: Symbol,
+    Piece: std.ArrayList([2]u8),
+};
+
+
+pub const Board = struct {
+    fields: [7][7]Variant,
+    multipler: u32,
+
+    const Self = @This();
+
+    pub fn init() Board {
+        const rand = std.crypto.random;
+        var buffer: [6]u8 = undefined;
+        rand.bytes(&buffer);
+
+        var board = Self {
+            .fields = [7][7]Variant{
+                [7]Variant{Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty},
+                [7]Variant{Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty},
+                [7]Variant{Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty},
+                [7]Variant{Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty},
+                [7]Variant{Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty},
+                [7]Variant{Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty},
+                [7]Variant{Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty, Variant.Empty},
+            },
+            .multipler = 1,
+        };
+        board.fields[buffer[0] % 7][buffer[1] % 7] = Variant.Respin;
+        board.fields[buffer[2] % 7][buffer[3] % 7] = Variant.Respin;
+        board.fields[buffer[4] % 7][buffer[5] % 7] = Variant.Respin;
+        board.fill();
+        return board;
+    }
+
+    pub fn fill(self: *Board) void {
+        const rand = std.crypto.random;
+        var buffer: [6]u8 = undefined;
+        rand.bytes(&buffer);
+        for (self.fields, 0..) |row, i| {
+            for (row, 0..) |field, j| {
+                if (field == Variant.Empty) {
+                    // TODO: add probability distribution for Respins
+                    self.fields[i][j] = Variant{ .Symbol = rand.enumValue(Symbol) };
+                }
+            }
+        }
+    }
+
+    pub fn calculate(self: *Board, components: *std.ArrayList(u8)) !void {
+        var visited: [7][7]bool = [7][7]bool{
+            [7]bool{false, false, false, false, false, false, false},
+            [7]bool{false, false, false, false, false, false, false},
+            [7]bool{false, false, false, false, false, false, false},
+            [7]bool{false, false, false, false, false, false, false},
+            [7]bool{false, false, false, false, false, false, false},
+            [7]bool{false, false, false, false, false, false, false},
+            [7]bool{false, false, false, false, false, false, false},
+        };
+        for (0..self.fields.len) |i| {
+            for (0..self.fields[0].len) |j| {
+                if (self.fields[i][j] != Variant.Multiplier and self.fields[i][j] != Variant.Respin and self.fields[i][j] != Variant.Empty) {
+                    const size = try self.dfs(&visited, @intCast(i), @intCast(j), self.fields[i][j].Symbol);
+                    if (size >= 5) {
+                        // std.debug.print("fuction returned {} for Symbol {}\n", .{size, self.fields[i][j].Symbol});
+                        try components.append(@as(u8, @truncate((@as(u8, @truncate(i)) << 3 | j))));
+                    }
+                }
+            }
+        }
+    }
+
+    pub fn dfs(self: *Board, visited: *[7][7]bool, i: u8, j: u8, cell_type: Symbol) !u32 {
+        var gpa = std.heap.GeneralPurposeAllocator(.{}){};
+        const allocator = gpa.allocator();
+
+        var stack = std.ArrayList([2]u8).init(allocator);
+        try stack.append([2]u8{i, j});
+        var size: u8 = 0;
+        while (stack.items.len > 0) {
+            const cords = stack.pop();
+            if (cords[0] >= 7 or cords[1] >= 7 or
+                visited[cords[0]][cords[1]] or (
+                    switch (self.fields[cords[0]][cords[1]]) {
+                        Variant.Empty => unreachable,
+                        Variant.Multiplier => false,
+                        Variant.Respin => true,
+                        Variant.Symbol => self.fields[cords[0]][cords[1]].Symbol != cell_type
+                    }
+                )
+            ) {
+                if (cords[0] <= 6 and cords[1] <= 6 and self.fields[cords[0]][cords[1]] == Variant.Respin) {
+                    visited[cords[0]][cords[1]] = true;
+                }
+                continue;
+            }
+            visited[cords[0]][cords[1]] = true;
+            size += 1;
+
+            if (cords[0] > 0) {
+                try stack.append([2]u8{cords[0] - 1, cords[1]});
+            }
+            try stack.append([2]u8{cords[0] + 1, cords[1]});
+            if (cords[1] > 0) {
+                try stack.append([2]u8{cords[0], cords[1] - 1});
+            }
+            try stack.append([2]u8{cords[0], cords[1] + 1});
+            // std.debug.print(
+            //     "increased size to {}, for symbol {} at position {}x{}, new stack size is {}\n",
+            //     .{size, cell_type, cords[0], cords[1], stack.items.len}
+            // );
+        }
+        return size;
+    }
+
+    pub fn print(self: Self) !void {
+        const stdout_file = std.io.getStdOut().writer();
+        var bw = std.io.bufferedWriter(stdout_file);
+        const stdout = bw.writer();
+
+        try stdout.print("Board:\n", .{});
+
+        for (self.fields) |row| {
+            for (row) |field| {
+                switch (field) {
+                    Variant.Multiplier => try stdout.print("M", .{}),
+                    Variant.Respin => try stdout.print("R", .{}),
+                    Variant.Empty => try stdout.print("E", .{}),
+                    Variant.Symbol => {
+                        switch (field.Symbol) {
+                            Symbol.Barret => try stdout.print("B", .{}),
+                            Symbol.Chalice => try stdout.print("C", .{}),
+                            Symbol.Flask => try stdout.print("F", .{}),
+                            Symbol.Gallion => try stdout.print("G", .{}),
+                            Symbol.Hourglass => try stdout.print("H", .{}),
+                            Symbol.Scatter => try stdout.print("S", .{}),
+                            Symbol.Witch => try stdout.print("W", .{}),
+                        }
+                    }
+                }
+            }
+            try stdout.print("\n", .{});
+        }
+        try bw.flush();
+    }
+
+    pub fn print5(self: Self) !void {
+        const symbols = [10][5][5]u8{
+            [5][5]u8{
+                [5]u8{'|', '-', '-', '-', '|'},
+                [5]u8{'|', ' ', ' ', ' ', '|'},
+                [5]u8{'M', 'M', 'M', 'M', 'M'},
+                [5]u8{'|', ' ', ' ', ' ', '|'},
+                [5]u8{'|', '_', '_', '_', '|'},
+            },
+            [5][5]u8{
+                [5]u8{'\\', ' ', ' ', ' ', '/'},
+                [5]u8{' ', '\\', ' ', '/', ' '},
+                [5]u8{' ', ' ', 'x', ' ', ' '},
+                [5]u8{' ', '/', ' ', '\\', ' '},
+                [5]u8{'/', ' ', ' ', ' ', '\\'},
+            },
+            [5][5]u8{
+                [5]u8{' ', ' ', ' ', ' ', ' '},
+                [5]u8{' ', ' ', ' ', ' ', ' '},
+                [5]u8{' ', ' ', ' ', ' ', ' '},
+                [5]u8{' ', ' ', ' ', ' ', ' '},
+                [5]u8{' ', ' ', ' ', ' ', ' '},
+            },
+            [5][5]u8{
+                [5]u8{' ', '|', '-', '\\', ' '},
+                [5]u8{' ', '|', ' ', '|', ' '},
+                [5]u8{' ', '|', '-', ' ', ' '},
+                [5]u8{' ', '|', ' ', '|', ' '},
+                [5]u8{' ', '|', '-', '/', ' '},
+            },
+            [5][5]u8{
+                [5]u8{' ', '/', '-', '\\', ' '},
+                [5]u8{' ', '|', ' ', ' ', ' '},
+                [5]u8{' ', '|', ' ', ' ', ' '},
+                [5]u8{' ', '|', ' ', ' ', ' '},
+                [5]u8{' ', '\\', '-', '/', ' '},
+            },
+            [5][5]u8{
+                [5]u8{' ', '|', '-', '-', ' '},
+                [5]u8{' ', '|', ' ', ' ', ' '},
+                [5]u8{' ', '|', '-', ' ', ' '},
+                [5]u8{' ', '|', ' ', ' ', ' '},
+                [5]u8{' ', '|', ' ', ' ', ' '},
+            },
+            [5][5]u8{
+                [5]u8{' ', ' ', '-', ' ', ' '},
+                [5]u8{' ', '/', ' ', '\\', ' '},
+                [5]u8{'|', ' ', ' ', ' ', '|'},
+                [5]u8{' ', '\\', ' ', '/', ' '},
+                [5]u8{' ', ' ', '_', ' ', ' '},
+            },
+            [5][5]u8{
+                [5]u8{' ', '|', ' ', '|', ' '},
+                [5]u8{' ', '|', ' ', '|', ' '},
+                [5]u8{' ', '|', '-', '|', ' '},
+                [5]u8{' ', '|', ' ', '|', ' '},
+                [5]u8{' ', '|', ' ', '|', ' '},
+            },
+            [5][5]u8{
+                [5]u8{' ', '/', '-', '\\', ' '},
+                [5]u8{' ', '|', ' ', ' ', ' '},
+                [5]u8{' ', ' ', '-', '\\', ' '},
+                [5]u8{' ', ' ', ' ', '|', ' '},
+                [5]u8{' ', '\\', '_', '/', ' '},
+            },
+            [5][5]u8{
+                [5]u8{'|', ' ', '|', ' ', '|'},
+                [5]u8{'|', ' ', '|', ' ', '|'},
+                [5]u8{'|', ' ', '|', ' ', '|'},
+                [5]u8{'|', ' ', '|', ' ', '|'},
+                [5]u8{'\\', '/', ' ', '\\', '/'},
+            },
+        };
+        var output = std.mem.zeroes([7][7][5][5]u8);
+
+        const stdout_file = std.io.getStdOut().writer();
+        var bw = std.io.bufferedWriter(stdout_file);
+        const stdout = bw.writer();
+        try stdout.print("\n", .{});
+        for (self.fields, 0..) |row, i| {
+            for (row, 0..) |field, j| {
+                switch (field) {
+                    Variant.Multiplier => output[i][j] = symbols[0],
+                    Variant.Respin => output[i][j] = symbols[1],
+                    Variant.Empty => output[i][j] = symbols[2],
+                    Variant.Symbol => {
+                        switch (field.Symbol) {
+                            Symbol.Barret => output[i][j] = symbols[3],
+                            Symbol.Chalice => output[i][j] = symbols[4],
+                            Symbol.Flask => output[i][j] = symbols[5],
+                            Symbol.Gallion => output[i][j] = symbols[6],
+                            Symbol.Hourglass => output[i][j] = symbols[7],
+                            Symbol.Scatter => output[i][j] = symbols[8],
+                            Symbol.Witch => output[i][j] = symbols[9],
+                        }
+                    }
+                }
+            }
+        }
+
+        // iterate over rows on board
+        for (0..output.len) |i| {
+            // iterate over fields on row
+            for (0..output[0][0].len) |j| {
+                // iterate over slices of output symbol
+                for (0..output[0].len) |k| {
+                    // for (0..7) |k2| {
+                        if (k == 0) {
+                            try stdout.print("   ", .{});
+                        }
+                        if (output[i][k][j][0] != 'M') {
+                            try stdout.print("{s}", .{output[i][k][j]});
+                        } else {
+                            try stdout.print("|{}|", .{self.fields[i][k].Multiplier});
+                        }
+                        if (k == 6) {
+                            try stdout.print("\n", .{});
+                        } else {
+                            try stdout.print("   |   ", .{});
+                        }
+                    // }
+                }
+            }
+            if (i != 6) {
+                try stdout.print(
+                    "===================================================================================\n",
+                    .{}
+                );
+            }
+        }
+        try stdout.print("\n", .{});
+        try bw.flush();
+    }
+};
+
+

src/main.zig

@@ -0,0 +1,29 @@
+const std = @import("std");
+const game = @import("board.zig");
+
+
+
+
+pub fn main() !void {
+    const stdout_file = std.io.getStdOut().writer();
+    var bw = std.io.bufferedWriter(stdout_file);
+    const stdout = bw.writer();
+
+    var board = game.Board.init();
+
+    try board.print5();
+    try stdout.print("\n", .{});
+
+    var gpa = std.heap.GeneralPurposeAllocator(.{}){};
+    const allocator = gpa.allocator();
+    defer _ = gpa.deinit();
+
+    var buffer = std.ArrayList(u8).init(allocator);
+    try board.calculate(&buffer);
+    for (buffer.items) |item| {
+        try stdout.print("{}x{}\n", .{item & 0b111, (item >> 3) & 0b111});
+    }
+    buffer.deinit();
+
+    try bw.flush();
+}