Re: Distinct distances on a chessboard
- From: jankrihau@xxxxxxxxxxx
- Date: 31 Mar 2007 11:10:08 -0700
On 31 Mar, 19:38, "John Gabbriel" <johngabbr...@xxxxxxxxx> wrote:
Are you confident?
Yes. :-)
Is there a proof which does not enumerate all the 8x8 cases?
I don't know, but possibly, as there are only 33 possible distances.
For larger grids, I was hoping someone had references - surely this
has been studied before?
---
J K Haugland
http://home.no.net/zamunda
.
- References:
- Distinct distances on a chessboard
- From: John Gabbriel
- Re: Distinct distances on a chessboard
- From: jankrihau
- Re: Distinct distances on a chessboard
- From: John Gabbriel
- Distinct distances on a chessboard
- Prev by Date: Re: Distinct distances on a chessboard
- Next by Date: Re: Learning CRT
- Previous by thread: Re: Distinct distances on a chessboard
- Next by thread: iterate n[k+1] = n[k] + sin(n[k])
- Index(es):
Relevant Pages
|
|