Home > Search Results: keywords:"poziční hry;silné hry;efektivní strategie"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Positional games with efficient winning strategy
 Svoboda, Jakub ; Šámal, Robert (advisor) ; Valla, Tomáš (referee)
We study games where two players are coloring edges of infinite complete graph. Both players are trying to create given target subgraph colored by their colors. Firstly, we will look at situation when the target subgraph is a complete graph. We will show that first player has winning strategy if the target subgraph is complete graph on at most three vertices. Then we will slightly change the rules. This will help us show that the first player has a winning strategy if he can bound the size of the complete graph on which the game is played or he can color a few edges more then the opponent. At the end we will discuss game, when a complete graph of a given size is a minor of target subgraph. We will show a winning strategy for the first player and for small size of complete graph which is the minor of target subgraph. We also will discuss, why the first player should have winning strategy for all games of this type. 1
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English