Perjalanan kuda: Perbedaan antara revisi
Konten dihapus Konten ditambahkan
Rescuing 5 sources and tagging 0 as dead.) #IABot (v2.0.8 |
k menambahkan pranala dalam |
||
| (5 revisi perantara oleh 2 pengguna tidak ditampilkan) | |||
Baris 2:
{{Hide in print|[[Berkas:Knights-Tour-Animation.gif|ka|jmpl|250px|Sebuah animasi Perjalanan Kuda pada sebuah papan 5x5.]]|[[Berkas:knightstour5x5.svg|ka|jmpl|250px|Sebuah perjalanan kuda terbuka pada sebuah papan 5x5.]]}}
'''Perjalanan kuda''' merupakan sebuah [[permainan]] menggunakan [[kuda (catur)|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 ==
* [[Abu-Bakr Muhammad
* [[George Koltanowski]]
Baris 15:
|last1=Thomasson
|url=http://www.borderschess.org/KnightTour.htm
|title=
|access-date=2013-12-06
|archive-date=2005-12-19
|archive-url=https://web.archive.org/web/20051219005826/http://www.borderschess.org/KnightTour.htm
|dead-url=yes
}}
* [http://www.mayhematics.com/t/t.htm Knight's tour notes]
Baris 21 ⟶ 25:
* {{OEIS|A001230}}
* [http://warnsdorff.com warnsdorff.com] - Page devoted to Warnsdorff's Rule
* [http://faculty.olin.edu/~sadams/DM/ktpaper.pdf Knight's Tours] {{Webarchive|url=https://web.archive.org/web/20120417053022/http://faculty.olin.edu/~sadams/DM/ktpaper.pdf |date=2012-04-17 }} by Ben Hill and Kevin Tostado
=== Implementasi ===
* [http://demonstrations.wolfram.com/TheKnightsTour/ The Knight's Tour] by Jay Warendorff, [[Wolfram Demonstrations Project]]
* {{cite web
|first1=Piyush |last1=Kumar
|url=http://www.compgeom.com/~piyush/teach/3330/homeworks/knightour.cpp
|title=
|access-date=2013-12-06
|archive-date=2013-11-14
|archive-url=https://web.archive.org/web/20131114171635/http://www.compgeom.com/~piyush/teach/3330/homeworks/knightour.cpp
|dead-url=yes
}}
* {{cite web
Baris 40 ⟶ 49:
|dead-url=yes
}}
* [http://www.bringhurst.org/2013/03/04/a-simple-recursive-knights-tour-written-in-about-35-lines-of-python.html An implementation in Python] {{Webarchive|url=https://web.archive.org/web/20131212081731/http://www.bringhurst.org/2013/03/04/a-simple-recursive-knights-tour-written-in-about-35-lines-of-python.html |date=2013-12-12 }}
* [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://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 }}
| |||