From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: a07f3367d7,af4868d4b196fa50
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,ASCII-7-bit
X-Received: by 10.224.88.200 with SMTP id b8mr45142589qam.8.1367317769033;
        Tue, 30 Apr 2013 03:29:29 -0700 (PDT)
X-Received: by 10.49.129.233 with SMTP id nz9mr1704990qeb.10.1367317769000;
 Tue, 30 Apr 2013 03:29:29 -0700 (PDT)
Path: 
 ef9ni36305qab.0!nntp.google.com!s14no1151617qam.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Tue, 30 Apr 2013 03:29:28 -0700 (PDT)
In-Reply-To: <517f7917$0$9507$9b4e6d93@newsspool1.arcor-online.net>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=134.240.94.19;
 posting-account=CZZpzgoAAAAoaHoNNp9zhY9EzQgEmxhU
NNTP-Posting-Host: 134.240.94.19
References: <6c3bb45c-6cb1-4609-9c3f-c3f01c545eac@googlegroups.com>
 <517f7917$0$9507$9b4e6d93@newsspool1.arcor-online.net>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <e1f60b93-f67a-45dc-bc88-802fa8bfdadb@googlegroups.com>
Subject: Re: Breadth First Search Missionaries and Cannibals
From: Alex <willmann817@gmail.com>
Injection-Date: Tue, 30 Apr 2013 10:29:29 +0000
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Date: 2013-04-30T03:29:28-07:00
List-Id: <comp.lang.ada>

On Tuesday, April 30, 2013 3:56:17 AM UTC-4, Georg Bauhaus wrote:
> On 30.04.13 04:48, Alex wrote:
>=20
> > Given the following Function signature how would I go about using bread=
th first search to find out the minimum number of trips it would take to ge=
t all the missionaries and cannibals across the river. *MUST USE BREADTH FI=
RST SEARCH* If you are not familiar with the problem see the wiki page here=
 :
>=20
> >
>=20
> > http://en.wikipedia.org/wiki/Missionaries_and_cannibals_problem
>=20
> >
>=20
> > The only difference between the problem in the wiki article is in this =
one the number of missionaries and cannibals and the number of people the b=
oat can hold can change.
>=20
> >
>=20
> > M is missionaries, C is cannibals and R is the number of people you can=
 fit in the boat.
>=20
> >
>=20
> >     function Min_Crossings(M, C, R : Integer) return Integer is
>=20
> >        -- you can assume M, C, and R are all >=3D 2 and C <=3D M
>=20
>=20
>=20
> While this does not address the combinatorial part, if modern IT
>=20
> is permitted to be built atop vague, implementation defined
>=20
> types stuck in the 1970s (Integer), why not boldly move on to the
>=20
> 1980s and turn the assumption "all are >=3D 2" into a rock solid type?
>=20
>=20
>=20
>     type Entity_Count is range 2 .. Max_Possible_Number;
>=20
>=20
>=20
>     function Min_Crossings(M, C, R : Entity_Count) return ...
>=20
>=20
>=20
> If the suffix of Entitiy_Count hides too much information ("Is this an in=
t,
>=20
> actually?") in the context of an algorithmic exercise, you could call it
>=20
> Entity_int.

I do not know the answer to your question.