Chapter 4: revamping the puzzles in 4.3.2 to avoid copyright issues (#670)

* revamping all puzzles to avoid copyright issues * cy should do state * julie 8/11 * Converted LaTeX quotes to XML and added a missing space in '``Functions''chapter' Co-authored-by: Tobias Wrigstad <tobias.wrigstad@it.uu.se>

Author: martin-henz

xml/chapter4/section3/subsection2.xml

@@ -24,22 +24,36 @@
  <INDEX>nondeterministic programs<SUBINDEX>logic puzzles<OPEN/></SUBINDEX></INDEX>
 
  <TEXT>
- The following puzzle (taken from
+ The following puzzle (adapted from
  <INDEX>Dinesman, Howard P.</INDEX>
  <CITATION>Dinesman 1968</CITATION>) 
  is typical of a large class of simple logic puzzles:
  <BLOCKQUOTE>
+ The software company
+ <INDEX>Microshaft</INDEX>
+ Microshaft is expanding, and Alyssa, Ben, Cy, Lem, and Louis
+ are moving into a row of five private offices in a
+ new building. Alyssa does not move into the last office. Ben does not
+ move into the first office. Cy takes neither the first nor the last office.
+ Lem moves into an office after Ben's. Louis's office is not next to
+ Cy's. Cy's office is not next to Ben's. Who moves into which office?
+ <!--
+ Baker => Alyssa
+ Cooper => Ben
+ Fletcher => Cy
+ Miller => Lem
+ Smith => Louis
  Baker, Cooper, Fletcher, Miller, and Smith live on different floors of
  an apartment house that contains only five floors. Baker does not
  live on the top floor. Cooper does not live on the bottom floor.
  Fletcher does not live on either the top or the bottom floor. Miller
  lives on a higher floor than does Cooper. Smith does not live on a
  floor adjacent to Fletcher<APOS/>s. Fletcher does not live on a floor
- adjacent to Cooper<APOS/>s. Where does everyone live?
+ adjacent to Cooper<APOS/>s. Where does everyone live? -->
  </BLOCKQUOTE>
  </TEXT>
  <TEXT>
- We can determine who lives on each floor in a straightforward way by
+ We can determine who moves into which office in a straightforward way by
  enumerating all the possibilities and imposing the given
  restrictions:<FOOTNOTE>Our program uses the following
  <SPLITINLINE>
@@ -88,11 +102,11 @@ function distinct(items) {
  </SCHEME>
  </SPLITINLINE></FOOTNOTE>
  <SNIPPET CHAP="3" VARIANT="non-det">
- <INDEX><DECLARATION>multiple_dwelling</DECLARATION></INDEX> 
- <NAME>multiple_dwelling</NAME>
+ <INDEX><DECLARATION>office_move</DECLARATION></INDEX>
+ <NAME>office_move</NAME>
  <REQUIRES>distinct</REQUIRES>
- <EXAMPLE>multiple_dwelling_example</EXAMPLE>
- <EXPECTED>[ 'baker', [ 3, null ] ]</EXPECTED> 
+ <EXAMPLE>office_move_example</EXAMPLE>
+ <EXPECTED>[ 'alyssa', [ 3, null ] ]</EXPECTED>
  <SCHEME>
 (define (multiple-dwelling)
  (let ((baker (amb 1 2 3 4 5))
@@ -116,38 +130,38 @@ function distinct(items) {
  (list 'smith smith))))
  </SCHEME>
  <JAVASCRIPT>
-function multiple_dwelling() {
- const baker = amb(1, 2, 3, 4, 5);
- const cooper = amb(1, 2, 3, 4, 5);
- const fletcher = amb(1, 2, 3, 4, 5);
- const miller = amb(1, 2, 3, 4, 5);
- const smith = amb(1, 2, 3, 4, 5);
- require(distinct(list(baker, cooper, fletcher, miller, smith)));
- require(baker !== 5);
- require(cooper !== 1);
- require(fletcher !== 5);
- require(fletcher !== 1);
- require(miller &gt; cooper);
- require(math_abs(smith - fletcher) !== 1);
- require(math_abs(fletcher - cooper) !== 1);
- return list(list("baker", baker),
- list("cooper", cooper),
- list("fletcher", fletcher),
- list("miller", miller),
- list("smith", smith));
+function office_move() {
+ const alyssa = amb(1, 2, 3, 4, 5);
+ const ben = amb(1, 2, 3, 4, 5);
+ const cy = amb(1, 2, 3, 4, 5);
+ const lem = amb(1, 2, 3, 4, 5);
+ const louis = amb(1, 2, 3, 4, 5);
+ require(distinct(list(alyssa, ben, cy, lem, louis)));
+ require(alyssa !== 5);
+ require(ben !== 1);
+ require(cy !== 5);
+ require(cy !== 1);
+ require(lem &gt; ben);
+ require(math_abs(louis - cy) !== 1);
+ require(math_abs(cy - ben) !== 1);
+ return list(list("alyssa", alyssa),
+ list("ben", ben),
+ list("cy", cy),
+ list("lem", lem),
+ list("louis", louis));
 }
  </JAVASCRIPT>
  </SNIPPET>
  <SNIPPET HIDE="yes">
- <NAME>multiple_dwelling_example</NAME>
+ <NAME>office_move_example</NAME>
  <SCHEME>
 (multiple-dwelling)
  </SCHEME>
  <JAVASCRIPT>
-multiple_dwelling(); 
+office_move();
  </JAVASCRIPT>
  <JAVASCRIPT_TEST>
-head(multiple_dwelling());
+head(office_move());
  </JAVASCRIPT_TEST>
  </SNIPPET>
  </TEXT>
@@ -156,7 +170,7 @@ head(multiple_dwelling());
  Evaluating the expression
  <SPLITINLINE><SCHEME><SCHEMEINLINE>(multiple-dwelling)</SCHEMEINLINE>
  </SCHEME>
- <JAVASCRIPT><JAVASCRIPTINLINE>multiple_dwelling()</JAVASCRIPTINLINE>
+ <JAVASCRIPT><JAVASCRIPTINLINE>office_move()</JAVASCRIPTINLINE>
  </JAVASCRIPT>
  </SPLITINLINE>
  produces the result
@@ -165,8 +179,8 @@ head(multiple_dwelling());
 ((baker 3) (cooper 2) (fletcher 4) (miller 5) (smith 1))
  </SCHEME>
  <JAVASCRIPT>
-list(list("baker", 3), list("cooper", 2), list("fletcher", 4),
- list("miller", 5), list("smith", 1))
+list(list("alyssa", 3), list("ben", 2), list("cy", 4),
+ list("lem", 5), list("louis", 1))
  </JAVASCRIPT>
  </SNIPPET>
  Although this simple
@@ -175,27 +189,27 @@ list(list("baker", 3), list("cooper", 2), list("fletcher", 4),
  <JAVASCRIPT>function</JAVASCRIPT>
  </SPLITINLINE>
  works, it is very slow.
- Exercises<SPACE/><REF NAME="ex:better-multiple-dwelling1"/>
- and<SPACE/><REF NAME="ex:better-multiple-dwelling2"/> discuss some possible
+ Exercises<SPACE/><REF NAME="ex:better-office-move1"/>
+ and<SPACE/><REF NAME="ex:better-office-move2"/> discuss some possible
  improvements.
 
  <INDEX>nondeterministic programs<SUBINDEX>logic puzzles<CLOSE/></SUBINDEX></INDEX>
  </TEXT>
 
  <EXERCISE>
- <LABEL NAME="ex:multiple_dwelling_1"/>
- Modify the multiple-dwelling
+ <LABEL NAME="ex:office_move_1"/>
+ Modify the office-move
  <SPLITINLINE>
  <SCHEME>procedure</SCHEME>
  <JAVASCRIPT>function</JAVASCRIPT>
  </SPLITINLINE>
- to omit the requirement that Smith and Fletcher do not live on adjacent
- floors. How many solutions are there to this modified puzzle?
+ to omit the requirement that Louis's office is not next to Cy's.
+ How many solutions are there to this modified puzzle?
  </EXERCISE>
 
  <EXERCISE>
- <LABEL NAME="ex:better-multiple-dwelling1"/>
- Does the order of the restrictions in the multiple-dwelling
+ <LABEL NAME="ex:better-office-move1"/>
+ Does the order of the restrictions in the office-move
  <SPLITINLINE>
  <SCHEME>procedure</SCHEME>
  <JAVASCRIPT>function</JAVASCRIPT>
@@ -207,18 +221,18 @@ list(list("baker", 3), list("cooper", 2), list("fletcher", 4),
  </EXERCISE>
 
  <EXERCISE>
- <LABEL NAME="ex:better-multiple-dwelling2"/>
- In the multiple dwelling problem, how many sets of assignments are
- there of people to floors, both before and after the requirement that
- floor assignments be distinct? It is very inefficient to generate all
- possible assignments of people to floors and then leave it to
+ <LABEL NAME="ex:better-office-move2"/>
+ In the office move problem, how many sets of assignments are
+ there of people to offices, both before and after the requirement that
+ office assignments be distinct? It is very inefficient to generate all
+ possible assignments of people to offices and then leave it to
  backtracking to eliminate them. For example, most of the restrictions
- depend on only one or two of the person-floor
+ depend on only one or two of the person-office
  <SPLITINLINE>
  <SCHEME>variables,</SCHEME>
  <JAVASCRIPT>names,</JAVASCRIPT>
  </SPLITINLINE>
- and can thus be imposed before floors have been selected for all the people.
+ and can thus be imposed before offices have been selected for all the people.
  Write and demonstrate a much more efficient nondeterministic
  <SPLITINLINE>
  <SCHEME>procedure</SCHEME>
@@ -235,22 +249,57 @@ list(list("baker", 3), list("cooper", 2), list("fletcher", 4),
  </EXERCISE>
 
  <EXERCISE>
- <LABEL NAME="ex:multiple_dwelling_4"/>
+ <LABEL NAME="ex:office_move_4"/>
  Write an ordinary
  <INDEX>nondeterministic programming vs.<SPACE/>JavaScript programming</INDEX>
  <SPLITINLINE>
  <SCHEME>Scheme</SCHEME>
  <JAVASCRIPT>JavaScript</JAVASCRIPT>
  </SPLITINLINE>
- program to solve the multiple dwelling puzzle.
+ program to solve the office move puzzle.
  </EXERCISE>
 
  <EXERCISE>
  <LABEL NAME="ex:liars"/>
- Solve the following <QUOTE>Liars</QUOTE> puzzle (from
+ Solve the following <QUOTE>Liars</QUOTE> puzzle (adapted from
  <INDEX>Phillips, Hubert</INDEX>
  <CITATION>Phillips 1934</CITATION>):
  <BLOCKQUOTE>
+ Alyssa, Cy, Eva, Lem, and Louis meet for a business lunch at SoSoService.
+ Their meals arrive one after the other, a considerable time after they
+ placed their orders. To entertain Ben, who expects them back at the office
+ for a meeting, they decide to each make one true statement and one false
+ statement about their orders:
+ <UL>
+<LI>
+ Alyssa:
+ <QUOTE>Lem's meal arrived second. Mine arrived third.</QUOTE>
+</LI>
+<LI>
+ Cy:
+ <QUOTE>Mine arrived first. Eva's arrived second.</QUOTE>
+</LI>
+<LI>
+ Eva:
+ <QUOTE>Mine arrived third, and poor Cy's arrived last.</QUOTE>
+</LI>
+<LI>
+ Lem:
+ <QUOTE>Mine arrived second. Louis's arrived fourth.</QUOTE>
+</LI>
+<LI>
+ Louis:
+ <QUOTE>Mine arrived fourth. Alyssa's meal arrived first.</QUOTE>
+</LI>
+ </UL>
+ What was the real order in which the five diners received their meals?
+ <!--
+ Betty => Alyssa
+ Ethel => Cy
+ Joan => Eva
+ Kitty => Lem
+ Mary => Louis
+
  Five schoolgirls sat for an examination. Their parents<EMDASH/>so they
  thought<EMDASH/>showed an undue degree of interest in the result. They
  therefore agreed that, in writing home about the examination, each 
@@ -276,31 +325,67 @@ list(list("baker", 3), list("cooper", 2), list("fletcher", 4),
  Mary: <QUOTE>I was fourth. Top place was taken by Betty.</QUOTE>
 </LI>
  </UL>
- What in fact was the order in which the five girls were placed?
+ What in fact was the order in which the five girls were placed? -->
  </BLOCKQUOTE>
  </EXERCISE>
 
  <EXERCISE>
- <LABEL NAME="ex:yacht"/>
+ <LABEL NAME="ex:checking"/>
  Use the <SCHEMEINLINE>amb</SCHEMEINLINE> evaluator to solve the following
- puzzle:<FOOTNOTE>This is taken from a booklet called <QUOTE>Problematical
- Recreations,</QUOTE> published in the 1960s by Litton Industries, where it
- is attributed to the <EM>Kansas State Engineer</EM>.</FOOTNOTE>
- <BLOCKQUOTE>
- Mary Ann Moore<APOS/>s father has a yacht and so has each of his four
- friends: Colonel Downing, Mr.<SPACE/>Hall, Sir Barnacle Hood, and
- Dr.<SPACE/>Parker.
- Each of the five also has one daughter and each has named his
- yacht after a daughter of one of the others. Sir Barnacle<APOS/>s yacht is
- the Gabrielle, Mr.<SPACE/>Moore owns the Lorna; Mr.<SPACE/>Hall the Rosalind. The
- Melissa, owned by Colonel Downing, is named after Sir Barnacle<APOS/>s
- daughter. Gabrielle<APOS/>s father owns the yacht that is named after
- Dr.<SPACE/>Parker<APOS/>s daughter. Who is Lorna<APOS/>s father?
- </BLOCKQUOTE>
- Try to write the program so that it runs efficiently (see
- exercise<SPACE/><REF NAME="ex:better-multiple-dwelling2"/>). Also determine
- how many solutions there are if we are not told that Mary Ann<APOS/>s last
- name is Moore.
+ puzzle (adapted from
+ <INDEX>Phillips, Hubert</INDEX>
+ <CITATION>Phillips 1961</CITATION>):
+ <BLOCKQUOTE>
+Alyssa, Ben, Cy, Eva, and Louis each pick a different chapter of SICP JS
+and solve all the exercises in that chapter.
+Louis solves the exercises in the <QUOTE>Functions</QUOTE> chapter,
+Alyssa the ones in the <QUOTE>Data</QUOTE> chapter, and
+Cy the ones in the <QUOTE>State</QUOTE> chapter.
+They decide to check each other's work, and
+Alyssa volunteers to check the exercises in the <QUOTE>Meta</QUOTE> chapter.
+The exercises in the <QUOTE>Register Machines</QUOTE> chapter are solved by Ben
+and checked by Louis.
+The person who checks the exercises in the <QUOTE>Functions</QUOTE> chapter
+solves the exercises that are checked by Eva.
+Who checks the exercises in the	<QUOTE>Data</QUOTE> chapter?
+ </BLOCKQUOTE>
+ Try to write the program so that it runs efficiently (see
+ exercise<SPACE/><REF NAME="ex:better-office-move2"/>). Also determine
+ how many solutions there are if we are not told that Alyssa checks the
+ exercises in the <QUOTE>Meta</QUOTE> chapter.
+ <!-- <BLOCKQUOTE>
+ A father x owning a yacht called y.
+ =>
+ A person x solving the exercises in chapter y.
+
+ A father x having a daughter called y.
+ =>
+ A person x checking the exercises in chapter y.
+
+ Moore => Alyssa! Mary Ann => Meta!
+ Sir Barnacle Hood => Louis! Gabrielle => Functions!
+ Hall => Cy! Lorna => Data!
+ Downing => Ben! Rosalind => State!
+ Parker => Eva! Melissa => Register Machines!
+
+ Mary Ann Moore<APOS/>s father has a yacht and so has each of his four
+ friends: Colonel Downing, Mr.<SPACE/>Hall, Sir Barnacle Hood, and
+ Dr.<SPACE/>Parker.
+ Each of the five also has one daughter and each has named his
+ yacht after a daughter of one of the others.
+ Sir Barnacle<APOS/>s yacht is the Gabrielle,
+ Mr.<SPACE/>Moore owns the Lorna;
+ Mr.<SPACE/>Hall the Rosalind.
+ The Melissa, owned by Colonel Downing,
+ is named after Sir Barnacle<APOS/>s daughter.
+ Gabrielle<APOS/>s father owns the yacht that is named after
+ Dr.<SPACE/>Parker<APOS/>s daughter.
+ Who is Lorna<APOS/>s father?
+ </BLOCKQUOTE>
+ Try to write the program so that it runs efficiently (see
+ exercise<SPACE/><REF NAME="ex:better-office-move2"/>). Also determine
+ how many solutions there are if we are not told that Mary Ann<APOS/>s last
+ name is Moore. -->
  </EXERCISE>
 
  <INDEX>puzzles<SUBINDEX>logic puzzles<CLOSE/></SUBINDEX></INDEX>

xml/others/97references97.xml

@@ -374,6 +374,9 @@ language. 11th edition, edited by Jordan Harband. <EM>Ecma International.</EM><
  <REFERENCE>Phillips, Hubert. 1934. <EM>The Sphinx Problem Book</EM>. London: Faber
  and Faber.</REFERENCE>
 
+ <REFERENCE>Phillips, Hubert. 1961. <EM>My Best Puzzles in Logic and Reasoning</EM>.
+ New York: Dover Publications.</REFERENCE>
+
  <REFERENCE>Rabin, Michael O. 1980. Probabilistic algorithm for testing primality.
  <EM>Journal of Number Theory</EM> 12:128<ENDASH/>138.</REFERENCE>