## Multilinear Algebra and Chess Endgames (1996)

### Cached

### Download Links

Venue: | of No Chance: Combinatorial Games at MRSI |

Citations: | 3 - 0 self |

### BibTeX

@INPROCEEDINGS{Stiller96multilinearalgebra,

author = {Lewis Stiller},

title = {Multilinear Algebra and Chess Endgames},

booktitle = {of No Chance: Combinatorial Games at MRSI},

year = {1996},

pages = {151--192},

publisher = {University Press}

}

### OpenURL

### Abstract

Abstract. This article has three chief aims: (1) To show the wide utility of multilinear algebraic formalism for high-performance computing. (2) To describe an application of this formalism in the analysis of chess endgames, and results obtained thereby that would have been impossible to compute using earlier techniques, including a win requiring a record 243 moves. (3) To contribute to the study of the history of chess endgames, by focusing on the work of Friedrich Amelung (in particular his apparently lost analysis of certain six-piece endgames) and that of Theodor Molien, one of the founders of modern group representation theory and the first person to have systematically numerically analyzed a pawnless endgame. 1.