搜索结果: 1-1 共查到“数学 enumerating high-dimensional rook walks”相关记录1条 . 查询时间(0.062 秒)
The computational challenge of enumerating high-dimensional rook walks
The computational challenge enumerating high-dimensional rook walks
2010/11/24
We provide guessed recurrence equations for the counting sequences of rook paths on d-dimensional chess boards starting at (0..0) and ending at (n..n), where d=2,3,...,12. Our recurrences suggest refi...