Re: Proof of knight's tour in chess
- From: richard@xxxxxxxxxxxxxxx (Richard Tobin)
- Date: 12 Apr 2007 00:16:19 GMT
In article <1176316450.885052.250510@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
<peace__and__prosperity@xxxxxxxxxxx> wrote:
Thanks for the program, but I also am interested in an existence proof
that such a tour exists.
The output of a program that finds a tour *is* an existence proof.
-- Richard
--
"Consideration shall be given to the need for as many as 32 characters
in some alphabets" - X3.4, 1963.
.
- References:
- Proof of knight's tour in chess
- From: peace__and__prosperity
- Re: Proof of knight's tour in chess
- From: user923005
- Re: Proof of knight's tour in chess
- From: peace__and__prosperity
- Proof of knight's tour in chess
- Prev by Date: Re: question regarding diofantine equations
- Next by Date: Re: the male alpha problem in math and the sciences
- Previous by thread: Re: Proof of knight's tour in chess
- Next by thread: Download IIT JEE 2007 Question Paper solved
- Index(es):
Relevant Pages
|