User:DroneBetter
I contribute here as an editor, I joined on December 1, 2021, but only began making interesting edits at about September 28th of the following year. I am also an amateur programmer and mathematician, as such my edits reflect my interests somewhat.
I live in the UK, at present, where I was born also.
🏳️⚧️
Art gallery
| variant of OT map, as used in Spaceship#In other rules (see there for earlier two and more details) in this variant, grey cells are those disproven from containing spaceships the set of spaceship speeds is sorted and arranged evenly around the colour wheel, and rules sum the colours of spaceships they contain you can see the vertical sixteenth-band of B2 without B0, B1 or B3, which bears an indigo/violet hue due to its photons |
Sir Robin as rendered by gzip_swar_INT, like a long-exposure shot except each iteration is shifted by (2,1)/6 and the colour shifts π3 around the colour wheel, I thought perhaps white subpixels could be considered 36ths of stator cells to generalise volatility to spaceships (and strict volatility, because cells oscillating at subperiods appear grey), an idea which it seemed Connor Steppie also thought of after me in a forum post The doo-dah |
Programming
I began programming initially with Scratch, and eventually made a real-time raytracer (supporting Newtonian lower speeds of light and gravitational lensing) before moving onto Python. However, I only became what I would deem proficient at about the time I made my chess tablebase program, for generating, rendering and simulating state transition diagrams in 3D. It has springs and repulsion (to attempt to optimise Euclidean space to the distance metric of moves between nodes. I also added exhaustive oscillator searches in bounded regions in cellular automata (currently only feasibly up to 5*5, in INT rules without b0), with diagram-viewing for that also. It takes quadratic time to simulate physics because it doesn't implement the fast multipole method. It supports topological manifolds (in both chess and CA) but only reduces the number of states to search by considering only those nonequivalent under symmetry, not vertex-transitivity (as is allowed by some manifolds). Here is the discussion thread (in which I explained some of my other programming :-)
Its purposes for chess, though less elementary, may still be of interest here, being that it concerns recursive application of a simple function (albeit of checkmate regression on finite graphs instead of infinite planes), that give rise to phenomena like the KRvK DTM distribution with respect to board width. A358339 answers the question "How many nonequivalent positions on an n*n board are checkmate in k half-moves," and is surprisingly complex, I suspect it regularises at n > 24, whereupon the maximum DTM (A225552) appears to become linear-recurrent. The cellular automaton mode was initially implemented in a trivial manner, with states simulated as lists of booleans, until my dear friend Redstoneboi (from the forums here) told me about David Buchanan's Github gist, gzip_swar_life.py, which simulates Life with "(Single-Instruction Multiple-Data) Within A Register," representing bounded states as bigints with four bits per cell so its computations with bitwise operators are performed in the C implementation with a constant amount of Python interpreter overhead, the gzip is because it uses gzip to decompress to eight bits per cell, converting it to a YUV4MPEG video (which can be streamed at 1080p60fps, ie. 124416000 cells/second (!!)). I decided to begin modifying it for my program, and made a fork, gzip_swar_isotropic_non-totalistic (also detailed in my forum thread), supporting arbitrary OT rules, INT ones (in 9 bits per cell (in 3*3 squares) then 8 (in 8*1 rectangles) after I realised it can use the pre-mask int to check its own state, which will allow video streaming without the intermediate gzip), topological manifolds and some buggy support for infinite planes. It can analyse oscillators to automatically sort Catagolue censuses by volatility, and make images like those shown above.
I wrote the articles Tutorials/Coding Life simulators/bitwise SWAR Life (regarding the program above), Pólya enumeration theorem, Tutorials/Coding Life simulators/eightfold reducer (concerning an application of the theorem to efficient indexing methods for emulating lists of states under symmetry), Modular congruence,[n 1] One-dimensional cellular automaton/Wolfram rule, OCA:Critters and OCA:Rule 225.
For the sake of completeness, I also created the pages for Grid's p16, Charity's p30 and Cribbage, but they're of the wiki's more standard style of short synoptic pages about elementary patterns, someone would have very shortly if not for me getting there first, and others improved them thereafter.
With gzip_swar_INT's census-sorting mode, it identified some more patterns that constituted entries for Highest volatility period-5 oscillators, and made equivalent pages for periods 3, 4, 6, 7 and 8.
I also made Other jacks, regarding a family of patterns of which one member had accidentally been given the same name as the Jack.
Most of my contributions are edits, I try to increase the total amount of information, rather than only reformat it. My program has allowed for the identification of many patterns from soup search results that constitute interesting notes on related pages, it seems the depths of Catagolue are surprisingly untapped.
Templates
The LifeWiki doesn't have a LaTeX extension, so I made {{frac}}, {{choose}}, {{sum}}, {{product}}, {{sqrt}} and {{lim}}, for expressing formulas in a somewhat more nicely-formatted way.
Userspace pages
- rules! (probably the most interesting to LifeWiki perusers)
- /B3ai4/S23 (Life if John Conway had chosen B4/S23 instead of B3/S23, then invented INT rules in order to allow for the existence of spaceships)
- /Nightingale (a wazir-knight-union neighbourhood, in which the universe is partitioned into two almost-noninteracting universes)
- self-complementary outer-totalistic rules (lists all 47 with spaceships known and 11 that have not been disproven from containing spaceships)
- seminatural linear growth patterns (all those in the b3s23/all-soups census in particular, with a few annotations and links, to be more enjoyable and less hasslesome to go through than Catagolue itself)
I made a program for the more specific task of applying the Pólya enumeration theorem to determine numbers of transitions in neighbourhoods in a specific number of dimensions as closed-form equations in terms of the range, an OEIS sequence (A361870) and an article here about it. Later, I learned about the characterisation of conjugacy classes of the hypercube symmetry group, and made a faster program.
If you are brave enough, my page miscellaneous curiosities is a veritable menagery of things I have found (in programming, maths and the intersection of the two), of varying degrees of interestingness, complexity and novelty. (Most things are included there not for the purposes of explaining them to others, but as a reference for my future self, or a cache for my intended future OEIS contributions, but you may glean something from it nonetheless.)
rule waiver
The LifeWiki etiquette policy says
- Do not edit other people's user pages without their permission
I'm not sure whether this also pertains to subpages thereof (I hope not), but if you have a good-faith contribution to make to any of these, don't be dissuaded by the LifeWiki-wide rule. Like the great hotdogPi before me, I have edited various other people's userspace pages, so it would be hypocritical to disallow it.
Results of own searches on the wiki
Besides my own programs, I mainly use apgsearch, ikpx2 (which I usually do in the Catagolue stdin mode) and rstatoropt. I occasionally search for spaceships of new speeds to add them to rules' wiki pages, even more occasionally this is successful.
- B34kz5e7c8/S23-a4ityz5k (in the yujhspace): Various (mostly not useful but occasionally cool-looking) c/2 technology, 2c/5, (1,1)c/6
- HighFlock: c/3 and (1,1)c/4 which may stretch lines
- Pedestrian Flock: (1,1)c/4 (ikpx2 cannot find a c/3 in logical width ≤ 22)
- Holstein: Smaller asymmetrical stabilisation of the known c/4's frontend
my computers
Ask me over forum messages or something and I will probably be willing to apgsearch your rules
I presently have
- a 2016 laptop with a 2.9GHz Intel dual-core i5 processor, and 8GB of 2133MHz LPDDR3 RAM,
- a 2011 desktop with a 2.8GHz Intel quad-core i7 processor, and 32GB of 1333MHz DDR3 RAM.
both seem to encounter segfaults and inexplicable shutdowns on occasion while ikpx2ing, and neither have CUDA GPUs so I may not contribute to GPU symmetries in outer-totalistic rules :-(
however, I am highly wise and also frugal, and so will not purchase new computers until it becomes necessary :-)
Friends
There are many people from here and the forums and lounge to whom I am thankful, for the kindness and friendship they have shown me (especially since I was more difficult to get along with early-on), in particular (though in no particular order)
- hotdogPi for making the Blocktopus redirect
- Darren Li for using some of the Open Science Grid's resources for b3ai4s23
- yujh for putting up with me for perhaps the longest contiguous duration of anyone (even when I was sending them things in which no-one could possibly interested, like Catagolue links to still lifes I found pareidolic)
- galoomba for her patience and kindness and wisdom
- Magma, who has taught me a great deal and raised me out of the unscientific darkness. Many methods employed in (and the existence of entire sections of) miscellaneous curiosities are due to his teachings, prior to which I had many more deficiencies and holes in my knowledge, he has probably been the best friend I have ever had and I will be forever indebted to him
- apg, for his patient explanations to me (many of which I only came to understand months later)
(very incomplete and shall be amended)
Inane boosts to my already encumbersomely large ego that I should not have received
I coined the name of the Blocktopus (found on June 25, 2021 by Jim Hortons, one of the highest-volatility period-8 oscillators and mentioned in Scrubber for its containment of an ephemeral one in some phases) as a whimsical joke, which David Raucci (hotdogPi) was so kind as to create a redirect for. I have been advised by iNoMed that due to its lack of sparkiness, it is not notable enough for a page yet, but I am happy nonetheless.
In a 2009 edit by apg to the Gun page, he described B36/S245 as the "logarithmic replicator rule," and in 2018 Muzik created a redirect page to it under the same name, which in 2019 Ian07 changed to a complete article. During a cursory examination, I found that the rule's replicator in fact grows with Θ(√t), and found explicit forms for the generation at which it reaches each width and the consequent asymptotic bounds on its growth, in what apg called (to omit a comparative adverb :-) 'thorough and correct.'[1] Following an executive decision by Nathaniel Johnston, it is now located at sqrt replicator rule.
Footnotes
- ↑ I know it seems off-topic for this wiki, but it was redlinked to in a few places by Confocal, which (I learned thereafter) was due to it being an appendix in Conway's Game of Life: Mathematics and Construction.
References
- ↑ calcyman (December 5, 2022). Re: Regarding the name of the """logarithmic""" replicator rule (discussion thread) at the ConwayLife.com forums
