Paperback Edition
Paperback
19 pages
$19.95
Choose vendor to order paperback edition
BrownWalker Press Amazon.com Barnes & Noble Return policy
PDF eBook
Sample Preview
Size 96k
Free
Download a sample of the first 25 pages
Download Preview

Entire PDF eBook
117k
$17
Get instant access to an entire eBook
Buy PDF Password Download Complete PDF
eBook editions

Some Notes on Game Bounds

by Silva Jorg
 Paperback     eBook PDF
Publisher:  Dissertation
Pub date:  1998
Pages:  19
ISBN-10:  1581120214
ISBN-13:  9781581120219
Categories:  Mathematics  Mathematics  Education

Abstract

Combinatorial Games are a generalization of real numbers. Each game has a recursively defined complexity (birthday). In this paper we establish some game bounds. We find some limit cases for how big and how small a game can be, based on its complexity. For each finite birthday, N, we find the smallest positive number and the greatest game born by day N, as well as the smallest and the largest positive infinitesimals. As for each particular birthday we provide the extreme values for those types of games, these results extend those in [1, page 214]. The main references in the theory of combinatorial games are ONAG [1] and WW [2]. We'll use the notation and some fundamental results from WW---mainly from its first six chapters---to establish some bounds to the size of the games.





Paperback Edition
Paperback
19 pages
$19.95
Choose vendor to order paperback edition
BrownWalker Press Amazon.com Barnes & Noble Return policy
PDF eBook
Sample Preview
Size 96k
Free
Download a sample of the first 25 pages
Download Preview

Entire PDF eBook
117k
$17
Get instant access to an entire eBook
Buy PDF Password Download Complete PDF
eBook editions
Share this book