u/Danny_DeWario

EDIT:

Seems like a lot of people think I'm purely talking about hand-to-hand combat. I'm mainly focused on why Frieda didn't alter Grisha's memories with screaming.

Original post:

Frieda, despite having the Founding Titan, lost to Grisha. Rod Reiss says this was because Frieda lacked experience with her titan, and so lost to Grisha who had a physically stronger titan. At face value, this makes sense.

However, the Warhammer Titan - despite lacking battle experience as explained by Galliard - was incredibly amazing at fighting.

The Warhammer being good at fighting makes sense because titan shifters inherit the memories of previous shifters. This means they should also inherit the battle experience of previous shifters (similar to Ackermans), which would explain why the Warhammer Titan was so good at fighting despite never being involved in a battle alongside Marley's military.

However, this should also apply to Frieda. She should inherit the memories of previous Founding Titans, and therefore already know how to use her powers to stop Grisha. Because the vow to renounce war caused Frieda to inherit the ideology of Karl Fritz, you'd expect it to also give her direct knowledge of how to use her Founding Titan abilities. But for some reason, this wasn't the case.

So this seems like a plot hole. The Warhammer was incredible at fighting despite lacking direct battle experience. So Frieda should have been much better at using her Founding Titan's powers.

Link: Lucky 7 Shuffles | Desmos

Randomly shuffling only 7 times actually sorted my list! How lucky is that? :D

Link: https://www.desmos.com/calculator/6iebyyrpib

A random shuffle sorted my list! :D

best wig I could be wrong about, but otherwise everything else is just facts

Link: https://www.desmos.com/calculator/z7bxe7uz11

I just want x_0 to be defined once (at the top). Is there a workaround or way to avoid this?

2x2 Clusters Link: https://www.desmos.com/calculator/b8vwyvwlp7

3x3 Clusters Link: https://www.desmos.com/calculator/a51wcew4h3

original reddit post: Conway's Game of Life (boundless) : r/desmos

I've been playing around with a method of optimization for Conway's Game of Life. It works by grouping a cluster of cells into a single numerical value. For a group of 2x2, it groups 4 cells into a binary number (up to 15). For a group of 3x3, it groups 9 cells into a binary number (up to 511).

This binary numerical value can be broken down into its individual bits, and by using those bits we can determine which cells are alive/dead within that cluster.

I've considered making a graph which uses 4x4 clusters, but I'm honestly not sure if there would be any noticeable improvement in performance. Going from 2x2 to 3x3 wasn't as big of a jump in performance as was going from 1x1 to 2x2.

Link: https://www.desmos.com/calculator/mxpi9jz89m

Link: https://www.desmos.com/calculator/qmgmt2muhn

I tried making an efficient Conway's Game of Life without any bounds. Not sure if I can optimize any further, but I'm pretty satisfied with the results.

Link: https://www.desmos.com/calculator/il5b3wkv55

Rules:

Select the correct circle after randomized shuffling. The correct circle will always start at the top and be highlighted green at the beginning of every round.

Notes:

+You can choose from 2 to 20 circles, and a speed from 1 to 10.

+The game stores all total wins and total games played for each possible setting. At the end of each round, you will be shown your current win stats for that specific game's settings.

+You can manually enter your own settings outside the default ranges, but score keeping won't be possible for those settings.