Home›Chess problems›Bài toán mã đi tuần🌐Tiếng ViệtEnglishBahasa IndonesiaDeutschEspañolFrançaisItalianoNederlandsPolskiPortuguêsTiếng ViệtTürkçeРусскийالعربيةفارسیहिन्दीไทย한국어中文日本語EntityQ12524· pop 35· linked from 62 articlesBài toán mã đi tuầnsequence of moves of a knight on a chessboard to visit each square exactly onceWikidata factsImageThomasson symmetric closed knights tour.svgShow 1 more factCommons categoryKnight's ToursSources (1)wikidata.orgvia Wikidata · CC0Available in 34 languagesEspañolFrançaisDeutsch中文日本語РусскийPortuguêsItalianoالعربيةहिन्दीConnectionstime complexityEntityHamiltonian path problemEntityCategoriesChess problemsGraph algorithmsHamiltonian paths and cyclesMathematical chess problemsMathematical problems