DOCSLIB.ORG

Heuristic Search Techniques for Real-Time Strategy Games David

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Heuristic Search Techniques for Real-Time Strategy Games David Heuristic Search Techniques for Real-Time Strategy Games by David Churchill A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Department of Computing Science University of Alberta c David Churchill, 2016 Abstract Real-time strategy (RTS) video games are known for being one of the most complex and strategic games for humans to play. With a unique combination of strategic thinking and dexterous mouse movements, RTS games make for a very intense and exciting game-play experience. In recent years the games AI research community has been increasingly drawn to the field of RTS AI research due to its challenging sub-problems and harsh real-time computing constraints. With the rise of e-Sports and professional human RTS gaming, the games industry has become very interested in AI techniques for helping design, balance, and test such complex games. In this thesis we will introduce and motivate the main topics of RTS AI research, and identify which areas need the most improvement. We then describe the RTS AI research we have conducted, which consists of five major contributions. First, our depth-first branch and bound build-order search algorithm, which is capable of producing professional human-quality build-orders in real-time, and was the first heuristic search algorithm to be used on-line in a starcraft AI competition setting. Second, our RTS combat simulation system: SparCraft, which contains three new algorithms for unit micromanagement (Alpha-Beta Considering Dura- tions (ABCD), UCT Considering Durations (UCT-CD) and Portfolio Greedy Search), each outperforming the previous state-of-the-art. Third, Hierarchical Portfolio Search for games with large search spaces, which was implemented as the AI system for the online strategy game Prismata by Lunarch Studios. Fourth, UAlbertaBot: our starcraft AI bot which won the 2013 AIIDE starcraft AI competition. And fifth: our tournament managing software which is currently used in all three major starcraft AI competitions. ii Acknowledgements I would like to extend my sincere thanks to my supervisor Michael Buro for introducing me to the topic of Artificial Intelligence and for always pushing me to be a better researcher. Thanks to my committee members Vadim Bulitko, Martin M¨uller, H´ector Mu˜noz-Avlia, and Scott Dick for their feedback and guidance, and to the members of the Real-Time Strategy games research group and the Heuristic Search group at the University of Alberta for the constant stream of ideas and motivation that kept me excited about my research. None of this work would have been possible without the love and support of my family and friends. Thank you to my mother who (almost) never com- plained about me being on my computer at all hours of the night, allowing me to find and develop my true passion in life which led me to pursuing grad school. I can never thank you enough for how supportive you were throughout my life and for how much that has contributed to the person I am today. Also, my warmest thanks to Natasha Bulat for being my better half, encouraging me every step of the way, and for always being there for me. iii Table of Contents 1 Introduction 1 1.1Real-TimeStrategyGames.................... 1 1.2Motivation............................. 2 1.2.1 CreatingBetterAIAgents................ 3 1.2.2 RTSAICompetitions.................. 4 1.2.3 GameDesign,Balance,andTesting........... 5 1.3 Thesis Outline ........................... 6 2 RTS Sub-Problems, Background, and Literature Survey 7 2.1Strategy.............................. 9 2.1.1 Knowledge and Learning ................. 10 2.1.2 Opponent Modeling and Prediction . ........ 10 2.1.3 StrategicStance...................... 12 2.1.4 ArmyComposition.................... 14 2.1.5 Build-Order Planning ................... 14 2.2Tactics............................... 15 2.2.1 Scouting.......................... 16 2.2.2 Combat Timing and Position .............. 16 2.2.3 Building Placement .................... 17 2.3ReactiveControl......................... 18 2.3.1 UnitMicro........................ 19 2.3.2 Multi-Agent Pathfinding and Terrain Analysis ..... 21 3 Build-Order Optimization 23 3.1Background............................ 24 3.2 Build-Order Planning Model for Starcraft ........... 25 3.2.1 Abstractions........................ 26 3.2.2 Algorithm......................... 27 3.2.3 ActionLegality...................... 27 3.2.4 Fast Forwarding and State Transition .......... 28 3.2.5 ConcurrentActionsandActionSubsetSelection.... 29 3.2.6 HeuristicsandMacroActions.............. 30 3.3Experiments............................ 31 3.4 Summary ............................. 38 4 RTS Combat Micromanagement 39 4.1 Modeling RTS Combat: SparCraft ............... 40 4.2SolutionConceptsforCombatGames.............. 42 4.2.1 ScriptedBehaviours................... 43 4.2.2 GameTheoreticApproximations............ 44 4.3FastSearchMethodsforCombatGames............ 46 4.3.1 SimultaneousMoveSequentialization.......... 46 4.3.2 EvaluationFunctions................... 48 iv 4.3.3 MoveOrdering...................... 49 4.4 Alpha-Beta Considering Durations ............... 50 4.4.1 ExperimentSetup..................... 51 4.4.2 InfluenceoftheSearchSettings............. 52 4.4.3 EstimatingtheQualityofScripts............ 52 4.4.4 Discussuion........................ 54 4.5UCTConsideringDurations................... 55 4.6PortfolioGreedySearch..................... 57 4.6.1 Algorithm......................... 58 4.6.2 Experiments........................ 60 4.6.3 Results........................... 64 4.6.4 Discussion......................... 71 4.7IntegrationIntoRTSAIAgents................. 72 4.7.1 StarCraftExperiments.................. 74 5 Hierarchical Portfolio Search and the Prismata AI 79 5.1AIDesignGoals.......................... 80 5.2HierarchicalPortfolioSearch................... 80 5.2.1 ComponentsofHPS................... 81 5.2.2 StateEvaluation..................... 82 5.3Prismata.............................. 84 5.3.1 Game Description ..................... 84 5.3.2 AIChallenges....................... 86 5.4PrismataAISystem....................... 88 5.4.1 AI Environment and Implementation .......... 88 5.4.2 HierarchicalPorfolioSearchinPrismata........ 89 5.4.3 AIConfigurationandDifficultySettings........ 90 5.5Experiments............................ 90 5.5.1 AIvs.HumanPlayers.................. 91 5.5.2 DifficultySettings..................... 91 5.5.3 UserSurvey........................ 94 5.6 Summary ............................. 95 6 Software Contributions 97 6.1UAlbertaBot........................... 97 6.1.1 Design........................... 97 6.1.2 StrategyandAISystems................. 99 6.1.3 CompetitionResultsandMilestones.......... 102 6.1.4 Impact and Research Use ................ 104 6.2TournamentManagerSoftware................. 105 6.2.1 Server........................... 106 6.2.2 Client........................... 108 7 Conclusion 110 7.1Contributions........................... 110 7.1.1 Build-Order Optimization ................ 110 7.1.2 RTSCombatMicromanagement............. 111 7.1.3 HierarchicalPortfolioSearch............... 111 7.1.4 Software Contributions . ................. 112 7.2 Directions for Future Research .................. 113 7.2.1 “Goal-less” Build-Order Search ............. 113 7.2.2 ImprovedCombatSimulation.............. 115 7.2.3 Machine Learning State Evaluations .......... 115 Bibliography 117 v List of Tables 4.1ABCDvs.Script-scoresforvarioussettings.......... 53 4.2Playout-basedABCDperformance............... 53 4.3 Real-time exploitability of scripted strategies. ......... 53 4.4 Sequence of events occurring after an attack command has been given in StarCraft. Also listed are the associated values of isAtk and atkFrm, the results of BWAPI unit.isAttacking() and unit.isAttackFrame() return values for the given step. This shows the non-triviality of something as intuitively simple of having frame-perfect control of unit actions in starcraft... 73 4.5 Results from the micro AI experiment. Shown are scores for Micro Search, AttackWeakest, and Kiter decision policies each versus the built-in starcraft AI for each scenario. Scores are shown for both the micro simulator (Sim) and the actual BWAPI-basedimplementation(Game).............. 77 5.1 Prismata Player Ranking Distribution ............. 93 5.2Searchvs.DifficultiesResults(RowWin%).......... 93 5.3 Search Algorithm Timing Results (Row Win %) ........ 93 6.1 UAlbertaBot results for major starcraft AI Competitions. Question mark indicates values that are unknown or not appli- cable................................ 104 vi List of Figures 2.1 The main sub-problems in RTS AI research categorized by their approximate time scope and level of abstraction. Arrows indi- cate the direction that information flows hierarchically through the different sub-problems, similar to a military command struc- ture................................. 8 3.1 Makespan vs. nodes searched for late-game goal of two carriers, comparing optimal search (K = 1) and approximate search with macro actions (K = 2). Macro actions make complex searches tractable while maintaining close to optimal makespans. 32 3.2 A sample search episode of BOSS applied to starcraft using the Protoss race, starting with 8 Probes and 1 Nexus, with the goal of building two Dragoon units in the quickest way possible. The left-most path is the first build-order found by algorithm 1 which satisfies the goal (makespan listed below in starcraft game frames). Each other leaf from left to right represents
Load more

Recommended publications
  • An Abstract of the Thesis Of
    AN ABSTRACT OF THE THESIS OF Brian D. King for the degree of Master of Science in Electrical and Computer Engineering presented on June 12, 2012. Title: Adversarial Planning by Strategy Switching in a Real-Time Strategy Game Abstract approved: Alan P. Fern We consider the problem of strategic adversarial planning in a Real-Time Strategy (RTS) game. Strategic adversarial planning is the generation of a network of high-level tasks to satisfy goals while anticipating an adversary's actions. In this thesis we describe an abstract state and action space used for planning in an RTS game, an algorithm for generating strategic plans, and a modular architecture for controllers that generate and execute plans. We describe in detail planners that evaluate plans by simulation and select a plan by Game Theoretic criteria. We describe the details of a low-level module of the hierarchy, the combat module. We examine a theoretical performance guarantee for policy switching in Markov Games, and show that policy switching agents can underperform fixed strategy agents. Finally, we present results for strategy switching planners playing against single strategy planners and the game engine's scripted player. The results show that our strategy switching planners outperform single strategy planners in simulation and outperform the game engine's scripted AI. c Copyright by Brian D. King June 12, 2012 All Rights Reserved Adversarial Planning by Strategy Switching in a Real-Time Strategy Game by Brian D. King A THESIS submitted to Oregon State University in partial fulfillment of the requirements for the degree of Master of Science Presented June 12, 2012 Commencement June 2013 Master of Science thesis of Brian D.
    [Show full text]
  • Parity Games: Descriptive Complexity and Algorithms for New Solvers
    Imperial College London Department of Computing Parity Games: Descriptive Complexity and Algorithms for New Solvers Huan-Pu Kuo 2013 Supervised by Prof Michael Huth, and Dr Nir Piterman Submitted in part fulfilment of the requirements for the degree of Doctor of Philosophy in Computing of Imperial College London and the Diploma of Imperial College London 1 Declaration I herewith certify that all material in this dissertation which is not my own work has been duly acknowledged. Selected results from this dissertation have been disseminated in scientific publications detailed in Chapter 1.4. Huan-Pu Kuo 2 Copyright Declaration The copyright of this thesis rests with the author and is made available under a Creative Commons Attribution Non-Commercial No Derivatives licence. Researchers are free to copy, distribute or transmit the thesis on the condition that they attribute it, that they do not use it for commercial purposes and that they do not alter, transform or build upon it. For any reuse or redistribution, researchers must make clear to others the licence terms of this work. 3 Abstract Parity games are 2-person, 0-sum, graph-based, and determined games that form an important foundational concept in formal methods (see e.g., [Zie98]), and their exact computational complexity has been an open prob- lem for over twenty years now. In this thesis, we study algorithms that solve parity games in that they determine which nodes are won by which player, and where such decisions are supported with winning strategies. We modify and so improve a known algorithm but also propose new algorithmic approaches to solving parity games and to understanding their descriptive complexity.
    [Show full text]
  • Learning Board Game Rules from an Instruction Manual Chad Mills A
    Learning Board Game Rules from an Instruction Manual Chad Mills A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science University of Washington 2013 Committee: Gina-Anne Levow Fei Xia Program Authorized to Offer Degree: Linguistics – Computational Linguistics ©Copyright 2013 Chad Mills University of Washington Abstract Learning Board Game Rules from an Instruction Manual Chad Mills Chair of the Supervisory Committee: Professor Gina-Anne Levow Department of Linguistics Board game rulebooks offer a convenient scenario for extracting a systematic logical structure from a passage of text since the mechanisms by which board game pieces interact must be fully specified in the rulebook and outside world knowledge is irrelevant to gameplay. A representation was proposed for representing a game’s rules with a tree structure of logically-connected rules, and this problem was shown to be one of a generalized class of problems in mapping text to a hierarchical, logical structure. Then a keyword-based entity- and relation-extraction system was proposed for mapping rulebook text into the corresponding logical representation, which achieved an f-measure of 11% with a high recall but very low precision, due in part to many statements in the rulebook offering strategic advice or elaboration and causing spurious rules to be proposed based on keyword matches. The keyword-based approach was compared to a machine learning approach, and the former dominated with nearly twenty times better precision at the same level of recall. This was due to the large number of rule classes to extract and the relatively small data set given this is a new problem area and all data had to be manually annotated.
    [Show full text]
  • Consumer Motivation, Spectatorship Experience and the Degree of Overlap Between Traditional Sport and Esport.”
    COMPETITIVE SPORT IN WEB 2.0: CONSUMER MOTIVATION, SPECTATORSHIP EXPERIENCE, AND THE DEGREE OF OVERLAP BETWEEN TRADITIONAL SPORT AND ESPORT by JUE HOU ANDREW C. BILLINGS, COMMITTEE CHAIR CORY L. ARMSTRONG KENON A. BROWN JAMES D. LEEPER BRETT I. SHERRICK A DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Journalism and Creative Media in the Graduate School of The University of Alabama TUSCALOOSA, ALABAMA 2019 Copyright Jue Hou 2019 ALL RIGHTS RESERVED ABSTRACT In the 21st Century, eSport has gradually come into public sight as a new form of competitive spectator event. This type of modern competitive video gaming resembles the field of traditional sport in multiple ways, including players, leagues, tournaments and corporate sponsorship, etc. Nevertheless, academic discussion regarding the current treatment, benefit, and risk of eSport are still ongoing. This research project examined the status quo of the rising eSport field. Based on a detailed introduction of competitive video gaming history as well as an in-depth analysis of factors that constitute a sport, this study redefined eSport as a unique form of video game competition. From the theoretical perspective of uses and gratifications, this project focused on how eSport is similar to, or different from, traditional sports in terms of spectator motivations. The current study incorporated a number of previously validated-scales in sport literature and generated two surveys, and got 536 and 530 respondents respectively. This study then utilized the data and constructed the motivation scale for eSport spectatorship consumption (MSESC) through structural equation modeling.
    [Show full text]
  • Complexity in Simulation Gaming
    Complexity in Simulation Gaming Marcin Wardaszko Kozminski University [email protected] ABSTRACT The paper offers another look at the complexity in simulation game design and implementation. Although, the topic is not new or undiscovered the growing volatility of socio-economic environments and changes to the way we design simulation games nowadays call for better research and design methods. The aim of this article is to look into the current state of understanding complexity in simulation gaming and put it in the context of learning with and through complexity. Nature and understanding of complexity is both field specific and interdisciplinary at the same time. Analyzing understanding and role of complexity in different fields associated with simulation game design and implementation. Thoughtful theoretical analysis has been applied in order to deconstruct the complexity theory and reconstruct it further as higher order models. This paper offers an interdisciplinary look at the role and place of complexity from two perspectives. The first perspective is knowledge building and dissemination about complexity in simulation gaming. Second, perspective is the role the complexity plays in building and implementation of the simulation gaming as a design process. In the last section, the author offers a new look at the complexity of the simulation game itself and perceived complexity from the player perspective. INTRODUCTION Complexity in simulation gaming is not a new or undiscussed subject, but there is still a lot to discuss when it comes to the role and place of complexity in simulation gaming. In recent years, there has been a big number of publications targeting this problem from different perspectives and backgrounds, thus contributing to the matter in many valuable ways.
    [Show full text]
  • Time War: Paul Virilio and the Potential Educational Impacts of Real-Time Strategy Videogames
    Philosophical Inquiry in Education, Volume 27 (2020), No. 1, pp. 46-61 Time War: Paul Virilio and the Potential Educational Impacts of Real-Time Strategy Videogames DAVID I. WADDINGTON Concordia University This essay explores the possibility that a particular type of video game—real-time strategy games—could have worrisome educational impacts. In order to make this case, I will develop a theoretical framework originally advanced by French social critic Paul Virilio. In two key texts, Speed and Politics (1977) and “The Aesthetics of Disappearance” (1984), Virilio maintains that society is becoming “dromocratic” – determined by and obsessed with speed. Extending Virilio’s analysis, I will argue that the frenetic, ruthless environment of real-time strategy games may promote an accelerated, hypermodern way of thinking about the world that focuses unduly on efficiency. Introduction Video games have been a subject of significant interest lately in education. A new wave of momentum began when James Paul Gee’s book, What Video Games Have to Teach Us About Learning and Literacy (2003a), was critically acclaimed, and was followed by a wave of optimistic studies and analyses. In 2010, a MacArthur Foundation report, The Civic Potential of Video Games, built on this energy, drawing on large-scale survey data to highlight the possibility that games that certain popular types of video games might promote civic engagement in the form of increased political participation and volunteerism. The hypothesis that video games, a perpetual parental bête-noire and the site of many a sex/violence media panic, might actually be educationally beneficial, has been gathering steam and is the preferred position of most educational researchers working in the field.
    [Show full text]
  • Identifying Players and Predicting Actions from RTS Game Replays
    Identifying Players and Predicting Actions from RTS Game Replays Christopher Ballinger, Siming Liu and Sushil J. Louis Abstract— This paper investigates the problem of identifying StarCraft II, seen in Figure 1, is one of the most popular a Real-Time Strategy game player and predicting what a player multi-player RTS games with professional player leagues and will do next based on previous actions in the game. Being able world wide tournaments [2]. In South Korea, there are thirty to recognize a player’s playing style and their strategies helps us learn the strengths and weaknesses of a specific player, devise two professional StarCraft II teams with top players making counter-strategies that beat the player, and eventually helps us six-figure salaries and the average professional gamer making to build better game AI. We use machine learning algorithms more than the average Korean [3]. StarCraft II’s popularity in the WEKA toolkit to learn how to identify a StarCraft II makes obtaining larges amounts of different combat scenarios player and predict the next move of the player from features for our research easier, as the players themselves create large extracted from game replays. However, StarCraft II does not have an interface that lets us get all game state information like databases of professional and amateur replays and make the BWAPI provides for StarCraft: Broodwar, so the features them freely available on the Internet [4]. However, unlike we can use are limited. Our results reveal that using a J48 StarCraft: Broodwar, which has the StarCraft: Brood War decision tree correctly identifies a specific player out of forty- API (BWAPI) to provide detailed game state information one players 75% of the time.
    [Show full text]
  • The Critical-Glossary
    The Critical-Glossary COPYRIGHT © 2007-2011, RICHARD TERRELL (KIRBYKID). ALL RIGHTS RESERVED. 1 Table of Contents #................................................................. 3 The Critical-Glossary is a collection of terms and definitions on game design. The A................................................................ 3 field of game design is vast. To sufficiently cover it this glossary includes terms from B................................................................ 5 other fields such as story design, educational C................................................................ 6 psychology, and neuroscience. I have also coined many terms as well as improved the D.............................................................. 11 definitions of many commonly used terms. E.............................................................. 13 The glossary is the product of four years of F .............................................................. 15 blogging and research at critical- gaming.squarespace.com. In addition to the G ............................................................. 17 definitions nearly every entry features a link to the blog article where I discuss the term H.............................................................. 18 in detail. Do visit these articles for I................................................................. 19 examples, images, videos, and interactive demos. J-K ........................................................ 20 All of the definitions in this document are L..............................................................
    [Show full text]
  • A Bayesian Model for RTS Units Control Applied to Starcraft Gabriel Synnaeve, Pierre Bessiere
    A Bayesian Model for RTS Units Control applied to StarCraft Gabriel Synnaeve, Pierre Bessiere To cite this version: Gabriel Synnaeve, Pierre Bessiere. A Bayesian Model for RTS Units Control applied to StarCraft. Computational Intelligence and Games, Aug 2011, Seoul, South Korea. pp.000. hal-00607281 HAL Id: hal-00607281 https://hal.archives-ouvertes.fr/hal-00607281 Submitted on 8 Jul 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. A Bayesian Model for RTS Units Control applied to StarCraft Gabriel Synnaeve ([email protected]) Pierre Bessiere` ([email protected]) Abstract—In real-time strategy games (RTS), the player must 24 surrounding tiles (see Figure 3, combination of N, S, E, W reason about high-level strategy and planning while having up to the 2nd order), stay where it is, attack, and sometimes effective tactics and even individual units micro-management. cast different spells: more than 26 possible actions each turn. Enabling an artificial agent to deal with such a task entails breaking down the complexity of this environment. For that, we Even if we consider only 8 possible directions, stay, and N propose to control units locally in the Bayesian sensory motor attack, with N units, there are 10 possible combinations robot fashion, with higher level orders integrated as perceptions.
    [Show full text]
  • Game Complexity Vs Strategic Depth
    Game Complexity vs Strategic Depth Matthew Stephenson, Diego Perez-Liebana, Mark Nelson, Ahmed Khalifa, and Alexander Zook The notion of complexity and strategic depth within games has been a long- debated topic with many unanswered questions. How exactly do you measure the complexity of a game? How do you quantify its strategic depth objectively? This seminar answered neither of these questions but instead presents the opinion that these properties are, for the most part, subjective to the human or agent that is playing them. What is complex or deep for one player may be simple or shallow for another. Despite this, determining generally applicable measures for estimating the complexity and depth of a given game (either independently or comparatively), relative to the abilities of a given player or player type, can provide several benefits for game designers and researchers. There are multiple possible ways of measuring the complexity or depth of a game, each of which is likely to give a different outcome. Lantz et al. propose that strategic depth is an objective, measurable property of a game, and that games with a large amount of strategic depth continually produce challenging problems even after many hours of play [1]. Snakes and ladders can be described as having no strategic depth, due to the fact that each player's choices (or lack thereof) have no impact on the game's outcome. Other similar (albeit subjective) evaluations are also possible for some games when comparing relative depth, such as comparing Tic-Tac-Toe against StarCraft. However, these comparative decisions are not always obvious and are often biased by personal preference.
    [Show full text]
  • ESPORTS a Guide for Public Libraries
    ESPORTS A Guide for Public Libraries 1 Contents Introduction…………….….……….………….…………3 Esports 101….……….….……….………….….….…….4 What Are Esports? Why Are Esports a Good Fit for Libraries? Esports & the Public Library……….…….…….………6 Making a Library Team Other Ways Libraries Can Interact with Video Games Partnerships….……………..…….……………….….….9 Local Partners North America Scholastic Esports Federation Technical Requirements…….………..….……….……10 Creating Internet Videos….…………….……….……12 Recording Editing Uploading IP & Privacy Considerations…………….…………….15 IP Considerations for Video Sharing Privacy A Note on ESRB Ratings Glossary………….……….……….……….……………18 Acknowledgements…….……….………..……………28 Further Reading….….……….…..………….……….…29 URLs……..……….….….……….……………………….30 2 Introduction In September 2019, Pottsboro Area Library in Pottsboro, TX, began an esports program funded by a IMLS grant. With ten new gaming computers and a vastly improved internet connection, Pottsboro Library has acted as a staging location for an esports team in association with Pottsboro High School, opening new hours on Saturdays for the team to practice in private. This collaboration also includes the esports club of nearby Austin College, whose students serve as mentors for the library’s club, and the North America Scholastic Esports Federation (NASEF), which has provided information and assistance in setting up the team to play in its high school league. In addition to being used by the team, four of the gaming computers are open for public use, which has attracted younger patrons to the library and provides new options for children and young adults in an area where internet access is otherwise extremely limited. This guide is intended for public libraries that are interested in esports or video games for any reason—to increase participation of young adults in library programming, to encourage technological skills and literacy, to provide a space for young people to gather and practice teamwork, etc.
    [Show full text]
  • Minimax AI Within Non-Deterministic Environments
    Minimax AI within Non-Deterministic Environments by Joe Dan Davenport, B.S. A Thesis In Computer Science Submitted to the Graduate Faculty Of Texas Tech University in Partial Fulfillment of The Requirements for The Degree of MASTER OF SCIENCE Approved Dr. Nelson J. Rushton Committee Chair Dr. Richard Watson Dr. Yuanlin Zhang Mark Sheridan, Ph.D. Dean of the Graduate School August, 2016 Copyright 2016, Joe Dan Davenport Texas Tech University, Joe Dan Davenport, August 2016 Acknowledgements There are a number of people who I owe my sincerest thanks for arriving at this point in my academic career: First and foremost I wish to thank God, without whom many doors that were opened to me would have remained closed. Dr. Nelson Rushton for his guidance both as a scientist and as a person, but even more so for believing in me enough to allow me to pursue my Master’s Degree when my grades didn’t represent that I should. I would also like to thank Dr. Richard Watson who originally enabled me to come to Texas Tech University and guided my path. I would also like to thank Joshua Archer, and Bryant Nelson, not only for their companionship, but also for their patience and willingness to listen to my random thoughts; as well as my manger, Eric Hybner, for bearing with me through this. Finally I would like to thank some very important people in my life. To my Mother, I thank you for telling me I could be whatever I wanted to be, and meaning it. To Israel Perez for always being there for all of us.
    [Show full text]