Metadata-Version: 2.1
Name: quagnes
Version: 0.8.2
Summary: This package solves Agnes (Agnes Sorel) solitaire card games. It can be used to solve games having the rules implemented in the GNOME AisleRiot package and the rules attributed to Dalton in 1909 and Parlett in 1979 among others and to calculate win rates.
Author-email: Ray Griner <rgriner_fwd@outlook.com>
License:                     GNU GENERAL PUBLIC LICENSE
                               Version 3, 29 June 2007
        
         Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
         Everyone is permitted to copy and distribute verbatim copies
         of this license document, but changing it is not allowed.
        
                                    Preamble
        
          The GNU General Public License is a free, copyleft license for
        software and other kinds of works.
        
          The licenses for most software and other practical works are designed
        to take away your freedom to share and change the works.  By contrast,
        the GNU General Public License is intended to guarantee your freedom to
        share and change all versions of a program--to make sure it remains free
        software for all its users.  We, the Free Software Foundation, use the
        GNU General Public License for most of our software; it applies also to
        any other work released this way by its authors.  You can apply it to
        your programs, too.
        
          When we speak of free software, we are referring to freedom, not
        price.  Our General Public Licenses are designed to make sure that you
        have the freedom to distribute copies of free software (and charge for
        them if you wish), that you receive source code or can get it if you
        want it, that you can change the software or use pieces of it in new
        free programs, and that you know you can do these things.
        
          To protect your rights, we need to prevent others from denying you
        these rights or asking you to surrender the rights.  Therefore, you have
        certain responsibilities if you distribute copies of the software, or if
        you modify it: responsibilities to respect the freedom of others.
        
          For example, if you distribute copies of such a program, whether
        gratis or for a fee, you must pass on to the recipients the same
        freedoms that you received.  You must make sure that they, too, receive
        or can get the source code.  And you must show them these terms so they
        know their rights.
        
          Developers that use the GNU GPL protect your rights with two steps:
        (1) assert copyright on the software, and (2) offer you this License
        giving you legal permission to copy, distribute and/or modify it.
        
          For the developers' and authors' protection, the GPL clearly explains
        that there is no warranty for this free software.  For both users' and
        authors' sake, the GPL requires that modified versions be marked as
        changed, so that their problems will not be attributed erroneously to
        authors of previous versions.
        
          Some devices are designed to deny users access to install or run
        modified versions of the software inside them, although the manufacturer
        can do so.  This is fundamentally incompatible with the aim of
        protecting users' freedom to change the software.  The systematic
        pattern of such abuse occurs in the area of products for individuals to
        use, which is precisely where it is most unacceptable.  Therefore, we
        have designed this version of the GPL to prohibit the practice for those
        products.  If such problems arise substantially in other domains, we
        stand ready to extend this provision to those domains in future versions
        of the GPL, as needed to protect the freedom of users.
        
          Finally, every program is threatened constantly by software patents.
        States should not allow patents to restrict development and use of
        software on general-purpose computers, but in those that do, we wish to
        avoid the special danger that patents applied to a free program could
        make it effectively proprietary.  To prevent this, the GPL assures that
        patents cannot be used to render the program non-free.
        
          The precise terms and conditions for copying, distribution and
        modification follow.
        
                               TERMS AND CONDITIONS
        
          0. Definitions.
        
          "This License" refers to version 3 of the GNU General Public License.
        
          "Copyright" also means copyright-like laws that apply to other kinds of
        works, such as semiconductor masks.
        
          "The Program" refers to any copyrightable work licensed under this
        License.  Each licensee is addressed as "you".  "Licensees" and
        "recipients" may be individuals or organizations.
        
          To "modify" a work means to copy from or adapt all or part of the work
        in a fashion requiring copyright permission, other than the making of an
        exact copy.  The resulting work is called a "modified version" of the
        earlier work or a work "based on" the earlier work.
        
          A "covered work" means either the unmodified Program or a work based
        on the Program.
        
          To "propagate" a work means to do anything with it that, without
        permission, would make you directly or secondarily liable for
        infringement under applicable copyright law, except executing it on a
        computer or modifying a private copy.  Propagation includes copying,
        distribution (with or without modification), making available to the
        public, and in some countries other activities as well.
        
          To "convey" a work means any kind of propagation that enables other
        parties to make or receive copies.  Mere interaction with a user through
        a computer network, with no transfer of a copy, is not conveying.
        
          An interactive user interface displays "Appropriate Legal Notices"
        to the extent that it includes a convenient and prominently visible
        feature that (1) displays an appropriate copyright notice, and (2)
        tells the user that there is no warranty for the work (except to the
        extent that warranties are provided), that licensees may convey the
        work under this License, and how to view a copy of this License.  If
        the interface presents a list of user commands or options, such as a
        menu, a prominent item in the list meets this criterion.
        
          1. Source Code.
        
          The "source code" for a work means the preferred form of the work
        for making modifications to it.  "Object code" means any non-source
        form of a work.
        
          A "Standard Interface" means an interface that either is an official
        standard defined by a recognized standards body, or, in the case of
        interfaces specified for a particular programming language, one that
        is widely used among developers working in that language.
        
          The "System Libraries" of an executable work include anything, other
        than the work as a whole, that (a) is included in the normal form of
        packaging a Major Component, but which is not part of that Major
        Component, and (b) serves only to enable use of the work with that
        Major Component, or to implement a Standard Interface for which an
        implementation is available to the public in source code form.  A
        "Major Component", in this context, means a major essential component
        (kernel, window system, and so on) of the specific operating system
        (if any) on which the executable work runs, or a compiler used to
        produce the work, or an object code interpreter used to run it.
        
          The "Corresponding Source" for a work in object code form means all
        the source code needed to generate, install, and (for an executable
        work) run the object code and to modify the work, including scripts to
        control those activities.  However, it does not include the work's
        System Libraries, or general-purpose tools or generally available free
        programs which are used unmodified in performing those activities but
        which are not part of the work.  For example, Corresponding Source
        includes interface definition files associated with source files for
        the work, and the source code for shared libraries and dynamically
        linked subprograms that the work is specifically designed to require,
        such as by intimate data communication or control flow between those
        subprograms and other parts of the work.
        
          The Corresponding Source need not include anything that users
        can regenerate automatically from other parts of the Corresponding
        Source.
        
          The Corresponding Source for a work in source code form is that
        same work.
        
          2. Basic Permissions.
        
          All rights granted under this License are granted for the term of
        copyright on the Program, and are irrevocable provided the stated
        conditions are met.  This License explicitly affirms your unlimited
        permission to run the unmodified Program.  The output from running a
        covered work is covered by this License only if the output, given its
        content, constitutes a covered work.  This License acknowledges your
        rights of fair use or other equivalent, as provided by copyright law.
        
          You may make, run and propagate covered works that you do not
        convey, without conditions so long as your license otherwise remains
        in force.  You may convey covered works to others for the sole purpose
        of having them make modifications exclusively for you, or provide you
        with facilities for running those works, provided that you comply with
        the terms of this License in conveying all material for which you do
        not control copyright.  Those thus making or running the covered works
        for you must do so exclusively on your behalf, under your direction
        and control, on terms that prohibit them from making any copies of
        your copyrighted material outside their relationship with you.
        
          Conveying under any other circumstances is permitted solely under
        the conditions stated below.  Sublicensing is not allowed; section 10
        makes it unnecessary.
        
          3. Protecting Users' Legal Rights From Anti-Circumvention Law.
        
          No covered work shall be deemed part of an effective technological
        measure under any applicable law fulfilling obligations under article
        11 of the WIPO copyright treaty adopted on 20 December 1996, or
        similar laws prohibiting or restricting circumvention of such
        measures.
        
          When you convey a covered work, you waive any legal power to forbid
        circumvention of technological measures to the extent such circumvention
        is effected by exercising rights under this License with respect to
        the covered work, and you disclaim any intention to limit operation or
        modification of the work as a means of enforcing, against the work's
        users, your or third parties' legal rights to forbid circumvention of
        technological measures.
        
          4. Conveying Verbatim Copies.
        
          You may convey verbatim copies of the Program's source code as you
        receive it, in any medium, provided that you conspicuously and
        appropriately publish on each copy an appropriate copyright notice;
        keep intact all notices stating that this License and any
        non-permissive terms added in accord with section 7 apply to the code;
        keep intact all notices of the absence of any warranty; and give all
        recipients a copy of this License along with the Program.
        
          You may charge any price or no price for each copy that you convey,
        and you may offer support or warranty protection for a fee.
        
          5. Conveying Modified Source Versions.
        
          You may convey a work based on the Program, or the modifications to
        produce it from the Program, in the form of source code under the
        terms of section 4, provided that you also meet all of these conditions:
        
            a) The work must carry prominent notices stating that you modified
            it, and giving a relevant date.
        
            b) The work must carry prominent notices stating that it is
            released under this License and any conditions added under section
            7.  This requirement modifies the requirement in section 4 to
            "keep intact all notices".
        
            c) You must license the entire work, as a whole, under this
            License to anyone who comes into possession of a copy.  This
            License will therefore apply, along with any applicable section 7
            additional terms, to the whole of the work, and all its parts,
            regardless of how they are packaged.  This License gives no
            permission to license the work in any other way, but it does not
            invalidate such permission if you have separately received it.
        
            d) If the work has interactive user interfaces, each must display
            Appropriate Legal Notices; however, if the Program has interactive
            interfaces that do not display Appropriate Legal Notices, your
            work need not make them do so.
        
          A compilation of a covered work with other separate and independent
        works, which are not by their nature extensions of the covered work,
        and which are not combined with it such as to form a larger program,
        in or on a volume of a storage or distribution medium, is called an
        "aggregate" if the compilation and its resulting copyright are not
        used to limit the access or legal rights of the compilation's users
        beyond what the individual works permit.  Inclusion of a covered work
        in an aggregate does not cause this License to apply to the other
        parts of the aggregate.
        
          6. Conveying Non-Source Forms.
        
          You may convey a covered work in object code form under the terms
        of sections 4 and 5, provided that you also convey the
        machine-readable Corresponding Source under the terms of this License,
        in one of these ways:
        
            a) Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by the
            Corresponding Source fixed on a durable physical medium
            customarily used for software interchange.
        
            b) Convey the object code in, or embodied in, a physical product
            (including a physical distribution medium), accompanied by a
            written offer, valid for at least three years and valid for as
            long as you offer spare parts or customer support for that product
            model, to give anyone who possesses the object code either (1) a
            copy of the Corresponding Source for all the software in the
            product that is covered by this License, on a durable physical
            medium customarily used for software interchange, for a price no
            more than your reasonable cost of physically performing this
            conveying of source, or (2) access to copy the
            Corresponding Source from a network server at no charge.
        
            c) Convey individual copies of the object code with a copy of the
            written offer to provide the Corresponding Source.  This
            alternative is allowed only occasionally and noncommercially, and
            only if you received the object code with such an offer, in accord
            with subsection 6b.
        
            d) Convey the object code by offering access from a designated
            place (gratis or for a charge), and offer equivalent access to the
            Corresponding Source in the same way through the same place at no
            further charge.  You need not require recipients to copy the
            Corresponding Source along with the object code.  If the place to
            copy the object code is a network server, the Corresponding Source
            may be on a different server (operated by you or a third party)
            that supports equivalent copying facilities, provided you maintain
            clear directions next to the object code saying where to find the
            Corresponding Source.  Regardless of what server hosts the
            Corresponding Source, you remain obligated to ensure that it is
            available for as long as needed to satisfy these requirements.
        
            e) Convey the object code using peer-to-peer transmission, provided
            you inform other peers where the object code and Corresponding
            Source of the work are being offered to the general public at no
            charge under subsection 6d.
        
          A separable portion of the object code, whose source code is excluded
        from the Corresponding Source as a System Library, need not be
        included in conveying the object code work.
        
          A "User Product" is either (1) a "consumer product", which means any
        tangible personal property which is normally used for personal, family,
        or household purposes, or (2) anything designed or sold for incorporation
        into a dwelling.  In determining whether a product is a consumer product,
        doubtful cases shall be resolved in favor of coverage.  For a particular
        product received by a particular user, "normally used" refers to a
        typical or common use of that class of product, regardless of the status
        of the particular user or of the way in which the particular user
        actually uses, or expects or is expected to use, the product.  A product
        is a consumer product regardless of whether the product has substantial
        commercial, industrial or non-consumer uses, unless such uses represent
        the only significant mode of use of the product.
        
          "Installation Information" for a User Product means any methods,
        procedures, authorization keys, or other information required to install
        and execute modified versions of a covered work in that User Product from
        a modified version of its Corresponding Source.  The information must
        suffice to ensure that the continued functioning of the modified object
        code is in no case prevented or interfered with solely because
        modification has been made.
        
          If you convey an object code work under this section in, or with, or
        specifically for use in, a User Product, and the conveying occurs as
        part of a transaction in which the right of possession and use of the
        User Product is transferred to the recipient in perpetuity or for a
        fixed term (regardless of how the transaction is characterized), the
        Corresponding Source conveyed under this section must be accompanied
        by the Installation Information.  But this requirement does not apply
        if neither you nor any third party retains the ability to install
        modified object code on the User Product (for example, the work has
        been installed in ROM).
        
          The requirement to provide Installation Information does not include a
        requirement to continue to provide support service, warranty, or updates
        for a work that has been modified or installed by the recipient, or for
        the User Product in which it has been modified or installed.  Access to a
        network may be denied when the modification itself materially and
        adversely affects the operation of the network or violates the rules and
        protocols for communication across the network.
        
          Corresponding Source conveyed, and Installation Information provided,
        in accord with this section must be in a format that is publicly
        documented (and with an implementation available to the public in
        source code form), and must require no special password or key for
        unpacking, reading or copying.
        
          7. Additional Terms.
        
          "Additional permissions" are terms that supplement the terms of this
        License by making exceptions from one or more of its conditions.
        Additional permissions that are applicable to the entire Program shall
        be treated as though they were included in this License, to the extent
        that they are valid under applicable law.  If additional permissions
        apply only to part of the Program, that part may be used separately
        under those permissions, but the entire Program remains governed by
        this License without regard to the additional permissions.
        
          When you convey a copy of a covered work, you may at your option
        remove any additional permissions from that copy, or from any part of
        it.  (Additional permissions may be written to require their own
        removal in certain cases when you modify the work.)  You may place
        additional permissions on material, added by you to a covered work,
        for which you have or can give appropriate copyright permission.
        
          Notwithstanding any other provision of this License, for material you
        add to a covered work, you may (if authorized by the copyright holders of
        that material) supplement the terms of this License with terms:
        
            a) Disclaiming warranty or limiting liability differently from the
            terms of sections 15 and 16 of this License; or
        
            b) Requiring preservation of specified reasonable legal notices or
            author attributions in that material or in the Appropriate Legal
            Notices displayed by works containing it; or
        
            c) Prohibiting misrepresentation of the origin of that material, or
            requiring that modified versions of such material be marked in
            reasonable ways as different from the original version; or
        
            d) Limiting the use for publicity purposes of names of licensors or
            authors of the material; or
        
            e) Declining to grant rights under trademark law for use of some
            trade names, trademarks, or service marks; or
        
            f) Requiring indemnification of licensors and authors of that
            material by anyone who conveys the material (or modified versions of
            it) with contractual assumptions of liability to the recipient, for
            any liability that these contractual assumptions directly impose on
            those licensors and authors.
        
          All other non-permissive additional terms are considered "further
        restrictions" within the meaning of section 10.  If the Program as you
        received it, or any part of it, contains a notice stating that it is
        governed by this License along with a term that is a further
        restriction, you may remove that term.  If a license document contains
        a further restriction but permits relicensing or conveying under this
        License, you may add to a covered work material governed by the terms
        of that license document, provided that the further restriction does
        not survive such relicensing or conveying.
        
          If you add terms to a covered work in accord with this section, you
        must place, in the relevant source files, a statement of the
        additional terms that apply to those files, or a notice indicating
        where to find the applicable terms.
        
          Additional terms, permissive or non-permissive, may be stated in the
        form of a separately written license, or stated as exceptions;
        the above requirements apply either way.
        
          8. Termination.
        
          You may not propagate or modify a covered work except as expressly
        provided under this License.  Any attempt otherwise to propagate or
        modify it is void, and will automatically terminate your rights under
        this License (including any patent licenses granted under the third
        paragraph of section 11).
        
          However, if you cease all violation of this License, then your
        license from a particular copyright holder is reinstated (a)
        provisionally, unless and until the copyright holder explicitly and
        finally terminates your license, and (b) permanently, if the copyright
        holder fails to notify you of the violation by some reasonable means
        prior to 60 days after the cessation.
        
          Moreover, your license from a particular copyright holder is
        reinstated permanently if the copyright holder notifies you of the
        violation by some reasonable means, this is the first time you have
        received notice of violation of this License (for any work) from that
        copyright holder, and you cure the violation prior to 30 days after
        your receipt of the notice.
        
          Termination of your rights under this section does not terminate the
        licenses of parties who have received copies or rights from you under
        this License.  If your rights have been terminated and not permanently
        reinstated, you do not qualify to receive new licenses for the same
        material under section 10.
        
          9. Acceptance Not Required for Having Copies.
        
          You are not required to accept this License in order to receive or
        run a copy of the Program.  Ancillary propagation of a covered work
        occurring solely as a consequence of using peer-to-peer transmission
        to receive a copy likewise does not require acceptance.  However,
        nothing other than this License grants you permission to propagate or
        modify any covered work.  These actions infringe copyright if you do
        not accept this License.  Therefore, by modifying or propagating a
        covered work, you indicate your acceptance of this License to do so.
        
          10. Automatic Licensing of Downstream Recipients.
        
          Each time you convey a covered work, the recipient automatically
        receives a license from the original licensors, to run, modify and
        propagate that work, subject to this License.  You are not responsible
        for enforcing compliance by third parties with this License.
        
          An "entity transaction" is a transaction transferring control of an
        organization, or substantially all assets of one, or subdividing an
        organization, or merging organizations.  If propagation of a covered
        work results from an entity transaction, each party to that
        transaction who receives a copy of the work also receives whatever
        licenses to the work the party's predecessor in interest had or could
        give under the previous paragraph, plus a right to possession of the
        Corresponding Source of the work from the predecessor in interest, if
        the predecessor has it or can get it with reasonable efforts.
        
          You may not impose any further restrictions on the exercise of the
        rights granted or affirmed under this License.  For example, you may
        not impose a license fee, royalty, or other charge for exercise of
        rights granted under this License, and you may not initiate litigation
        (including a cross-claim or counterclaim in a lawsuit) alleging that
        any patent claim is infringed by making, using, selling, offering for
        sale, or importing the Program or any portion of it.
        
          11. Patents.
        
          A "contributor" is a copyright holder who authorizes use under this
        License of the Program or a work on which the Program is based.  The
        work thus licensed is called the contributor's "contributor version".
        
          A contributor's "essential patent claims" are all patent claims
        owned or controlled by the contributor, whether already acquired or
        hereafter acquired, that would be infringed by some manner, permitted
        by this License, of making, using, or selling its contributor version,
        but do not include claims that would be infringed only as a
        consequence of further modification of the contributor version.  For
        purposes of this definition, "control" includes the right to grant
        patent sublicenses in a manner consistent with the requirements of
        this License.
        
          Each contributor grants you a non-exclusive, worldwide, royalty-free
        patent license under the contributor's essential patent claims, to
        make, use, sell, offer for sale, import and otherwise run, modify and
        propagate the contents of its contributor version.
        
          In the following three paragraphs, a "patent license" is any express
        agreement or commitment, however denominated, not to enforce a patent
        (such as an express permission to practice a patent or covenant not to
        sue for patent infringement).  To "grant" such a patent license to a
        party means to make such an agreement or commitment not to enforce a
        patent against the party.
        
          If you convey a covered work, knowingly relying on a patent license,
        and the Corresponding Source of the work is not available for anyone
        to copy, free of charge and under the terms of this License, through a
        publicly available network server or other readily accessible means,
        then you must either (1) cause the Corresponding Source to be so
        available, or (2) arrange to deprive yourself of the benefit of the
        patent license for this particular work, or (3) arrange, in a manner
        consistent with the requirements of this License, to extend the patent
        license to downstream recipients.  "Knowingly relying" means you have
        actual knowledge that, but for the patent license, your conveying the
        covered work in a country, or your recipient's use of the covered work
        in a country, would infringe one or more identifiable patents in that
        country that you have reason to believe are valid.
        
          If, pursuant to or in connection with a single transaction or
        arrangement, you convey, or propagate by procuring conveyance of, a
        covered work, and grant a patent license to some of the parties
        receiving the covered work authorizing them to use, propagate, modify
        or convey a specific copy of the covered work, then the patent license
        you grant is automatically extended to all recipients of the covered
        work and works based on it.
        
          A patent license is "discriminatory" if it does not include within
        the scope of its coverage, prohibits the exercise of, or is
        conditioned on the non-exercise of one or more of the rights that are
        specifically granted under this License.  You may not convey a covered
        work if you are a party to an arrangement with a third party that is
        in the business of distributing software, under which you make payment
        to the third party based on the extent of your activity of conveying
        the work, and under which the third party grants, to any of the
        parties who would receive the covered work from you, a discriminatory
        patent license (a) in connection with copies of the covered work
        conveyed by you (or copies made from those copies), or (b) primarily
        for and in connection with specific products or compilations that
        contain the covered work, unless you entered into that arrangement,
        or that patent license was granted, prior to 28 March 2007.
        
          Nothing in this License shall be construed as excluding or limiting
        any implied license or other defenses to infringement that may
        otherwise be available to you under applicable patent law.
        
          12. No Surrender of Others' Freedom.
        
          If conditions are imposed on you (whether by court order, agreement or
        otherwise) that contradict the conditions of this License, they do not
        excuse you from the conditions of this License.  If you cannot convey a
        covered work so as to satisfy simultaneously your obligations under this
        License and any other pertinent obligations, then as a consequence you may
        not convey it at all.  For example, if you agree to terms that obligate you
        to collect a royalty for further conveying from those to whom you convey
        the Program, the only way you could satisfy both those terms and this
        License would be to refrain entirely from conveying the Program.
        
          13. Use with the GNU Affero General Public License.
        
          Notwithstanding any other provision of this License, you have
        permission to link or combine any covered work with a work licensed
        under version 3 of the GNU Affero General Public License into a single
        combined work, and to convey the resulting work.  The terms of this
        License will continue to apply to the part which is the covered work,
        but the special requirements of the GNU Affero General Public License,
        section 13, concerning interaction through a network will apply to the
        combination as such.
        
          14. Revised Versions of this License.
        
          The Free Software Foundation may publish revised and/or new versions of
        the GNU General Public License from time to time.  Such new versions will
        be similar in spirit to the present version, but may differ in detail to
        address new problems or concerns.
        
          Each version is given a distinguishing version number.  If the
        Program specifies that a certain numbered version of the GNU General
        Public License "or any later version" applies to it, you have the
        option of following the terms and conditions either of that numbered
        version or of any later version published by the Free Software
        Foundation.  If the Program does not specify a version number of the
        GNU General Public License, you may choose any version ever published
        by the Free Software Foundation.
        
          If the Program specifies that a proxy can decide which future
        versions of the GNU General Public License can be used, that proxy's
        public statement of acceptance of a version permanently authorizes you
        to choose that version for the Program.
        
          Later license versions may give you additional or different
        permissions.  However, no additional obligations are imposed on any
        author or copyright holder as a result of your choosing to follow a
        later version.
        
          15. Disclaimer of Warranty.
        
          THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
        APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
        HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
        OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
        THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
        PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
        IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
        ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
        
          16. Limitation of Liability.
        
          IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
        WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
        THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
        GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
        USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
        DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
        PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
        EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
        SUCH DAMAGES.
        
          17. Interpretation of Sections 15 and 16.
        
          If the disclaimer of warranty and limitation of liability provided
        above cannot be given local legal effect according to their terms,
        reviewing courts shall apply local law that most closely approximates
        an absolute waiver of all civil liability in connection with the
        Program, unless a warranty or assumption of liability accompanies a
        copy of the Program in return for a fee.
        
                             END OF TERMS AND CONDITIONS
        
                    How to Apply These Terms to Your New Programs
        
          If you develop a new program, and you want it to be of the greatest
        possible use to the public, the best way to achieve this is to make it
        free software which everyone can redistribute and change under these terms.
        
          To do so, attach the following notices to the program.  It is safest
        to attach them to the start of each source file to most effectively
        state the exclusion of warranty; and each file should have at least
        the "copyright" line and a pointer to where the full notice is found.
        
            <one line to give the program's name and a brief idea of what it does.>
            Copyright (C) <year>  <name of author>
        
            This program is free software: you can redistribute it and/or modify
            it under the terms of the GNU General Public License as published by
            the Free Software Foundation, either version 3 of the License, or
            (at your option) any later version.
        
            This program is distributed in the hope that it will be useful,
            but WITHOUT ANY WARRANTY; without even the implied warranty of
            MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
            GNU General Public License for more details.
        
            You should have received a copy of the GNU General Public License
            along with this program.  If not, see <https://www.gnu.org/licenses/>.
        
        Also add information on how to contact you by electronic and paper mail.
        
          If the program does terminal interaction, make it output a short
        notice like this when it starts in an interactive mode:
        
            <program>  Copyright (C) <year>  <name of author>
            This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
            This is free software, and you are welcome to redistribute it
            under certain conditions; type `show c' for details.
        
        The hypothetical commands `show w' and `show c' should show the appropriate
        parts of the General Public License.  Of course, your program's commands
        might be different; for a GUI interface, you would use an "about box".
        
          You should also get your employer (if you work as a programmer) or school,
        if any, to sign a "copyright disclaimer" for the program, if necessary.
        For more information on this, and how to apply and follow the GNU GPL, see
        <https://www.gnu.org/licenses/>.
        
          The GNU General Public License does not permit incorporating your program
        into proprietary programs.  If your program is a subroutine library, you
        may consider it more useful to permit linking proprietary applications with
        the library.  If this is what you want to do, use the GNU Lesser General
        Public License instead of this License.  But first, please read
        <https://www.gnu.org/licenses/why-not-lgpl.html>.
        
Keywords: solitaire,solver,Agnes
Classifier: Programming Language :: Python :: 3
Classifier: License :: OSI Approved :: GNU General Public License v3 or later (GPLv3+)
Classifier: Operating System :: OS Independent
Classifier: Development Status :: 3 - Alpha
Classifier: Topic :: Games/Entertainment :: Simulation
Description-Content-Type: text/markdown
License-File: LICENSE.txt

# Summary
This package solves Agnes (Agnes Sorel) solitaire card games. It can
be used to solve games having the rules implemented in the GNOME AisleRiot
package and the rules attributed to Dalton in 1909 (with a minor variant
in the table layout) and Parlett in 1979 among others [1–3] and to
calculate win rates.

# Example
```
import random
import quagnes

random.seed(12345)
n_reps = 1000

attributes = ['n_states_checked', 'n_deal', 'n_move_to_foundation',
      'n_move_card_in_tableau','n_no_move_possible','max_score','max_depth',
      'current_depth']

# header for the output file
print('rc,' + ','.join(attributes))

for rep in range(0, n_reps):
    new_game=quagnes.Agnes()
    rc = new_game.play()

    # Write the return code and selected attributes from the game
    out_str = (str(rc) + ',' +
        ','.join([ str(getattr(new_game, attr)) for attr in attributes ]))
    print(out_str, flush=True)

    # rc==1 are games that were won
    if rc==1:
        f = open(f'winners/win{rep}.txt', 'w', encoding='utf-8')
        f.write(new_game.print_history())
        f.close()
```

# Release Notes [v0.8.2]
- Bug fix: add check for loops when `move_to_empty_pile != 'none'`in
addition to the existing check when `split_same_suit_runs=True`.
- Add Optimizations #7 and #8 listed below.
- When printing a state, add a single line with a string that has the
  same values stored in the set of losing states. This alllows the user
  to easily search in the output for when the previous state occurred.
  Note that a more compressed version of this string (one byte per
  card) is stored in the set of losing states. A longer version is
  printed that avoids characters that are special in regular expressions
  to facilitate searching. 
- Remove extensive description of the rules from the module docstring.

# Background
Agnes is a difficult solitaire card game under some rule variants. This
package solves the game automatically.

Users can simulate random games and calculate win rates under various
permutations of rules, including moving sequences (runs) by same-suit or
same-color, allowing or not same-suit runs to be split in the middle of the
run for a move, dealing all tableau cards face-up at the start versus
dealing only the final tableau card face-up, and whether and how empty
columns can be filled in between deals (never, a single card of any rank, a
single card of the highest rank, a run starting with a single card of any
rank, or a run starting with a card of the highest rank). The package
provides additional options for debugging and tuning of the search algorithm
to be more memory-efficient at the expense of speed.

In 1979 Parlett named the two main variants of Agnes as Agnes Sorel (the
variant / set of variants described here) and Agnes Bernauer (a variant/set
of variants that uses a reserve) [3]. This package only considers Agnes
Sorel.

Some analyses of win rates for Agnes Sorel has previously been conducted.
Wolter published an experimental analysis of the win rates of this and
other solitaires, reporting 14 winnable games in a million deals under 
presumably the *Up-Suit-None* rules (defined below) [4]. Masten modified
Wolter's solver and reported 900/100,000 (0.9%) games were winnable when
empty columns could not be filled by any card, although it is unclear
whether same-suit sequences could be split during a move [5]. In this
analysis, we conduct our own simulations to estimate win rates, assess
agreement whether Wolter or Master are correct and add win rates for other
rule variants. As in the prior analyses, the win rates calculated here are
under perfect play (ie, the solver is allowed to undo losing moves).

# Rules
There is considerable heterogeneity in the rules that have been proposed
for Agnes (see Wikipedia [1] and Keller [6] for some discussion of the 
history). We describe first the rules according to Dalton [1-2] and
variations that change only the handling of play on empty piles. The other
main set of variants allow moving of same-color sequences instead of
same-suit sequences. We describe the parameter settings to be used in our
software when playing the different rule variants.

Because our interest in the problem arose from playing the game in the GNOME
AisleRiot package, the default parameters correspond to this variant.

## Dalton (1909)
The first description is of the game is attributed to Dalton in 1909 [1-2].
We implement his rules, except most software we have seen have the tableau
piles ascending in length from left to right, so we follow that convention,
rather than the right to left described by Dalton. (It should be noted that
the win rates are not identical under this variation because only the first
two piles are dealt to in the final deal.) The rules are the following:

Deal seven piles as columns face-up in the tableau such that the first pile
has one card and the last column has seven. Then, deal a single card and
place it above the tableau in the foundation (base card). Foundations are
built up by suit and the tableau is built down by color. Wrap from king to
ace when necessary. Piles of cards in sequence in the same suit can be
moved in the tableau. The top card in each tableau pile is exposed and can
be moved to a different pile (if it has the appropriate color and rank) or
to the foundation. If a movable sequence occurs by chance at the start of
the game or after a deal, the sequence could also be moved. When a card or
pile is moved, the card in the column above it becomes exposed and
available for play. Empty tableau piles can be filled by any card or
movable pack, or they can be left empty. Dealing from the stock adds one
card to the bottom of each tableau pile before play resumes, so a game will
have three more deals of seven cards and a final deal of two cards. Cards
cannot be played back from the foundation to the tableau.

Note that while Dalton used the singular when saying 'Any exposed card may
be moved into a vacant space [pile]', in the example game he plays, he moves
a group of cards into an empty pile. We follow the latter interpretation.

Dalton states that at the start the bottom card of each pile is exposed and
doesn't explicitly state what is permitted if a movable sequence occurs by
chance. However, in the sample game he plays, he does not distinguish
between cards that appeared at the bottom of the column at the start versus
those that did not, so we adopt the interpretation that sequences may be
moved even if they first occurred by chance. This is consistent with the
software implementations we have seen.

The game as described above can be played by specifying the parameters
`move_same_suit=True`, `face_up=True`, and `move_to_empty_pile='any run'`.

We denote the rules above as *Up-Suit-AnyRun*. The third part of
each name is because many variants have evolved that alter what can be done
with empty piles. We refer to these as:

*Up-Suit-None*: Empty piles can only be filled when dealing from stock.
*Up-Suit-Any1*: Empty piles can be filled by any single card, but not by
  a movable run.
*Up-Suit-HighRun*: Empty piles can be filled a single highest rank card, or
a run starting with the highest rank card (ie, if the base card was a seven,
an empty pile can be filled only with a six or run starting with a six).
*Up-Suit-High1*: Empty piles can be filled by a single highest rank card.

The `move_to_empty_pile` parameter takes the values `none` (default), 
`any 1`, `high run`, and `high 1`, respectively, for the above four
variants.

## Parlett (1979) and *NoSplit* variants
Parlett gives rules like *Up-Suit-None* but also forbids splitting same
suit sequences (`split_same_suit_runs=False`) [3]. We denote this as 
*Up-Suit-None-NoSplit*. We also allow other rules that move by suit to
have this option and denote these by adding *-NoSplit* to the end of
of the rule name.

## *Down-Color-* and *Up-Color* variants
Among this group, the primary variant of interest is *Down-Color-None*,
which corresponds to the game as played on AisleRiot, which is where we
became interested in the game. We verified the rules on the current
AisleRiot version 3.22.23.

The first variation from the Dalton rules is that cards are dealt
face down in the tableau except for the final card dealt in each pile.
We start these variant names with *Down-* instead of *Up-*.
The second variation is that sequences may be moved if they are the
same color instead of requiring they be the same suit. We use *-Color-*
as the second part of the variant name to indicate this. The third
part of the variant name is as described for the Dalton variants.

Other variants of interest in this class are *Up-Color-AnyRun*. This and
*Up-Color-None* match the rules described on the website poltaire.com,
which offers solitaire play [7]. This site is of interest to us as it hosts
an article by Wolter [4] that analyzes the winnability of the game as
played on the site.

# Methodology
The following optimizations were used to improve the run-time over a naive
depth-first search of all possible moves:

1. When `move_to_empty_pile='none'`, if the highest rank card (e.g., a king
if the base card is an ace) is placed in a tableau pile below a lower card
of the same suit, the lower card can never be moved from the pile. This is
detected as soon as the king is placed. Therefore, some games can be
determined to be not winnable by examining only the starting layout. Note
while this optimization improves run time, it is not possible to determine
the maximum possible score if a branch is terminated for this reason. This
concept can be extended by noting that if the king of clubs blocks the
queen of hearts and the king of hearts blocks the queen of clubs, the game
is also unwinnable. In general, we define after each deal a four vertex
graph (one vertex for each suit), where an edge denotes which suits are
blocked by the suit corresponding to the vertex. The state is not winnable
if a cycle exists in the graph. This only needs to be checked after a deal.
This optimization is disabled when `move_to_empty_pile != 'none'` or when
`maximize_score=True`.

2. A card is immediately placed on a foundation if its rank is no more than
the rank of the top foundation card of the same color suit plus two. For
example, if the base card is an ace, and we have already played up to the
six of spades in the foundation, we immediately play the ace of clubs up
to the eight of clubs (if possible) to the foundation. We would not
immediately play the nine of clubs to the foundation as it might be
needed in the tableau to move the eight of spades.

3. We track states that we have already determined to be not winnable in
a set. For example, suppose the initial state has two possible moves: M1)
move a card from pile 1 to 2; M2) move a card from pile 4 to 5. Once we
determine the sequence M1 → M2 is not winnable, there is no need to check
the sequence M2 → M1, as they both result in the same state. This
optimization can be tuned using the `track_threshold` parameter.

4. To prevent infinite loops, we use a stack of sets that stores the state of
the game (number of cards in the stock and arrangement of cards in the tableau)
and check whether this has been repeated since the last deal or move to
foundation.  If the state is a repeat, we consider no valid moves to be
available at the repeated state. This second method is disabled if
`split_same_suit_runs=False` and `move_to_empty_pile 'none'}`, as loops
cannot occur under this combination of parameter settings.

<!--- First, we track for each pile the last move number (ie, the number of plays
since the start of the game the pile was last involved in a move between
tableau piles). This is set to zero at the start of the game and when a card
is moved from the pile to the foundation or when the pile is dealt to. A move
between two piles is not permitted if the last move numbers match and are
greater than zero and the target pile is not empty (as this implies we have
reversed a previously executed move). -->

5. The simulation is implemented using two or three equal-length stacks
where the nth item describes an aspect of the state of the game at the
nth move.  These three stacks store: (1) the moves performed, (2) the valid
moves not yet attempted, and (3) a set containing the arrangement of all
tableau layouts that have occurred since the last deal or move to foundation.

A single state object (`_AgnesState`) in the `Agnes` object initially
stores information about the starting state, such as the cards in the
foundation, the arrangement of cards in the tableau, and the number of
cards left in the stock. When a move is performed or undone, the
`AgnesState` object is updated in-place based on the move information.
Initial testing found this implementation to be about 5–7 times faster than
using a stack of `_AgnesState` objects, although this hasn't been retested
after the addition of some of the other optimizations.

6. If win rate is the only output statistic of interest and results are
being calculated for multiple rule sets, users can exploit the fact that
all wins under some rule set is sometimes a subset of wins under another
rule set. For example, adding `split_same_suit_runs=True` will give at
least the same number of wins as `split_same_suit_runs=False` when other
parameter values are fixed.

7. If there are multiple empty columns in the tableau that cannot be
covered by a future deal, then it doesn't matter which column is played
in, so the first is always chosen. Similarly, we do not consider a move
that moves the entirety of one column to a different empty column when
both columns cannot be covered by a future deal.

8. Do not allow splitting same-suit runs when the stock is empty
regardless of the value of the `split_same_suit_runs` parameter, unless
`move_to_empty_pile = 'any 1'` or `'high 1'`.

# Statistical Analysis
Ten thousand decks were simulated using this package version 8.0.2.
We calculated the win rates and the 95% confidence intervals (95% CI)
using the score (Wilson) method for the following rules:
*Down-Color-None*, *Up-Color-None*, *Up-Suit-None*,
*Up-Suit-None-NoSplit*, *Up-Suit-HighRun*, *Up-Suit-HighRun-NoSplit*,
*Up-Suit-AnyRun*, *Up-Suit-AnyRun-NoSplit*. If a set of simulations
consumed too move memory, the simulation was run setting a maximum
number of states examined to 50 million, and win rates were
calculated assuming all incomplete simulations were losses and 
then again assuming all were wins.

For each set of rules, the mean (standard deviation) and maximum number
of states examined were also reported. This statistic counts repeated
states each time they are created.

Lastly, we calculated separate p-values testing the equality of our
estimate with those published by Masten [5] and Wolter \[4\] (the latter
only when the rule for empty piles was *None*). A Chi-square test or Fisher
exact test was used, as appropriate.

All simulations were run using a C++ port of this package.  The first
thousand simulations for each rule variant were also run using this
Python package version 0.8.2 on Python version 3.11.2, and the simulation
result (win, loss, exceeded maximum states) and number of states examined
were confirmed to match the C++ version. A laptop running 32-bit
Debian GNU/Linux 12 was used for the simulations. Statistical analyses
were conducted in R v4.2.2.

# Results
The results of the simulations are shown in the table below.

| Rule Variant              | Completed Simulations, (n) | Wins, n (% [95% CI])    | P-value [a] | Mean (SD) States Examined (10^3) | Max States Examined (10^6) |
| :------------------------ | :--------------: | :---------------------: | :---------: | :-------------------:     | :-----------------: |
| *Down-Color-None*         | 10,000           | 99 (1.0% [0.8%, 1.2%])  | 0.40        | 89.0 (156.1)              | 63.7                |
| *Up-Color-None*           |  9,996 [b]       | 113 (1.1% [0.9%, 1.4%], 1.2% [1.0%, 1.4%]) | 0.02, 0.01 |  72.6 (112.8) | 46.3       |
| *Up-Suit-None*            | 10,000           | 42 (0.4% [0.3%, 0.6%]   | <.0001      | 10.2 (163.9)              |  8.5                |
| *Up-Suit-None-NoSplit*    | 10,000           | 40 (0.4% [0.3%, 0.5%])  | <.0001      | 5.9 (94.1)            |  6.1                |
| *Up-Suit-HighRun*         | 10,000           | 1454 (14.5% [13.9%, 15.2%]) | 0.92    | 207.3 (999.3)         | 31.9                |
| *Up-Suit-HighRun-NoSplit* | 10,000           | 1411 (14.1% [13.4%, 14.8%]) | 0.30    | 112.9 (500.9)         | 22.6                |
| *Up-Suit-AnyRun-NoSplit*  | 10,000           | 6384 (63.8% [62.9%, 64.8%]) | 0.69    | 59.2 (340.2)          | 16.1                |

[a] P-value for comparison vs Masten results.
[b] Simulations stopped after 50,000,000 states examined. Win rates and P-values are reported twice assuming all incomplete simulations are losses and wins. Mean and maximum states examined reported for completed simulations.

# Discussion
We found 1.1% - 1.2% of games were winnable under the *Up-Color-None* rules
and 1.0% of games were winnable under the *Down-Color-None* rules. For the
former, the comparison to Masten's results gave a statistically significant
difference at the 95% confidence level while the latter did not.  Our
simulations for *Up-Suit-HighRun*, *Up-Suit-HighRun-NoSplit*, and
*Up-Suit-AnyRun-NoSplit* were not statistically significantly different from
those of Masten, although *Up-Suit-None* and *Up-Suit-None-NoSplit* were.

A limitation of using Masten's results is he states win rates, but isn't
explicit about which rules are used, with the exception of how empty
piles are filled. He refers readers to Keller's discussion [6] for more
information, and this discussion suggests that Agnes rules follow 
Whitehead rules (another solitaire) and require movable runs to be
the same suit. That is, Keller indicates the rules are *Up-Suit-None*
in our terminology [5,6]. However, Keller then goes on to note that all
computer implementations he had seen allow moves by colored runs and not
by same-suit runs, which would corresponds to the *Up-Color-None* rules in
our terminology. 

It was unexpected to find that when the rule for empty piles is *None*, our
results for dealing face-down and moving by color matched Masten, while
when the rule for empty piles is *HighRun* or *AnyRun*, our results for
dealing face-up and moving by suit matched. It is unclear if Masten 
reported results for different move rules, if the statistically significant
differences we found were due to chance, or if consistent rules were used
for a variant we have not yet tested (eg, *Up-Color-None-NoSplit*,
*Up-Color-HighRun-NoSplit*, and *Up-Color-AnyRun-NoSplit*).

Despite these uncertainties about Masten's estimates, we add 95% CIs to
his reported win rates and include them here. He reports the previously
mentioned win rate (95% CI) of 0.9% (0.8%, 1.0%) when empty
columns cannot be filled with moves from the tableau, 63.6% (63.3%, 63.9%)
when the empty column can be filled by any sequence (or perhaps single 
card — Masten is not explicit, but our results match filling with a
sequence), and 14.5% (14.3%, 14.7%) when empty columns can be filled only
by a sequence starting with the highest rank card (or perhaps sequence).

All of our results were larger than the 14/1,000,000 reported by Wolter
at P<.0001. Given the large difference between our results and Wolter's
results, we believe Wolter's results are incorrect and should not be cited.

We have estimated win rates that to our knowledge have not been previously
reported for Parlett's variant (*Up-Suit-None-NoSplit*) and
*Down-Color-None*, with the former less than half of *Up-Suit-None* and the
latter about 10% smaller.

Much of the work for this project was originally completed in 2019
assuming all cards were dealt face-up using Python 3.5. This 2024 update
used Python 3.11.2. In 2019 we ported the Python code to C++ for
performance testing and found a five-fold improvement in speed. When
porting the code to Python 3.11, we found a two-fold decrease in run-time
when switching the data structures used from tuples to dataclasses for the
structures representing cards and moves.

We have not all possible rule variants with this package. We considered
including *Up-Suit-AnyRun*, but preliminary estimates indicated 
high memory usage and a longer run time, and analysis will be deferred
until a later package version. The current package has some options
to manage the memory (eg, disabling the set that tracking losing states
at various thresholds), but additional optimizations are possible
once the set is disabled that are not yet implemented (eg, 
requiring cards to be placed to the foundation before moving a pile that we
hope will improve run time). In addition, the package options allow
disabling of splitting same-suit runs before a move, but this option will
likely be generalized to disallow splitting of movable runs and then
applied when moves are allowed by color.

# References
[1] Agnes (card game). Wikipedia.
    https://en.wikipedia.org/wiki/Agnes_(card_game). Retrieved
    March 15, 2024.

[2] Dalton W (1909). "My favourite Patiences" in The Strand Magazine,
    Vol 38.

[3] Parlett D (1979). The Penguin Book of Patience. London: Penguin.

[4] Wolter J (2013). Experimental analysis of Agnes Sorel solitaire.
    https://politaire.com/article/agnessorel.html. Retrieved
    March 15, 2024.

[5] Masten M (2021). Agnes Sorel.
    https://solitairewinrates.com/AgnesSorel.html. Retrieved
    March 17, 2024.

[6] Keller M (2021). Whitehead and Agnes -- packing in color.
    https://www.solitairelaboratory.com/whitehead.html. Retrieved
    March 17, 2024.

[7] Wolter J (2014). Rules for Agnes Sorel solitaire.
    https://politaire.com/help/agnessorel. Retrieved March 17, 2024.

# Disclosures
We are not affiliated with any of the books, websites, or applications
discussed in this documentation, except of course for this Python package
which we wrote.
