/usr/share/mozart/doc/demo/queens.html is in mozart-doc 1.4.0-8ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 | <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>1 Animated Queens</TITLE><LINK href="ozdoc.css" rel="stylesheet" type="text/css"></HEAD><BODY><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="index.html">- Up -</A></TD><TD><A href="jobshop.html#chapter.jobshop">Next >></A></TD></TR></TABLE><DIV id="chapter.queens"><H1><A name="chapter.queens">1 Animated Queens</A></H1><H3 class="authors"><A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A></H3><P> </P><P class="linkmenu">[ <A href="applets/AnimatedQueens.oza">Start Applet</A> | <A href="../install/node14.html#appendix.applets">How to enable Applets</A> ]</P><P> </P><P> This demo shows finite domain constraints and search to solve the <IMG alt="n" src="latex1.png">-Queens problem: how to place <IMG alt="n" src="latex1.png">-Queens on a <IMG alt="n\times n" src="latex2.png"> chess-board such that the queens do not attack each other. </P><P> The problem is solved with finite domain constraints, for a discussion see <A href="../fdt/node25.html#section.scripts.queens">Section 5.1 of ``Finite Domain Constraint Programming in Oz. A Tutorial.''</A>. The demo visualizes constraint propagation and different distribution heuristics. </P><P> Note that the size of the board as well as the following heuristics to place a queen can be selected: </P><DL><DT><EM>Brute Force</EM> </DT><DD><P>Try fields in a top-down, left-right fashion. </P></DD><DT><EM>First Fail</EM> </DT><DD><P>Choose the row with the least remaining possibilities first, and place the queen leftmost in this row. </P></DD><DT><EM>Middle Out</EM> </DT><DD><P>Choose the row as above, where rows near to the center of the board are preferred. Place the queen in the middle of this row. </P></DD><DT><EM>Up First</EM> </DT><DD><P>Choose the row with the least remaining possibilities first, where rows where it is possible to place the queen left most are chosen first. Place the queen left most. </P></DD></DL><P> </P><DIV class="unnumbered" id="section.queens.implementation"><H2><A name="section.queens.implementation">Implementation</A></H2><HR><UL class="toc"><LI><A href="node1.html#code.queens">Root functor: <CODE>AnimateQueens.oz</CODE></A></LI></UL></DIV></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="index.html">- Up -</A></TD><TD><A href="jobshop.html#chapter.jobshop">Next >></A></TD></TR></TABLE><HR><ADDRESS><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>
|