From news@nntp-server.caltech.edu Mon Feb 5 21:19:04 1996 Return-Path: Received: from gap (gap.cco.caltech.edu) by life.ai.mit.edu (4.1/AI-4.10) for /com/archive/cube-lovers id AA25371; Mon, 5 Feb 96 21:19:04 EST Received: by gap (SMI-8.6/DEI:4.45) id SAA28438; Mon, 5 Feb 1996 18:18:22 -0800 To: mlist-cube-lovers@nntp-server.caltech.edu Path: whuang From: whuang@cco.caltech.edu (Wei-Hwa Huang) Newsgroups: mlist.cube-lovers Subject: Re: Group/graph status? Date: 6 Feb 1996 02:18:21 GMT Organization: California Institute of Technology, Pasadena Lines: 13 Message-Id: <4f6dpd$rok@gap.cco.caltech.edu> References: <199602052319.AA10033@leibniz.cs.arizona.edu> Nntp-Posting-Host: accord.cco.caltech.edu X-Newsreader: NN version 6.5.0 #12 (NOV) "Richard Schroeppel" writes: >Has anyone tabulated the number of positions are reachable (from the >initial cube) in one move, two moves, etc.? Is the diameter of the >graph known? Well, the diameter of the graph would obviously be the upper bound of God's algorithm. -- Wei-Hwa Huang, whuang@cco.caltech.edu, http://www.ugcs.caltech.edu/~whuang/ --------------------------------------------------------------------------- Did you know Africa has more sand than the entire Sahara Desert?