Longest uncrossed knight's path
id:
longest-uncrossed-knight-s-path-272-11029884
title:
Longest uncrossed knight's path
text:
The longest uncrossed knight's path is a mathematical problem involving a knight on the standard 8×8 chessboard or, more generally, on a square n×n board. The problem is to find the longest path the knight can take on the given board, such that the path does not intersect itself. A further distinction can be made between a closed path, which ends on the same field as where it begins, and an open path, which ends on a different field from where it begins.
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical problem set on a chessboard
original url:
https://en.wikipedia.org/wiki/Longest_uncrossed_knight%27s_path
date created:
date modified:
2022-10-26T05:57:02Z
main entity:
{"identifier":"Q1634949","url":"https://www.wikidata.org/entity/Q1634949"}
image:
fields total:
13
integrity:
14