recursive seed analysis #49

Eli688i · 2025-02-28T19:07:56Z

Eli688i
Feb 28, 2025

is it possible to swap the inputs and outputs I.E
input=
Boss: The Goad
Voucher: Crystal Ball
Tags: Coupon Tag, Rare Tag
Shop Queue:

The World
The Magician
Eris
Venus
Popcorn
Splash
The Moon
8 Ball
Riff-raff
Mail In Rebate
Sock and Buskin
Venus
To the Moon
Mad Joker
Runner

output = SEEDXXXX

#include <stdio.h>
#include <string.h>
#include <stdbool.h>

// Provided constants and seed-handling functions go here:
// SEEDCHARS, NUM_CHARS, Seed struct, s_new, s_next, etc.

// Function to check if a generated output matches the desired configuration
bool matches_configuration(seed* current_seed) {
// Simulate or compute the output based on the seed
// For example, generate the output of Ante 1 (e.g., Boss, Voucher, Shop Queue, etc.)
// Compare it with the desired configuration
// Return true if it matches, false otherwise
// (You need to implement this based on your application logic)

// Placeholder for simulation and matching logic:
return false;

}

int main() {
// Initialize starting seed
seed current_seed = s_new_empty();

long attempts = 0;
bool found = false;

printf("Starting brute-force search...\n");

// Brute-force loop
while (!found) {
    // Check if the current seed matches the desired configuration
    if (matches_configuration(&current_seed)) {
        printf("Matching seed found: ");
        s_print(&current_seed);  // Print the matching seed
        printf("\nAttempts: %li\n", attempts);
        found = true;
    } else {
        // Move to the next seed
        s_next(&current_seed);
        attempts++;

        // Optional: Break after a certain number of attempts to prevent infinite loop
        if (attempts > 1000000000) {  // Example max attempts limit
            printf("Maximum attempts reached. No matching seed found.\n");
            break;
        }
    }
}

if (!found) {
    printf("No matching seed was found.\n");
}

return 0

============================================================

bool matches_configuration(seed* current_seed) {
// Simulate the output based on the current seed
// You'll need to implement this based on your application's algorithm

// Example: check Boss, Voucher, Tags, and Shop Queue
if (strcmp(simulate_boss(current_seed), "The Goad") != 0) return false;
if (strcmp(simulate_voucher(current_seed), "Crystal Ball") != 0) return false;
if (!check_tags(current_seed, "Coupon Tag", "Rare Tag")) return false;

// Compare Shop Queue
char* expected_queue[] = {
    "The World", "The Magician", "Eris", "Venus", "Popcorn", "Splash",
    "The Moon", "8 Ball", "Riff-raff", "Mail In Rebate", "Sock and Buskin",
    "Venus", "To the Moon", "Mad Joker", "Runner"
};
for (int i = 0; i < 15; i++) {
    if (strcmp(simulate_shop_item(current_seed, i), expected_queue[i]) != 0) {
        return false;
    }
}

return true; // Matches all criteria

}

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

recursive seed analysis #49

Uh oh!

{{title}}

Uh oh!

Replies: 0 comments

Select a reply

Uh oh!

recursive seed analysis #49

Uh oh!

Eli688i Feb 28, 2025

output = SEEDXXXX

Replies: 0 comments

Eli688i
Feb 28, 2025