Changes

Jump to: navigation, search

All Shortest Paths

22 bytes added, 16:43, 13 March 2021
no edit summary
<span id="Optimization"></span>
=Optimization=
[[Edmund Moshammer]] proposed following optimization with an inlined king fill routine <ref>[https://web.archive.org/web/20180820110255/http://chessprogramming.wikispaces.com/messageshare/view/All+Shortest+Paths/11449287 Discussion about this page]</ref>:
<pre>
// Set all up to eight neighbours

Navigation menu