Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!spool.mu.edu!uunet!mcsun!ub4b!kulcs!icarus.cs.kuleuven.ac.be
From: bimandre@icarus.cs.kuleuven.ac.be (Andre Marien)
Newsgroups: comp.theory
Subject: Re: Partitioning squares into unequal squares
Message-ID: <3637@n-kulcs.cs.kuleuven.ac.be>
Date: 30 May 91 14:53:59 GMT
Article-I.D.: n-kulcs.3637
References: <9105242046.AA15308@athos.cs.ua.edu>
Sender: news@cs.kuleuven.ac.be
Organization: Dept. of Computer Science (K.U.Leuven)
Lines: 12
Originator: bimandre@icarus

The prolog system of A. Colmerauer, Prolog III, uses this as a showcase:
fill some rectangle with some (!=) squares
and comes up with only two solutions. The first is for a 33 /32 rectangle:

	9	10	14
	       1
	8	7	4
	15		18

I don't have the other one handy.

Andre' Marien