| Title: | Random Chess: Piece Strength; End Games; and Large Sparse Eigenvalue Problems. |
| Speaker: | Allan Struthers Professor Mathematical Sciences Michigan Technological University Houghton, Michigan |
| Abstract: | Chess books all include an assessment of the relative strength of pieces and a detailed analysis of various end game situations. Modern computer algebra systems make it easy to build transition matrices for random walks by various pieces on chess boards. The eigenvectors of these large sparse matrices quantify piece strength and provide interesting end-game information. The talk will provide all necessary background in both Chess and Linear Algebra. |
| Location: | Palenske 227 |
| Date: | 11/5/2015 |
| Time: | 3:30 PM |
@abstract{MCS:Colloquium:AllanStruthers:2015:11:5,
author = "{Allan Struthers}",
title = "{Random Chess: Piece Strength; End Games; and Large Sparse Eigenvalue Problems.}",
address = "{Albion College Mathematics and Computer Science Colloquium}",
month = "{5 November}",
year = "{2015}"
}