Applying adversarial planning techniques to Go (Q1589506): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-order planning: Evaluating possible efficiency gains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A chronology of computer chess and its literature / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of chess / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using patterns and plans in chess / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying adversarial planning techniques to Go / rank
 
Normal rank

Latest revision as of 11:12, 3 June 2024

scientific article
Language Label Description Also known as
English
Applying adversarial planning techniques to Go
scientific article

    Statements

    Applying adversarial planning techniques to Go (English)
    0 references
    0 references
    12 December 2000
    0 references
    0 references
    computer games
    0 references
    Go
    0 references
    adversarial planning
    0 references