On the complexity of computing winning strategies for finite poset games
type: Item
instance of: scholarly article
title: On the complexity of computing winning strategies for finite poset games
zbMATH Open document ID: 1217.68113
author: Michael Soltys
author: Craig Wilson
published in: Theory of Computing Systems
publication date: 2011-05-23T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 5898929
zbMATH Keywords: finite games
zbMATH Keywords: posets
zbMATH Keywords: PSPACE
zbMATH Keywords: proof complexity
describes a project that uses: Chomp3Rows
MaRDI profile type: Publication
full work available at URL: s00224-010-9254-y
OpenAlex ID: W2168635355
cites work: A Curious Nim-Type Game
cites work: On the complexity of some two-person perfect-information games
cites work: Computer Science Logic
cites work: A complete analysis of von Neumann's Hackendot
cites work: Winning ways for your mathematical plays. Vol. 1.
cites work: Q4762155
cites work: Q3221403
cites work: Q3392275
cites work: Three-rowed CHOMP
cites work: Q4530293
cites work: Nonlinear dynamics in combinatorial games: Renormalizing Chomp
cites work: Q4831470
DOI: 10.1007/S00224-010-9254-Y
Recommended article: Time-Optimal Winning Strategies for Poset Games
Recommended article: The Complexity of Poset Games
Recommended article: Q4967182
Recommended article: The Parameterized Complexity of Positional Games
Recommended article: Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
Recommended article: Complexity of Winning Strategies for Δ 0 2 Games
Recommended article: Q3984859
Recommended article: Advances in finding ideal play on poset games
Recommended article: Winning ways of weighted poset games
description: scientific article; zbMATH DE number 5898929