A Proposal for the Implementation of 'Easily-Computable' Random Number Generators in Combat Sport Offensive-Tempo Strategies

Ideas / Approaches
1

Hi all,

My name is James, and I just recently I wrote a funny paper that proposes the use of the Collatz map in Combat Sports.

It’s based on amateur childhood experience with Super Smash Bros and 2D fighter games, of which back then I used a tangentially related ‘fractal thinking’ algorithm (in combo language 112, 112112113, …).

I’m aware that I took some liberties in tone (in all honesty, to highlight and affirm my prerogative to do so as an independent researcher at the very least).

I kinda rushed the paper in light of the recent Navier Stokes situation, so I didn’t get to discuss the relevance of my result (that being the efficiency in memory of the algorithm versus the infinitely complex ‘fractal thinking’), nor did I mention the proposed general idea of a ‘easily computable random number generator to be used in combat sports’ versus simply focusing on the Collatz map, nor did I mention any other Systems other than tempo (such as an offensive exertion system varying in the exertion of each strike).

I’m looking for critiques, and maybe possible further support for serious publication.

Thank you for your time,

Yours sincerely,

James.

2

Hey James,

Making calculations on the fly seems really hard during a fight where things can happen in a split second. But you could take the strengths and weaknesses of your fighter and those of the opponent into account to select and memorize the best combinations before starting a fight or a round.

I think you can use the Collatz Conjecture as a basic PRNG for this. The problem is that you will need large numbers, because (for now) every number goes to 1 making shorter sequences predictable. This and all the calculating steps makes computing slow and I am pretty sure there are PRNG’s that can get you randomized numbers faster.

But if you don’t mind the computing speed, maybe turn it around? Select any number dividable by 3 and select 3n+1 /2 or 3n-1 /2 depending on the outcome being even or uneven. I think it creates a unique sequence for every number and eliminates any predictability the Collatz Conjecture might get. Also you can make the sequences longer in exchange for using bigger numbers and thus computing speed.

For example: F = 9

3n-1 /2: 9 – 13 – 19
3n+1 /2: 19 – 29
3n-1 /2: 29 – 43
3n+1 /2: 43 – 65
3n-1 /2: 65 – 97 – 145 – 217 – 325 – 487
3n+1 /2: 487 – 731 – 1097
Etc.

F = 9: Steps 2, 1, 1, 1, 5, 2, etc.

The different sequences:

F = 3: Steps 1, 1, 2, 3, 2, 2, etc.
F = 9: Steps 2, 1, 1, 1, 5, 2, etc.
F = 15: Steps 3, 1, 3, 1, 1, 1, etc.
F = 21: Steps 1, 4, 4, 2, 5, 1, etc.
F = 27: Steps 1, 2, 1, 4, 1, 5, etc.
Etc.

Just some of my silly thoughts, good luck with your paper!

1 Like