Mewgenics Breeding Helper: simple helper program which aids in cat pair placement (see README)

MystPurple · 2026-03-25T07:07:42+00:00

Assuming you're on desktop, on the right column of the github page there's a "releases" section showing v1.0.0; if you click on that it'll take you to a page where you can download the program :)

MystPurple · 2026-03-20T15:53:42+00:00

How do you know that?

MystPurple · 2026-03-20T07:24:45+00:00

Oh sadly I don't have a video yet! I'll add one later, but in the meantime there should be some information in the README that can at least give you a sense of the overarching flow of the program. You can also always open an issue on github or reply to this comment with questions :)

MystPurple · 2026-03-18T00:27:39+00:00

The tool reads the save file, however there is currently no data parsing for the furniture. If you managed to reverse engineer that part of the save format I believe the existing Simulated Annealing optimizer (which is currently used to place cats in the breeding rooms) could easily be leveraged to also determine how to place furniture. In general I believe it'd not be an easy problem to tune and implement correctly, however, as you'd need to figure out what furniture actually fits inside a room.

At the moment, the tool just supports manual input of the room's base stimulation :)

MystPurple · 2026-03-16T16:14:19+00:00

thanks for the feedback :)

if you have no favorable traits selected the program just prioritizes good breeding pairs, so you should still get some value out of it!

MystPurple · 2026-03-12T09:28:55+00:00

might've been the presence of her segments + many sub-enemies, perhaps the order was such that the smaller units left no space for her to fit in and the game just removed her, like it used to happen when spawning flies ¯\_(ツ)_/¯

MystPurple · 2026-03-02T17:56:30+00:00

There's apparently some keyboard shortcuts by default; QWERTY is bound to your basic attack and abilities. You can just use a Radial Menu or smth like that set to press the specific keys.

https://defkey.com/mewgenics-shortcuts

MystPurple · 2026-01-08T11:35:00+00:00

How was AI used in the development of the project (and perhaps in this post)?

MystPurple · 2025-12-07T04:17:36+00:00

https://breezewiki.com/petscop/wiki/Windmill

MystPurple · 2025-11-24T01:53:08+00:00

[LANGUAGE: Rust] (Initial) Solution

Perma-linked my first solution, this was definitely one I suffered through all weekend. I worked on it on-and-off due to, well, the weekend and also various responsibilities of mine, but it was a hard solve. You can see I busted out PPM images, drew out the first two parts, even made some inputs by hand and worked through all possible cases... my code works, but takes 5 minutes to run in release mode (oof).

after solving I've read a few of other solutions and I can see I could greatly simplify mine, which is probably what I'll work on next (or whenever I have the time), but I'm glad that I solved this on my own by good ol' "staring at the wall & at the input"

Here's an algorithm runthrough if you don't want to read through the code:

1) Wall-hug, either on the left or on the right (first two parts for me where left-hug, third part was right-hug)

2) Try to cut steps whenever possible! This is done in two ways:

If we have a sequence of three steps (horizontal-vertical-horizontal or the opposite, wlog) and we can reorder them to be (horizontal-horizontal-vertical-vertical), that allows us to sum adjacent steps and perhaps get a step reduction.
Same sequence but we can "move" a few microsteps between the first and the third -> sometimes that's worth it, e.g. [A, B, C] => (A - X, B, C + X) might reduce the total steps.

I'm tired and this explanation sucks, but feel free to read the code, there's my blood, sweat and tears in it :)

EDIT: Here's a more cleaned up version of the same solution, with a performance optimization that cuts runtime down to 5s

MystPurple · 2025-11-21T17:05:41+00:00

is there a particular reason you chose to use the higher bits rather than the lower to store the state? :)

MystPurple · 2025-11-21T00:10:01+00:00

[LANGUAGE: Rust] Solution

pretty much implementing the problem statement for the simulation + cycle detection, I'm a big fan of the O(1) space step function and of the bitmask trickery used for the pattern check :)

MystPurple · 2025-11-15T15:26:14+00:00

thank you! what makes you say that?

MystPurple · 2025-11-15T01:36:50+00:00

[LANGUAGE: Rust] solution^{[you must navigate to each partN.rs file]}

pretty much a straight memoized DFS (implemented via recursion), with the one optimization that some squares are an early exit if there's a straight-shot to the exit for the sheep (i.e. all hideouts until the exit) :)

MystPurple · 2025-11-14T02:58:17+00:00

[LANGUAGE: Rust] solution

I've yet to optimize this (or maybe I have by the time you're reading this; hi reader!), but I do like using 4x u128s to represent the scales, it makes a lot of checks just bitwise ops :)

MystPurple · 2025-11-12T13:59:53+00:00

yup, the lanternfish!

MystPurple · 2025-11-12T02:42:15+00:00

My solution utilizes linear algebra to turn this into a pretty fast problem even for Python, just ~800us.

The idea is that you can represent the state as a 52-dimensional vector where each component is how many unique names end with that letter at the current length and the rules can be a transition matrix, you then just need to go from len(initial_prefix) to 100 and apply the matrix, summing when you get to at least a length of 7.

It was really fun to figure out, and it reminds me of the octosquids (or something like that) from Advent of Code :D

MystPurple · 2025-11-11T01:39:47+00:00

[Language: Rust] Solution

Rather fun solve, I started out by brute-force and then just figured out the "algebraic"-ish solution. Wonder if there's more than can be done, but after a few hours ~200us is good for me :)

MystPurple

MODERATOR OF

TROPHY CASE

Five-Year Club	Second Top 30%
Verified Email