Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!Germany.EU.net!news.dfn.de!kfk.de!rz.uni-karlsruhe.de!darum.uni-mannheim.de!fht-mannheim!pc26.rz.fht-mannheim.de!85436
From: 85436@novell1.rz.fht-mannheim.de (HOLGERRATZELINFORMATIK)
Subject: AI problem: Blind/Uniformed search
Sender: news@roxi.rz.fht-mannheim.de (NEWS - system account)
Organization: Fachhochschule fuer Technik Mannheim
Date: Mon, 28 Nov 1994 11:20:07 GMT
Message-ID: <85436.3.786021607@novell1.rz.fht-mannheim.de>
Lines: 17
Lines: 17

Hello there,
I have a little problem:
I am searching for a LISP-program to solve the 'water-can'-problem.
'water-can'-problem means:
	You have a can with a volume A and another with a volume B, now you 
	should fill one with a volume C. But there are some restrictions:
	1.	You can only fill completely from the waterplug.
	2.	or empty a can completely into a sink.
	3. 	You can fill as much water from the first can into the second
		as there is free space in the second.

If there is anybody who has a LISP-program which solves this problem, please
mail it to: hora@freddy.rz.fht-mannheim.de .

many thanks

	Holger L. Ratzel
