Filtering by
- All Subjects: Programming
- Creators: Computer Science and Engineering Program
- Creators: Davis, Jonathan
- Resource Type: Text
The Phoenix area, is known for suburban sprawl which did not happen in isolation but was the result of many external factors. It was not just large environmental and cultural factors that changed over time, but the actual physical characteristics of sprawl that have changed from community to community over the decades. Characteristics like physical size of houses and lot size, along with changes in the residential and commercial design and building style have changed from around the 1950s to present day, with homes being larger and covering more of each parcel. These characteristics were analyzed in 21 communities in the Phoenix area that were built from 1950 to 2019 to find how these characteristics have changed over time. While the issue of sprawl will never fully go away, by learning what the characteristics are that make up the definition of sprawl, stakeholders like cities, planners, and developers will have better knowledge for planning for tomorrow.
This paper explores the inner workings of algorithms that computers may use to play Chess. First, we discuss the classical Alpha-Beta algorithm and several improvements, including Quiescence Search, Transposition Tables, and more. Next, we examine the state-of-the-art Monte Carlo Tree Search algorithm and relevant optimizations. After that, we consider a recent algorithm that transforms Alpha-Beta into a “Rollout” search, blending it with Monte Carlo Tree Search under the rollout paradigm. We then discuss our C++ Chess Engine, Homura, and explain its implementation of a hybrid algorithm combining Alpha-Beta with MCTS. Finally, we show that Homura can play master-level Chess at a strength currently exceeding that of our backtracking Alpha-Beta.