Perjalanan kuda: Perbedaan antara revisi
Konten dihapus Konten ditambahkan
Rescuing 5 sources and tagging 0 as dead.) #IABot (v2.0.8 |
Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.8 |
||
| Baris 41: | Baris 41: | ||
}} |
}} |
||
* [http://www.bringhurst.org/2013/03/04/a-simple-recursive-knights-tour-written-in-about-35-lines-of-python.html An implementation in Python] |
* [http://www.bringhurst.org/2013/03/04/a-simple-recursive-knights-tour-written-in-about-35-lines-of-python.html An implementation in Python] |
||
* [http://www.knightstour.co.uk An implementation in C#] |
* [http://www.knightstour.co.uk An implementation in C#] {{Webarchive|url=https://web.archive.org/web/20170926064233/http://knightstour.co.uk/ |date=2017-09-26 }} |
||
* [http://dmitrybrant.com/knights-tour Knight's Tours Using a Neural Network] Program that creates tours using a neural network, plus gallery of images. |
* [http://dmitrybrant.com/knights-tour Knight's Tours Using a Neural Network] Program that creates tours using a neural network, plus gallery of images. |
||
* [http://www.brainbashers.com/knight An interactive version in JavaScript] {{Webarchive|url=https://web.archive.org/web/20160305173050/http://brainbashers.com/knight |date=2016-03-05 }} |
* [http://www.brainbashers.com/knight An interactive version in JavaScript] {{Webarchive|url=https://web.archive.org/web/20160305173050/http://brainbashers.com/knight |date=2016-03-05 }} |
||
Revisi per 4 April 2021 03.16
Perjalanan kuda merupakan sebuah permainan menggunakan bidak kuda dengan cara melewati seluruh kotak yang ada tanpa melewati kotak tersebut 2 (dua) kali pada sebuah papan catur. Permainan selesai ketika seluruh kotak pada papan catur sudah dilewati oleh bidak kuda.
Lihat pula
Pranala luar
Wikimedia Commons memiliki media mengenai Knight's Tours.
- Warnsdorff's Rule and its efficiency from Warnsdorff's Rule Web Page
- Thomasson, Dan. "The knight's tour".
- Knight's tour notes
- Knight's Tour Flash Game
- (barisan A001230 pada OEIS)
- warnsdorff.com - Page devoted to Warnsdorff's Rule
- Knight's Tours by Ben Hill and Kevin Tostado
Implementasi
- The Knight's Tour by Jay Warendorff, Wolfram Demonstrations Project
- Kumar, Piyush. "A Simple backtracking implementation in C++".
- Horsell, Kym. "A Simple implementation in standard Prolog". Diarsipkan dari versi asli tanggal 2012-03-09. Diakses tanggal 2013-12-06.
- An implementation in Python
- An implementation in C# Diarsipkan 2017-09-26 di Wayback Machine.
- Knight's Tours Using a Neural Network Program that creates tours using a neural network, plus gallery of images.
- An interactive version in JavaScript Diarsipkan 2016-03-05 di Wayback Machine.
- Knight's Tour in form of jQuery plugin
- Knight Raid for OS Android
- An implementation in Scala Diarsipkan 2013-07-13 di Wayback Machine.
- An implementation in BBC BASIC