Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!yeshua.marcam.com!usc!howland.reston.ans.net!EU.net!sun4nl!news.nic.surfnet.nl!spider.research.ptt.nl!sun031!liempd
From: liempd@sun031.research.ptt.nl (Gidi van Liempd)
Subject: any work known on predicting solution lengths?
Message-ID: <1994Aug31.092936.15486@news.research.ptt.nl>
Keywords: search prediction N*N-puzzle
Sender: liempd@sun031 (Gidi van Liempd)
Nntp-Posting-Host: sun031.research.ptt.nl
Organization: PTT Research, Groningen, The Netherlands
Date: Wed, 31 Aug 1994 09:29:36 GMT
Lines: 20

L.S.,

I am cureently doing some work on the prediction of solution lengths,
in particular for the N*N-puzzle (aka 8-puzzle, 15-puzzle, etc.).
Also, I try to make some statements on what the hardest instances
for this puzzle are.

I do not seem to be able to find much related work on this. Or is it just
too obvious and been done years ago? 
Any help in locating good pointers will be appreciated.

Greetings,

Gidi van Liempd

-- 
*******************************************************************************
*	Gidi "GD" van Liempd		*	PTT Research, P.O. Box 15000, *
*	E.P.M.vanliempd@research.ptt.nl *	9700 CD Groningen, 	      *
*	tel. +31 50 821055		*	The Netherlands		      *	
