Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!spool.mu.edu!uunet!abvax!iccgcc!schmidtg
From: schmidtg@iccgcc.decnet.ab.com
Newsgroups: comp.ai
Subject: Re: HI-Q game
Message-ID: <4424.281d4211@iccgcc.decnet.ab.com>
Date: 30 Apr 91 15:08:16 GMT
Article-I.D.: iccgcc.4424.281d4211
References: <1991Apr24.055054.16724@cunixf.cc.columbia.edu>
Lines: 24



I have written a program which solves the HI-Q puzzle in slightly less
than 3 seconds on my VaxStation 3100.  The program uses a STATE-SPACE
HEURISTIC SEARCH ALGORITHM which is essentially a breadth first search
guided by some path heuristics.  The algorithm is also known as the
A* ("A star") algorithm and may be found in many AI texts.  The art of
solving this puzzle is in finding good heuristics which estimate the
"cost" or number of moves to a solution from a given state.  I'd be
interested in hearing about other techniques which may be applicable
to solving this puzzle.  BTW, how does one obtain "MIT AI Memo 'Hakmem'
(Memo #239)?

-- 


=============================================================================
Greg Schmidt -> schmidtg@iccgcc.decnet.ab.com
=============================================================================
"People with nothing to hide have nothing to fear from O.B.I.T"
	-- Peter Lomax
-----------------------------------------------------------------------------
Disclaimer: No warranty is expressed or implied.  Void where prohibited.
=============================================================================