Author(s) Information

Christopher D. PetersonFollow

College

College of Engineering

Department

Computer Engineering Department

Degree Name

BS in Computer Engineering

Date

6-2018

Advisor(s)

Xiao-Hua (Helen) Yu

Abstract/Summary

Modern chess engines have the ability to augment their evaluation by using massive tables containing billions of positions and their memorized solutions. This report examines the importance of these tables to better understand the circumstances under which they should be used. The analysis conducted in this paper empirically examines differences in size and speed of memorized positions and their impacts on engine strength. Using this technique, situations where memorized tables improve play (and situations where they do not) are discovered.

Available for download on Tuesday, June 11, 2019

Share

COinS