Scope of this independent guide
jjj2.info publishes editorial pages and its own Spanning Tree browser simulator. A matching name or search query establishes no outside operator, official domain, licence, app, commercial catalogue, support contact or regional availability.
The simulator uses free virtual coins with no cash value. There are no deposits, withdrawals, commercial accounts or prizes here. Its results establish no external game mathematics, financial safety or commercial affiliation.
The actual simulator rules
One spin draws six independent fair open/closed edges on four labelled vertices zero through three. Edges are 01,02,03,12,13 and 23. Raw score counts distinct spanning trees using only open edges: each tree connects all four vertices with three edges and no cycle. One whole stake covers the graph.
These are this guide's original rules. Visual resemblance, game-category names and search snippets provide no evidence about an external commercial game.
Worked scoring examples
The complete four-vertex graph has sixteen spanning trees. A graph containing only the chain edges 01,12 and 23 scores one. A disconnected graph scores zero. A connected graph with extra edges can contain several different spanning trees; count trees rather than edges, components or walks.
Limits of external claims
No outside business identity, official domain, commercial safety verdict, licence, financial service or support channel is authenticated here. A logo, search ranking, name or professional interface does not establish these facts. HTTPS encrypts transport to a selected host; it does not certify the host business.
The simulator cannot test external responsiveness, commercial payouts, accounts, funds or transactions. No commercial testing history, regulator endorsement or named editorial team with verified contacts has been established for these pages.
Local storage and external requests
The browser retains settled balance and fractional-credit carry as local game state. These records are not an online account and provide no recovery or device synchronisation service. Clearing site storage can remove them; cache deletion alone may not do so.
Pages request Google Fonts and a Statinside analytics script. Server/CDN logs and external requests may expose IP address, browser, device and request details. No anonymity, cookie lifetime, absence of profiling or complete third-party processing description is established. Having no personal-information form does not establish that browsing creates no personal data record.
Frequently asked questions
Is this an authenticated operator website?
No. This guide provides its own simulator and authenticates no outside commercial affiliation.
How is raw score defined?
One spin draws six independent fair open/closed edges on four labelled vertices zero through three. Edges are 01,02,03,12,13 and 23. Raw score counts distinct spanning trees using only open edges: each tree connects all four vertices with three edges and no cycle. One whole stake covers the graph.
What is an example of the score?
The complete four-vertex graph has sixteen spanning trees. A graph containing only the chain edges 01,12 and 23 scores one. A disconnected graph scores zero. A connected graph with extra edges can contain several different spanning trees; count trees rather than edges, components or walks.
What do the weighting modes change?
Low, Medium and High apply square-root, identity and square weights to a positive raw score. Zero stays zero, and each mode is separately normalised.
Inspect the home-page Spanning Tree simulator using free virtual coins. Leave at your chosen stopping time.
Play the free demo