Henry E. Dudeney的星星谜题的反例

Q3 Mathematics

Matematychni Studii Pub Date : 2021-12-27 DOI:10.30970/ms.56.2.215-217

A. Ravsky

{"title":"Henry E. Dudeney的星星谜题的反例","authors":"A. Ravsky","doi":"10.30970/ms.56.2.215-217","DOIUrl":null,"url":null,"abstract":"We found a solution of Henry E. Dudeney’s star puzzle (a path on a chessboard from c5 to d4 in 14 straight strokes) in 14 queen moves, which was claimed impossible by the puzzle author. Generalizing this result to other board sizes, we obtained bounds on minimal number of moves in a board filling queen path with given source and destination.","PeriodicalId":37555,"journal":{"name":"Matematychni Studii","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A counterexample to Henry E. Dudeney’s star puzzle\",\"authors\":\"A. Ravsky\",\"doi\":\"10.30970/ms.56.2.215-217\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We found a solution of Henry E. Dudeney’s star puzzle (a path on a chessboard from c5 to d4 in 14 straight strokes) in 14 queen moves, which was claimed impossible by the puzzle author. Generalizing this result to other board sizes, we obtained bounds on minimal number of moves in a board filling queen path with given source and destination.\",\"PeriodicalId\":37555,\"journal\":{\"name\":\"Matematychni Studii\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Matematychni Studii\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30970/ms.56.2.215-217\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Matematychni Studii","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30970/ms.56.2.215-217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

我们找到了亨利·E·杜德尼的星形拼图（棋盘上从c5到d4的路径，用14个直拍）的14个皇后招式的解决方案，拼图作者声称这是不可能的。将这一结果推广到其他棋盘尺寸，我们获得了在给定源和目的地的棋盘填充皇后路径中最小移动次数的界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A counterexample to Henry E. Dudeney’s star puzzle

We found a solution of Henry E. Dudeney’s star puzzle (a path on a chessboard from c5 to d4 in 14 straight strokes) in 14 queen moves, which was claimed impossible by the puzzle author. Generalizing this result to other board sizes, we obtained bounds on minimal number of moves in a board filling queen path with given source and destination.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Matematychni Studii Mathematics-Mathematics (all)

CiteScore

1.00

自引率

0.00%

发文量

期刊介绍： Journal is devoted to research in all fields of mathematics.