Parameterized pursuit-evasion games

Scott, Allan; Stege, Ulrike

doi:10.1016/j.tcs.2010.07.004

Search citation statements

Order By: Relevance

Paper Sections

Select...

Parameterized Complexity Of Short Generalized Hex1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

2016

Publication Types

Select...

Article3

Book1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pursuit-evasion games (also known as cops and robber games) have been studied within the framework of short games [40] as well as infinite two-player games on graphs [41].…”

Section: Parameterized Complexity Of Short Generalized Hexmentioning

confidence: 99%

On the complexity of connection games

Bonnet

Jamain

Saffidine

2016

Theoretical Computer Science

View full text Add to dashboard Cite

In this paper, we study three connection games among the most widely played: havannah, twixt, and slither. We show that determining the outcome of an arbitrary input position is PSPACE-complete in all three cases. Our reductions are based on the popular graph problem generalized geography and on hex itself. We also consider the complexity of generalizations of hex parameterized by the length of the solution and establish that while short generalized hex is W[1]-hard, short hex is FPT. Finally, we prove that the ultra-weak solution to the empty starting position in hex cannot be fully adapted to any of these three games.

show abstract

“…Pursuit-evasion games (also known as cops and robber games) have been studied within the framework of short games [40] as well as infinite two-player games on graphs [41].…”

Section: Parameterized Complexity Of Short Generalized Hexmentioning

confidence: 99%