Abstract
Using the knight's moves in the game of chess, the knight's distance is defined for the digital plane. Its functional form is presented. An algorithm is given for tracing a minimal knight's path. The properties of some related topological entities are explored. Finally, the knight's transform is defined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
