u/KaNaTaProJ

ライフゲームの発展形

内発的動機の創発を狙った実装

★実装内容★

①目的関数・報酬なし
②自己省察（要素相関）・親ログ・チャンプログ・個体記憶
③ランダム食料（2～5回取得可 クールタイム：12step）・バイオーム食料（2～5回取得可 クールタイム：45step）
④バイオーム他者存在時食料取得不可
⑤拠点バリケード（8方向）・バイオームバリケード（8方向）
⑥バックスタブ（背後接触時エネルギーを奪取）
⑦レイド（夜相手拠点付近15step滞在で食料1個奪取 クールタイム:50step）
⑧拠点移動（拠点問題ありと相関から判断したらフラグを立てて移動してよい）

ゲーム内時間で7日間隔で情報をmistral/Grokで解釈してずんだもんがまとめる

【利用素材】

voice

キャスター：ずんだもん（voicebox）
犬,猫,羊,ヤギ：効果音ラボ

font

PixelMplus12(作：itouhiro)

bgm

昼BGM：8bit/ミニゲーム/ジャズ風「カジノのひととき」（作：もみじば）
夜BGM：和風8bit「たそがれ」（作：もみじば）

se

【効果音ラボ】
バックスタブ：刀で斬る4.mp3
レイド：ショット命中.mp3
誕生：パフ.mp3
引っ越し完了：琴の滑奏.mp3
分け合い：ちょこっと触る.mp3
バリケード設置：鉄の扉を閉める.mp3

【Springin】
ニュースジングル：ジングル11-リザルト-

image

ずんだもん立ち絵：ずんだもん立ち絵素材V3.2（作：坂本アヒル）
キャラチップ：キャラセット07　動物（REFMAP）

Twitchで垂れ流しにしてます
ダーウィン放送局 - Twitch

I started this after getting frustrated with a paper that used circular reasoning while claiming progress on the Collatz conjecture.

I'm not a mathematician, just a hobbyist working on this independently, and I want to be upfront: this is not a proof, and I'm not claiming to have found anything that solves or even meaningfully advances the conjecture.

It's just a tool I built for myself, and I figured I'd share it in case anyone else finds it useful or fun to poke around with.

The idea is "depth-first" exploration of specific, structured bit-string families (parity vectors) under the Collatz map, rather than the usual "breadth-first" approach of checking every integer up to some bound.

Thanks to Syracuse-step jumps (skip straight to the next odd number) and Floyd's cycle detection in GMP, memory stays O(1), so it can keep mining a given pattern at a reasonable pace well past the point where the numbers involved have tens of thousands of digits (I've run the all-1s pattern out to n=160,000 bits, roughly 48,000 decimal digits - it's a sparse sample of specific patterns, not exhaustive, of course - just a　particular family of integers per pattern).

The GUI lets you either (1) continuously mine a chosen pattern while logging anomalies, or (2) define a custom pattern (arbitrary 0/1 blocks, alternating/random mixing, or pseudo-random) and scan a parameter like the position of a single "0" bit across a range, plotting the resulting max_bits/n ratio live.

Personally I'd be interested to see what other people find if they try their own patterns - feels like there's a lot of room to poke around in here that I haven't gotten to. Repo has more detail on what the ratio means and some of the patterns I tried.

GitHub: kanataproject/collatz-research-toolkit: A depth-first exploration toolkit for the Collatz conjecture (3x+1 problem). Mines arbitrary parity-vector patterns and tracks Syracuse-step / bit-length expansion ratios. Experimental report, not a proof.