Comments on: Knight's Tours Using a Neural Network

By: Michael

Michael — Wed, 04 Jan 2012 04:55:38 +0000

Hey I would like to use your source code for a project. Apparently you would like to keep track of who uses your code, so could you please email me the credentials needed to download it? This would be very much appreciated!

P.S. This is a very cool program!

By: alphachap

alphachap — Wed, 29 Dec 2010 02:13:32 +0000

I tried the downloaded application, but got access violation at address .. in module 'KERNELBASE.dll' ..
Had to do Ctrl-Alt-Del to stop the process.

By: alphachap

alphachap — Wed, 29 Dec 2010 02:04:59 +0000

Any bigger image of that 28x28?

By: gdv

gdv — Thu, 21 May 2009 02:17:15 +0000

@Dany... ...I just found this blog today and was perusing several of the entries and comments. FYI, I found the Knight's Tours Neural Network code at http://svn.dmitrybrant.com/newapps/Knights/ (after finding the code for Dmitry's CodeFinder at http://svn.dmitrybrant.com/newapps/CodeFinder/ and checking the parent http://svn.dmitrybrant.com/newapps/).

@db... ...enjoyed perusing your blog!!!

By: Dany

Dany — Thu, 05 Mar 2009 13:45:37 +0000

May you please share the user and pass so we can check the code?
Regards.

By: One heck of ... - CodeCall Programming Forum

One heck of ... - CodeCall Programming Forum — Sun, 01 Feb 2009 18:05:16 +0000

[...] this brilliant ! I am amazed by people doing such simple things that are also rather advanced ! DmitryBrant.com � Knight’s Tours Using a Neural Network Check out and be amazed, I would say C++ users would like it __________________ Think, feel, [...]

By: kk

kk — Sun, 12 Oct 2008 05:53:53 +0000

Password required for source?

By: db

db — Thu, 07 Aug 2008 15:51:13 +0000

Ha! So it does find a "solution" for a 3×3 board... I guess I never tested that case. I'll have to limit the width and height to 4, then!

By: Pierre Charland

Pierre Charland — Wed, 06 Aug 2008 22:10:24 +0000

Try the program on a 3x3.
It find an hamiltonian path!
(wrong since the center cell is unattainable)

By: Pierre Charland

Pierre Charland — Wed, 06 Aug 2008 12:05:37 +0000

Interesting program!
It would be nice if it could stop at each solution (or save each solution), and if it could tell the number of close loops. May be each loop could be of a different color.
(if I set the #trials to 1000 or more, it does only one trial)