English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

We have constructed endgame databases for all single-component positions upto 15 squares for Domineering, filled with exact Combinatorial Game Theory(CGT) values in canonical form. The most important findings are as follows.  First, as an extension of Conway's [8] famous Bridge Splitting Theorem forDomineering, we state and prove another theorem, dubbed the Bridge DestroyingTheorem for Domineering. Together these two theorems prove very powerful indetermining the CGT values of large positions as the sum of the values ofsmaller fragments, but also to compose larger positions with specified valuesfrom smaller fragments. Using the theorems, we then prove that for any dyadicrational number there exist Domineering positions with that value.  Second, we investigate Domineering positions with infinitesimal CGT values,in particular ups and downs, tinies and minies, and nimbers. In the databaseswe find many positions with single or double up and down values, but no ups anddowns with higher multitudes. However, we prove that such single-component upsand downs easily can be constructed. Further, we find Domineering positionswith 11 different tinies and minies values. For each we give an example. Next,for nimbers we find many Domineering positions with values up to *3. This issurprising, since Drummond-Cole [10] suspected that no *2 and *3 positions instandard Domineering would exist. We show and characterize many *2 and *3positions. Finally, we give some Domineering positions with values interestingfor other reasons.  Third, we have investigated the temperature of all positions in ourdatabases. There appears to be exactly one position with temperature 2 (asalready found before) and no positions with temperature larger than 2. Thissupports Berlekamp's conjecture that 2 is the highest possible temperature inDomineering.

New Results for Domineering from Combinatorial Game Theory Endgame Databases