TMBR: November 2025: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
RobinCodes (talk | contribs)
Holdouts: Added more mxdys results.
RobinCodes (talk | contribs)
Holdouts: Added BB(2,7) first enumeration
Line 9: Line 9:
** @mxdys [https://discord.com/channels/960643023006490684/1400456788955893840/1438559730640355378 decided a holdout] from [https://discord.com/channels/960643023006490684/1400456788955893840 50 Random Holdouts] by hand, making 11/50 solved. He also [https://discord.com/channels/960643023006490684/1239205785913790465/1440413375950487693 decided 5 more machines] with a single strategy.  
** @mxdys [https://discord.com/channels/960643023006490684/1400456788955893840/1438559730640355378 decided a holdout] from [https://discord.com/channels/960643023006490684/1400456788955893840 50 Random Holdouts] by hand, making 11/50 solved. He also [https://discord.com/channels/960643023006490684/1239205785913790465/1440413375950487693 decided 5 more machines] with a single strategy.  
* [[BB(2,7)|BB(2,7):]]
* [[BB(2,7)|BB(2,7):]]
** TODO: First exploration
** The [https://github.com/ccz181078/TM code provided by mxdys] breaks up the BB(2,7) enumeration into 1 million subtasks which each run for ~10 minutes and leave ~2500 holdouts based on an average of the first 1K subtasks. These values are about 5 times longer than and 25 times larger than the ones for [[BB(7)]].
** Terry Ligocki enumerated the first 2 subtasks, resulting in 62,062,284 holdouts, which can be found [https://drive.google.com/drive/folders/11AiZYiKJq7v0ns9o5nt-xUsSgSpcuNvZ?usp=drive_link here].
** The expected number of holdouts after the enumeration is ~2'500'000'000.


==BB Adjacent==
==BB Adjacent==

Revision as of 04:18, 26 November 2025

Prev: October 2025 This Month in Beaver Research Next: December 2025

This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).

Holdouts

  • BB(6):
  • BB(2,7):
    • The code provided by mxdys breaks up the BB(2,7) enumeration into 1 million subtasks which each run for ~10 minutes and leave ~2500 holdouts based on an average of the first 1K subtasks. These values are about 5 times longer than and 25 times larger than the ones for BB(7).
    • Terry Ligocki enumerated the first 2 subtasks, resulting in 62,062,284 holdouts, which can be found here.
    • The expected number of holdouts after the enumeration is ~2'500'000'000.

BB Adjacent

TODO