The Mate-in-n Problem of Infinite Chess Is Decidable (Q2904396): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): conf/cie/BrumleveHS12, #quickstatements; #temporary_batch_1731530891435
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1893952159 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1201.5597 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/cie/BrumleveHS12 / rank
 
Normal rank

Latest revision as of 22:19, 13 November 2024

scientific article
Language Label Description Also known as
English
The Mate-in-n Problem of Infinite Chess Is Decidable
scientific article

    Statements

    The Mate-in-n Problem of Infinite Chess Is Decidable (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2012
    0 references

    Identifiers