![]() ![]() A tournament is a directed graph where every pair of vertices is connected by a single directed edge. Finally, we consider the so called tournament game. ![]() 22q3poly(q) moves, which improves the previous best bound and answers a question of Beck. Moreover, we show that in the (1:1) game played on KN for a sufficiently large N, Maker can achieve a Kq in only.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |