chore: license

refactor: make square idx size type a variable
fix: compiler warnings
2024-10-25 22:30:03 -04:00 · 2024-10-25 22:02:30 -04:00 · 2024-10-25 21:34:33 -04:00 · 2024-10-25 21:25:38 -04:00 · 2024-10-25 20:26:41 -04:00 · 2024-10-25 20:25:02 -04:00
7 changed files with 1125 additions and 300 deletions
--- a/Cargo.toml
+++ b/Cargo.toml
@ -2,6 +2,7 @@
 name = "chess_inator"
 version = "0.1.0"
 edition = "2021"
+license = "GPL-3.0-or-later"

 # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html

--- a/674
+++ b/674
@ -0,0 +1,674 @@
+                    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>.
--- a/src/bin/movegen_tool.rs
+++ b/src/bin/movegen_tool.rs
@ -0,0 +1,15 @@
+//! Generates moves from the FEN in the argv.
+
+use chess_inator::fen::FromFen;
+use chess_inator::movegen::{MoveGen, MoveGenType};
+use chess_inator::Board;
+use std::env;
+
+fn main() {
+    let fen = env::args().nth(1).unwrap();
+    let mut board = Board::from_fen(&fen).unwrap();
+    let mvs = board.gen_moves(MoveGenType::Legal);
+    for mv in mvs.into_iter() {
+        println!("{mv:?}")
+    }
+}
--- a/src/bin/perft_tool.rs
+++ b/src/bin/perft_tool.rs
@ -0,0 +1,14 @@
+//! Runs perft at depth for a given FEN.
+
+use chess_inator::fen::FromFen;
+use chess_inator::movegen::perft;
+use chess_inator::Board;
+use std::env;
+
+fn main() {
+    let depth = env::args().nth(1).unwrap().parse::<usize>().unwrap();
+    let fen = env::args().nth(2).unwrap();
+    let mut board = Board::from_fen(&fen).unwrap();
+    let res = perft(depth, &mut board);
+    println!("{res}")
+}
--- a/src/fen.rs
+++ b/src/fen.rs
@ -1,4 +1,17 @@
-use crate::{BoardState, CastleRights, ColPiece, Color, Square, BOARD_HEIGHT, BOARD_WIDTH};
+/*
+
+This file is part of chess_inator.
+
+chess_inator 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.
+
+chess_inator 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 chess_inator. If not, see https://www.gnu.org/licenses/.
+
+Copyright © 2024 dogeystamp <dogeystamp@disroot.org>
+*/
+
+use crate::{Board, ColPiece, Color, Square, SquareIdx, BOARD_HEIGHT, BOARD_WIDTH};

 pub const START_POSITION: &str = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";

@ -34,9 +47,9 @@ pub enum FenError {
    InternalError(usize),
 }

-impl FromFen for BoardState {
+impl FromFen for Board {
    type Error = FenError;
-    fn from_fen(fen: &str) -> Result<BoardState, FenError> {
+    fn from_fen(fen: &str) -> Result<Board, FenError> {
        //! Parse FEN string into position.

        /// Parser state machine.
@ -60,7 +73,7 @@ impl FromFen for BoardState {
            FullMove,
        }

-        let mut pos = BoardState::default();
+        let mut pos = Board::default();

        let mut parser_state = FenState::Piece(0, 0);
        let mut next_state = FenState::Space;
@ -179,7 +192,7 @@ impl FromFen for BoardState {
                            parse_space_and_goto!(FenState::HalfMove);
                        }
                        'a'..='h' => {
-                            pos.ep_square = Some(Square(c as usize - 'a' as usize));
+                            pos.ep_square = Some(Square(c as SquareIdx - b'a'));
                            parser_state = FenState::EnPassantFile;
                        }
                        _ => return bad_char!(i, c),
@ -188,8 +201,8 @@ impl FromFen for BoardState {
                FenState::EnPassantFile => {
                    if let Some(digit) = c.to_digit(10) {
                        pos.ep_square = Some(Square(
-                            usize::from(pos.ep_square.unwrap_or(Square(0)))
-                                + (digit as usize - 1) * 8,
+                            SquareIdx::from(pos.ep_square.unwrap_or(Square(0)))
+                                + (digit as SquareIdx - 1) * 8,
                        ));
                    } else {
                        return bad_char!(i, c);
@ -198,7 +211,7 @@ impl FromFen for BoardState {
                }
                FenState::HalfMove => {
                    if let Some(digit) = c.to_digit(10) {
-                        if pos.half_moves > BoardState::MAX_MOVES {
+                        if pos.half_moves > Board::MAX_MOVES {
                            return Err(FenError::TooManyMoves);
                        }
                        pos.half_moves *= 10;
@ -211,7 +224,7 @@ impl FromFen for BoardState {
                }
                FenState::FullMove => {
                    if let Some(digit) = c.to_digit(10) {
-                        if pos.half_moves > BoardState::MAX_MOVES {
+                        if pos.half_moves > Board::MAX_MOVES {
                            return Err(FenError::TooManyMoves);
                        }
                        pos.full_moves *= 10;
@ -233,7 +246,7 @@ impl FromFen for BoardState {
    }
 }

-impl ToFen for BoardState {
+impl ToFen for Board {
    fn to_fen(&self) -> String {
        let pieces_str = (0..BOARD_HEIGHT)
            .rev()
@ -280,15 +293,14 @@ impl ToFen for BoardState {
 #[cfg(test)]
 mod tests {
    use super::*;
-    use crate::CastlePlayer;
-    use crate::N_SQUARES;
+    use crate::{CastlePlayer, CastleRights, N_SQUARES};

    #[test]
    fn test_fen_pieces() {
        let fen = "rnbqkbnr/pppppppp/8/8/4P3/8/PPPP1PPP/RNBQKBNR b KQkq e3 0 1";
-        let board = BoardState::from_fen(fen.into()).unwrap();
+        let board = Board::from_fen(fen.into()).unwrap();
        assert_eq!(
-            (0..N_SQUARES)
+            (0..SquareIdx::try_from(N_SQUARES).unwrap())
                .map(Square)
                .map(|i| board.get_piece(i))
                .map(ColPiece::opt_to_char)
@ -301,7 +313,7 @@ mod tests {

    macro_rules! make_board {
        ($fen_fmt: expr) => {
-            BoardState::from_fen(&format!($fen_fmt)).unwrap()
+            Board::from_fen(&format!($fen_fmt)).unwrap()
        };
    }

@ -388,7 +400,7 @@ mod tests {

    #[test]
    fn test_fen_half_move_counter() {
-        for i in 0..=BoardState::MAX_MOVES {
+        for i in 0..=Board::MAX_MOVES {
            let board = make_board!("8/8/8/8/8/8/8/8 w - - {i} 0");
            assert_eq!(board.half_moves, i);
            assert_eq!(board.full_moves, 0);
@ -397,7 +409,7 @@ mod tests {

    #[test]
    fn test_fen_move_counter() {
-        for i in 0..=BoardState::MAX_MOVES {
+        for i in 0..=Board::MAX_MOVES {
            let board = make_board!("8/8/8/8/8/8/8/8 w - - 0 {i}");
            assert_eq!(board.half_moves, 0);
            assert_eq!(board.full_moves, i);
@ -437,7 +449,7 @@ mod tests {

        for fen1 in test_cases {
            println!("fen1: {fen1:?}");
-            let fen2 = BoardState::from_fen(fen1).unwrap().to_fen();
+            let fen2 = Board::from_fen(fen1).unwrap().to_fen();

            assert_eq!(fen1.to_string(), fen2, "FEN not equivalent")
        }
--- a/src/lib.rs
+++ b/src/lib.rs
@ -1,3 +1,16 @@
+/*
+
+This file is part of chess_inator.
+
+chess_inator 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.
+
+chess_inator 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 chess_inator. If not, see https://www.gnu.org/licenses/.
+
+Copyright © 2024 dogeystamp <dogeystamp@disroot.org>
+*/
+
 #![deny(rust_2018_idioms)]

 use std::fmt::Display;
@ -6,12 +19,14 @@ use std::str::FromStr;
 pub mod fen;
 pub mod movegen;

+use crate::fen::{FromFen, ToFen, START_POSITION};
+
 const BOARD_WIDTH: usize = 8;
 const BOARD_HEIGHT: usize = 8;
 const N_SQUARES: usize = BOARD_WIDTH * BOARD_HEIGHT;

 #[derive(Debug, Copy, Clone, Default, PartialEq, Eq)]
-enum Color {
+pub enum Color {
    #[default]
    White = 0,
    Black = 1,
@ -48,11 +63,11 @@ enum Piece {
 }
 const N_PIECES: usize = 6;

-struct PieceErr;
+pub struct PieceErr;

 /// Color and piece.
 #[derive(Debug, Clone, Copy, PartialEq, Eq)]
-struct ColPiece {
+pub struct ColPiece {
    pc: Piece,
    col: Color,
 }
@ -107,11 +122,13 @@ impl ColPiece {
    }
 }

+type SquareIdx = u8;
+
 /// Square index newtype.
 ///
 /// A1 is (0, 0) -> 0, A2 is (0, 1) -> 2, and H8 is (7, 7) -> 63.
 #[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
-struct Square(usize);
+pub struct Square(SquareIdx);

 #[derive(Debug)]
 pub enum SquareError {
@ -119,11 +136,11 @@ pub enum SquareError {
    InvalidCharacter(char),
 }

-impl TryFrom<usize> for Square {
+impl TryFrom<SquareIdx> for Square {
    type Error = SquareError;

-    fn try_from(value: usize) -> Result<Self, Self::Error> {
-        if (0..N_SQUARES).contains(&value) {
+    fn try_from(value: SquareIdx) -> Result<Self, Self::Error> {
+        if (0..N_SQUARES).contains(&value.into()) {
            Ok(Square(value))
        } else {
            Err(SquareError::OutOfBounds)
@ -139,7 +156,7 @@ macro_rules! sq_try_from {
            fn try_from(value: $T) -> Result<Self, Self::Error> {
                if let Ok(upper_bound) = <$T>::try_from(N_SQUARES) {
                    if (0..upper_bound).contains(&value) {
-                        return Ok(Square(value as usize));
+                        return Ok(Square(value as SquareIdx));
                    }
                }
                Err(SquareError::OutOfBounds)
@ -148,13 +165,20 @@ macro_rules! sq_try_from {
    };
 }

+sq_try_from!(i8);
 sq_try_from!(i32);
 sq_try_from!(isize);
-sq_try_from!(i8);
+sq_try_from!(usize);
+
+impl From<Square> for SquareIdx {
+    fn from(value: Square) -> Self {
+        value.0
+    }
+}

 impl From<Square> for usize {
    fn from(value: Square) -> Self {
-        value.0
+        value.0.into()
    }
 }

@ -179,10 +203,10 @@ impl Square {
    }
    fn to_row_col(self) -> (usize, usize) {
        //! Get row, column from index
-        let div = self.0 / BOARD_WIDTH;
-        let rem = self.0 % BOARD_WIDTH;
-        assert!(div <= 7);
-        assert!(rem <= 7);
+        let div = usize::from(self.0) / BOARD_WIDTH;
+        let rem = usize::from(self.0) % BOARD_WIDTH;
+        debug_assert!(div <= 7);
+        debug_assert!(rem <= 7);
        (div, rem)
    }
    fn to_row_col_signed(self) -> (isize, isize) {
@ -266,7 +290,7 @@ impl From<Piece> for char {
 }

 #[derive(Default, Debug, Clone, Copy, PartialEq, Eq)]
-struct Bitboard(u64);
+pub struct Bitboard(u64);

 impl Bitboard {
    pub fn on_sq(&mut self, idx: Square) {
@ -299,7 +323,7 @@ impl IntoIterator for Bitboard {
    }
 }

-struct BitboardIterator {
+pub struct BitboardIterator {
    remaining: Bitboard,
 }

@ -311,7 +335,7 @@ impl Iterator for BitboardIterator {
            None
        } else {
            let next_idx = self.remaining.0.trailing_zeros() as usize;
-            let sq = Square(next_idx);
+            let sq = Square(next_idx.try_into().unwrap());
            self.remaining.off_sq(sq);
            Some(sq)
        }
@ -401,7 +425,7 @@ impl ToString for CastleRights {
 ///
 /// Default is empty.
 #[derive(Debug, Default, Clone, Copy, PartialEq, Eq)]
-pub struct BoardState {
+pub struct Board {
    /// Player bitboards
    players: [Player; N_COLORS],

@ -426,11 +450,12 @@ pub struct BoardState {
    turn: Color,
 }

-/// Piece missing where there should be one.
-#[derive(Debug)]
-struct NoPieceError;
+impl Board {
+    /// Default chess position.
+    pub fn starting_pos() -> Self {
+        Board::from_fen(START_POSITION).unwrap()
+    }

-impl BoardState {
    /// Get mutable reference to a player.
    fn pl_mut(&mut self, col: Color) -> &mut Player {
        &mut self.players[col as usize]
@ -442,7 +467,7 @@ impl BoardState {
    }

    /// Get immutable reference to castling rights.
-    fn pl_castle(&self, col: Color) -> &CastlePlayer {
+    pub fn pl_castle(&self, col: Color) -> &CastlePlayer {
        &self.castle.0[col as usize]
    }

@ -452,58 +477,58 @@ impl BoardState {
    }

    /// Get iterator over all squares.
-    fn squares() -> impl Iterator<Item = Square> {
+    pub fn squares() -> impl Iterator<Item = Square> {
        (0..N_SQUARES).map(Square::try_from).map(|x| x.unwrap())
    }

-    /// Create a new piece in a location.
-    fn set_piece(&mut self, idx: Square, pc: ColPiece) {
-        let _ = self.del_piece(idx);
+    /// Create a new piece in a location, and pop any existing piece in the destination.
+    pub fn set_piece(&mut self, idx: Square, pc: ColPiece) -> Option<ColPiece> {
+        let dest_pc = self.del_piece(idx);
        let pl = self.pl_mut(pc.col);
        pl.board_mut(pc.into()).on_sq(idx);
        *self.mail.sq_mut(idx) = Some(pc);
+        dest_pc
    }

-    /// Set the piece (or no piece) in a square.
-    fn set_square(&mut self, idx: Square, pc: Option<ColPiece>) {
+    /// Set the piece (or no piece) in a square, and return ("pop") the existing piece.
+    pub fn set_square(&mut self, idx: Square, pc: Option<ColPiece>) -> Option<ColPiece> {
        match pc {
            Some(pc) => self.set_piece(idx, pc),
-            None => {
-                let _ = self.del_piece(idx);
-            }
+            None => self.del_piece(idx),
        }
    }

    /// Delete the piece in a location, and return ("pop") that piece.
-    ///
-    /// Returns an error if there is no piece in the location.
-    fn del_piece(&mut self, idx: Square) -> Result<ColPiece, NoPieceError> {
+    pub fn del_piece(&mut self, idx: Square) -> Option<ColPiece> {
        if let Some(pc) = *self.mail.sq_mut(idx) {
            let pl = self.pl_mut(pc.col);
            pl.board_mut(pc.into()).off_sq(idx);
            *self.mail.sq_mut(idx) = None;
-            Ok(pc)
+            Some(pc)
        } else {
-            Err(NoPieceError)
+            None
        }
    }

    fn move_piece(&mut self, src: Square, dest: Square) {
-        let pc = self
-            .del_piece(src)
-            .unwrap_or_else(|_| panic!("move ({src} -> {dest}) should have piece at source"));
+        let pc = self.del_piece(src).unwrap_or_else(|| {
+            panic!(
+                "move ({src} -> {dest}) should have piece at source (pos '{}')",
+                self.to_fen()
+            )
+        });
        self.set_piece(dest, pc);
    }

    /// Get the piece at a location.
-    fn get_piece(&self, idx: Square) -> Option<ColPiece> {
+    pub fn get_piece(&self, idx: Square) -> Option<ColPiece> {
        *self.mail.sq(idx)
    }

    /// Mirrors the position so that black and white are switched.
    ///
    /// Mainly to avoid duplication in tests.
-    fn flip_colors(&self) -> Self {
+    pub fn flip_colors(&self) -> Self {
        let mut new_board = Self {
            turn: self.turn.flip(),
            half_moves: self.half_moves,
@ -516,21 +541,70 @@ impl BoardState {

        new_board.castle.0.reverse();

-        for sq in BoardState::squares() {
+        for sq in Board::squares() {
            let opt_pc = self.get_piece(sq.mirror_vert()).map(|pc| ColPiece {
                col: pc.col.flip(),
                pc: pc.pc,
            });
-            new_board.set_square(sq, opt_pc)
+            new_board.set_square(sq, opt_pc);
        }
        new_board
    }

+    /// Is a given player in check?
+    pub fn is_check(&self, pl: Color) -> bool {
+        for src in self.pl(pl).board(Piece::King).into_iter() {
+            macro_rules! detect_checker {
+                ($dirs: ident, $pc: pat, $keep_going: expr) => {
+                    for dir in $dirs.into_iter() {
+                        let (mut r, mut c) = src.to_row_col_signed();
+                        loop {
+                            let (nr, nc) = (r + dir.0, c + dir.1);
+                            if let Ok(sq) = Square::from_row_col_signed(nr, nc) {
+                                if let Some(pc) = self.get_piece(sq) {
+                                    if matches!(pc.pc, $pc) && pc.col != pl {
+                                        return true;
+                                    } else {
+                                        break;
+                                    }
+                                }
+                            } else {
+                                break;
+                            }
+                            if (!($keep_going)) {
+                                break;
+                            }
+                            r = nr;
+                            c = nc;
+                        }
+                    }
+                };
+            }
+
+            let dirs_white_pawn = [(-1, 1), (-1, -1)];
+            let dirs_black_pawn = [(1, 1), (1, -1)];
+
+            use Piece::*;
+
+            use movegen::{DIRS_DIAG, DIRS_KNIGHT, DIRS_STAR, DIRS_STRAIGHT};
+
+            detect_checker!(DIRS_DIAG, Bishop | Queen, true);
+            detect_checker!(DIRS_STRAIGHT, Rook | Queen, true);
+            detect_checker!(DIRS_STAR, King, false);
+            detect_checker!(DIRS_KNIGHT, Knight, false);
+            match pl {
+                Color::White => detect_checker!(dirs_black_pawn, Pawn, false),
+                Color::Black => detect_checker!(dirs_white_pawn, Pawn, false),
+            }
+        }
+        false
+    }
+
    /// Maximum amount of moves in the counter to parse before giving up
    const MAX_MOVES: usize = 9_999;
 }

-impl core::fmt::Display for BoardState {
+impl core::fmt::Display for Board {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        let mut str = String::with_capacity(N_SQUARES + BOARD_HEIGHT);
        for row in (0..BOARD_HEIGHT).rev() {
@ -568,10 +642,10 @@ mod tests {
            try_type!(i32);
            try_type!(i8);
            try_type!(isize);
-            try_type!(usize);
+            try_type!(u8);
        }

-        let good_cases = 0..N_SQUARES;
+        let good_cases = 0..SquareIdx::try_from(N_SQUARES).unwrap();
        for tc in good_cases {
            macro_rules! try_type {
                ($T: ty) => {
@ -583,7 +657,7 @@ mod tests {
            try_type!(i32);
            try_type!(i8);
            try_type!(isize);
-            try_type!(usize);
+            try_type!(u8);
        }
    }

@ -601,10 +675,7 @@ mod tests {

    #[test]
    fn test_bitboard_iteration() {
-        let indices = [
-            0usize, 5usize, 17usize, 24usize, 34usize, 39usize, 42usize, 45usize, 49usize, 50usize,
-            63usize,
-        ];
+        let indices = [0, 5, 17, 24, 34, 39, 42, 45, 49, 50, 63];

        let mut bitboard = Bitboard::default();

@ -619,7 +690,7 @@ mod tests {
            }
        }

-        let board = BoardState::from_fen("8/4p3/1q1Q1p2/4p3/1p1r4/8/8/8 w - - 0 1").unwrap();
+        let board = Board::from_fen("8/4p3/1q1Q1p2/4p3/1p1r4/8/8/8 w - - 0 1").unwrap();
        let white_queens = board
            .pl(Color::White)
            .board(Piece::Queen)
@ -654,8 +725,8 @@ mod tests {
            ),
        ];
        for (tc, expect) in test_cases {
-            let tc = BoardState::from_fen(tc).unwrap();
-            let expect = BoardState::from_fen(expect).unwrap();
+            let tc = Board::from_fen(tc).unwrap();
+            let expect = Board::from_fen(expect).unwrap();
            assert_eq!(tc.flip_colors(), expect);
        }
    }
--- a/src/movegen.rs
+++ b/src/movegen.rs
@ -1,46 +1,23 @@
+/*
+
+This file is part of chess_inator.
+
+chess_inator 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.
+
+chess_inator 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 chess_inator. If not, see https://www.gnu.org/licenses/.
+
+Copyright © 2024 dogeystamp <dogeystamp@disroot.org>
+*/
+
 //! Move generation.

-use crate::fen::{FromFen, ToFen, START_POSITION};
+use crate::fen::ToFen;
 use crate::{
-    BoardState, ColPiece, Color, Piece, Square, SquareError, BOARD_HEIGHT, BOARD_WIDTH, N_SQUARES,
+    Board, CastleRights, ColPiece, Color, Piece, Square, SquareError, BOARD_HEIGHT, BOARD_WIDTH,
+    N_SQUARES,
 };
-use std::rc::Rc;
-
-/// Game tree node.
-#[derive(Clone, Debug)]
-pub struct Node {
-    /// Immutable position data.
-    pos: BoardState,
-    /// Backlink to previous node.
-    prev: Option<Rc<Node>>,
-}
-
-impl Default for Node {
-    fn default() -> Self {
-        Node::new(BoardState::from_fen(START_POSITION).expect("Starting FEN should be valid"))
-    }
-}
-
-impl Node {
-    /// Undo move.
-    ///
-    /// Intended usage is to always keep an Rc to the current node, and overwrite it with the
-    /// result of unmake.
-    pub fn unmake(&self) -> Rc<Node> {
-        if let Some(prev) = &self.prev {
-            Rc::clone(prev)
-        } else {
-            panic!("unmake should not be called on root node");
-        }
-    }
-
-    pub fn new(board: BoardState) -> Self {
-        Node {
-            pos: board,
-            prev: None,
-        }
-    }
-}

 /// Piece enum specifically for promotions.
 #[derive(Debug, Copy, Clone, PartialEq, Eq, PartialOrd, Ord)]
@ -62,6 +39,93 @@ impl From<PromotePiece> for Piece {
    }
 }

+#[derive(Debug, Clone, Copy)]
+enum AntiMoveType {
+    Normal,
+    /// En passant.
+    EnPassant {
+        cap: Square,
+    },
+    /// Pawn promotion.
+    Promotion,
+    /// King-rook castle. The king is the one considered to move.
+    Castle {
+        rook_src: Square,
+        rook_dest: Square,
+    },
+}
+
+/// Information used to reverse (unmake) a move.
+#[derive(Debug, Clone, Copy)]
+pub struct AntiMove {
+    dest: Square,
+    src: Square,
+    /// Captured piece, always assumed to be of enemy color.
+    cap: Option<Piece>,
+    move_type: AntiMoveType,
+    /// Half-move counter prior to this move
+    half_moves: usize,
+    /// Castling rights prior to this move.
+    castle: CastleRights,
+    /// En passant target square prior to this move.
+    ep_square: Option<Square>,
+}
+
+impl AntiMove {
+    /// Undo the move.
+    fn unmake(self, pos: &mut Board) {
+        pos.move_piece(self.dest, self.src);
+        pos.half_moves = self.half_moves;
+        pos.castle = self.castle;
+        pos.ep_square = self.ep_square;
+
+        /// Restore captured piece at a given square.
+        macro_rules! cap_sq {
+            ($sq: expr) => {
+                if let Some(cap_pc) = self.cap {
+                    pos.set_piece(
+                        $sq,
+                        ColPiece {
+                            pc: cap_pc,
+                            col: pos.turn.flip(),
+                        },
+                    );
+                }
+            };
+        }
+
+        pos.turn = pos.turn.flip();
+        if pos.turn == Color::Black {
+            pos.full_moves -= 1;
+        }
+
+        match self.move_type {
+            AntiMoveType::Normal => {
+                cap_sq!(self.dest)
+            }
+            AntiMoveType::EnPassant { cap } => {
+                cap_sq!(cap);
+            }
+            AntiMoveType::Promotion => {
+                cap_sq!(self.dest);
+                pos.set_piece(
+                    self.src,
+                    ColPiece {
+                        pc: Piece::Pawn,
+                        col: pos.turn,
+                    },
+                );
+            }
+            AntiMoveType::Castle {
+                rook_src,
+                rook_dest,
+            } => {
+                pos.move_piece(rook_dest, rook_src);
+            }
+        }
+    }
+}
+
 #[derive(PartialEq, Eq, PartialOrd, Ord, Debug, Clone, Copy)]
 enum MoveType {
    /// Pawn promotes to another piece.
@ -80,24 +144,30 @@ pub struct Move {
 }

 impl Move {
-    /// Make move, without setting up the backlink for unmake.
-    ///
-    /// Call this directly when making new positions that are dead ends (won't be used further).
-    fn make_unlinked(self, old_pos: BoardState) -> BoardState {
-        let mut new_pos = old_pos;
+    /// Apply move to a position.
+    fn make(self, pos: &mut Board) -> AntiMove {
+        let mut anti_move = AntiMove {
+            dest: self.dest,
+            src: self.src,
+            cap: None,
+            move_type: AntiMoveType::Normal,
+            half_moves: pos.half_moves,
+            castle: pos.castle,
+            ep_square: pos.ep_square,
+        };

        // reset en passant
-        new_pos.ep_square = None;
+        let ep_square = pos.ep_square;
+        pos.ep_square = None;

-        if old_pos.turn == Color::Black {
-            new_pos.full_moves += 1;
+        if pos.turn == Color::Black {
+            pos.full_moves += 1;
        }

        /// Get the piece at the source square.
        macro_rules! pc_src {
            ($data: ident) => {
-                new_pos
-                    .get_piece($data.src)
+                pos.get_piece($data.src)
                    .expect("Move source should have a piece")
            };
        }
@ -106,11 +176,11 @@ impl Move {
            ($pc_src: ident) => {
                debug_assert_eq!(
                    $pc_src.col,
-                    new_pos.turn,
+                    pos.turn,
                    "Moving piece on wrong turn. Move {} -> {} on board '{}'",
                    self.src,
                    self.dest,
-                    old_pos.to_fen()
+                    pos.to_fen()
                );
                debug_assert_ne!(self.src, self.dest, "Moving piece to itself.");
            };
@ -122,27 +192,33 @@ impl Move {
                pc_asserts!(pc_src);
                debug_assert_eq!(pc_src.pc, Piece::Pawn);

-                let _ = new_pos.del_piece(self.src);
-                new_pos.set_piece(
+                pos.half_moves = 0;
+
+                anti_move.move_type = AntiMoveType::Promotion;
+
+                pos.del_piece(self.src);
+                let cap_pc = pos.set_piece(
                    self.dest,
                    ColPiece {
                        pc: Piece::from(to_piece),
                        col: pc_src.col,
                    },
-                )
+                );
+                anti_move.cap = cap_pc.map(|pc| pc.pc);
            }
            MoveType::Normal => {
                let pc_src = pc_src!(self);
                pc_asserts!(pc_src);

-                let pc_dest: Option<ColPiece> = new_pos.get_piece(self.dest);
+                let pc_dest: Option<ColPiece> = pos.get_piece(self.dest);
+                anti_move.cap = pc_dest.map(|pc| pc.pc);

                let (src_row, src_col) = self.src.to_row_col_signed();
                let (dest_row, dest_col) = self.dest.to_row_col_signed();

                if matches!(pc_src.pc, Piece::Pawn) {
                    // pawn moves are irreversible
-                    new_pos.half_moves = 0;
+                    pos.half_moves = 0;

                    // set en-passant target square
                    if src_row.abs_diff(dest_row) == 2 {
@ -155,31 +231,49 @@ impl Move {
                            };
                        let ep_targ = Square::from_row_col_signed(ep_row, ep_col)
                            .expect("En-passant target should be valid.");
-                        new_pos.ep_square = Some(ep_targ)
+                        pos.ep_square = Some(ep_targ)
                    } else if pc_dest.is_none() && src_col != dest_col {
                        // we took en passant
                        debug_assert!(src_row.abs_diff(dest_row) == 1);
-                        debug_assert_eq!(self.dest, old_pos.ep_square.unwrap());
+                        assert_eq!(
+                            self.dest,
+                            ep_square.expect("ep target should exist if taking ep")
+                        );
                        // square to actually capture at
                        let ep_capture = Square::try_from(match pc_src.col {
-                            Color::White => self.dest.0 - BOARD_WIDTH,
-                            Color::Black => self.dest.0 + BOARD_WIDTH,
+                            Color::White => usize::from(self.dest.0) - BOARD_WIDTH,
+                            Color::Black => usize::from(self.dest.0) + BOARD_WIDTH,
                        })
                        .expect("En-passant capture square should be valid");
-                        new_pos.del_piece(ep_capture).unwrap_or_else(|_| {
-                            panic!("En-passant capture square should have piece. Position '{}', move {:?}", old_pos.to_fen(), self)
-                        });
+
+                        anti_move.move_type = AntiMoveType::EnPassant { cap: ep_capture };
+                        if let Some(pc_cap) = pos.del_piece(ep_capture) {
+                            debug_assert_eq!(
+                                pc_cap.col,
+                                pos.turn.flip(),
+                                "attempt to en passant wrong color, pos '{}', move {:?}",
+                                pos.to_fen(),
+                                self
+                            );
+                            anti_move.cap = Some(pc_cap.pc);
+                        } else {
+                            panic!(
+                                "En-passant capture square should have piece. Position '{}', move {:?}",
+                                pos.to_fen(),
+                                self
+                            );
+                        }
                    }
                } else {
-                    new_pos.half_moves += 1;
+                    pos.half_moves += 1;
                }

                if pc_dest.is_some() {
                    // captures are irreversible
-                    new_pos.half_moves = 0;
+                    pos.half_moves = 0;
                }

-                let castle = &mut new_pos.pl_castle_mut(pc_src.col);
+                let castle = &mut pos.pl_castle_mut(pc_src.col);
                if matches!(pc_src.pc, Piece::King) {
                    // forfeit castling rights
                    castle.k = false;
@ -203,8 +297,12 @@ impl Move {
                            .expect("rook castling src square should be valid");
                        let rook_dest = Square::from_row_col_signed(rook_row, rook_dest_col)
                            .expect("rook castling dest square should be valid");
-                        debug_assert!(new_pos.get_piece(rook_src).is_some(), "rook castling src square has no rook (move: {rook_src} -> {rook_dest})");
-                        new_pos.move_piece(rook_src, rook_dest);
+                        debug_assert!(pos.get_piece(rook_src).is_some(), "rook castling src square has no rook (move: {rook_src} -> {rook_dest})");
+                        anti_move.move_type = AntiMoveType::Castle {
+                            rook_src,
+                            rook_dest,
+                        };
+                        pos.move_piece(rook_src, rook_dest);
                    }
                    debug_assert!(
                        (0..=2).contains(&horiz_diff),
@ -217,40 +315,29 @@ impl Move {
                        Color::White => {
                            if self.src == Square(0) {
                                castle.q = false;
-                            } else if self.src == Square(BOARD_WIDTH - 1) {
+                            } else if self.src == Square::try_from(BOARD_WIDTH - 1).unwrap() {
                                castle.k = false;
                            };
                        }
                        Color::Black => {
-                            if self.src == Square((BOARD_HEIGHT - 1) * BOARD_WIDTH) {
+                            if self.src
+                                == Square::try_from((BOARD_HEIGHT - 1) * BOARD_WIDTH).unwrap()
+                            {
                                castle.q = false;
-                            } else if self.src == Square(N_SQUARES - 1) {
+                            } else if self.src == Square::try_from(N_SQUARES - 1).unwrap() {
                                castle.k = false;
                            };
                        }
                    }
                }

-                new_pos.move_piece(self.src, self.dest);
+                pos.move_piece(self.src, self.dest);
            }
-        }
+        };

-        new_pos.turn = new_pos.turn.flip();
+        pos.turn = pos.turn.flip();

-        new_pos
-    }
-
-    /// Make move and return new position.
-    ///
-    /// Old position is saved in a backlink.
-    /// No checking is done to verify even pseudo-legality of the move.
-    pub fn make(self, old_node: &Rc<Node>) -> Rc<Node> {
-        let pos = self.make_unlinked(old_node.pos);
-        Node {
-            prev: Some(Rc::clone(old_node)),
-            pos,
-        }
-        .into()
+        anti_move
    }
 }

@ -321,18 +408,21 @@ impl FromUCIAlgebraic for Move {
    }
 }

-/// Pseudo-legal move generation.
-///
-/// "Pseudo-legal" here means that moving into check (but not castling through check) is allowed,
-/// and capturing friendly pieces is allowed. These will be filtered out in the legal move
-/// generation step.
-pub trait PseudoMoveGen {
-    fn gen_pseudo_moves(&self) -> impl IntoIterator<Item = Move>;
+#[derive(Debug, Clone, Copy)]
+pub enum MoveGenType {
+    /// Legal move generation.
+    Legal,
+    /// Allow capturing friendly pieces, moving into check, but not castling through check.
+    Pseudo,
 }

-const DIRS_STRAIGHT: [(isize, isize); 4] = [(0, 1), (1, 0), (-1, 0), (0, -1)];
-const DIRS_DIAG: [(isize, isize); 4] = [(1, 1), (1, -1), (-1, 1), (-1, -1)];
-const DIRS_STAR: [(isize, isize); 8] = [
+pub trait MoveGen {
+    fn gen_moves(&mut self, gen_type: MoveGenType) -> impl IntoIterator<Item = Move>;
+}
+
+pub const DIRS_STRAIGHT: [(isize, isize); 4] = [(0, 1), (1, 0), (-1, 0), (0, -1)];
+pub const DIRS_DIAG: [(isize, isize); 4] = [(1, 1), (1, -1), (-1, 1), (-1, -1)];
+pub const DIRS_STAR: [(isize, isize); 8] = [
    (1, 1),
    (1, -1),
    (-1, 1),
@ -342,7 +432,7 @@ const DIRS_STAR: [(isize, isize); 8] = [
    (-1, 0),
    (0, -1),
 ];
-const DIRS_KNIGHT: [(isize, isize); 8] = [
+pub const DIRS_KNIGHT: [(isize, isize); 8] = [
    (2, 1),
    (1, 2),
    (-1, 2),
@ -370,7 +460,7 @@ enum SliderDirection {
 /// * `slide_type`: Directions the piece is allowed to go in.
 /// * `keep_going`: Allow sliding more than one square (true for everything except king).
 fn move_slider(
-    board: &BoardState,
+    board: &Board,
    src: Square,
    move_list: &mut Vec<Move>,
    slide_type: SliderDirection,
@ -413,9 +503,31 @@ fn move_slider(
        }
    }
 }
+fn is_legal(board: &mut Board, mv: Move) -> bool {
+    // mut required for check checking
+    // disallow friendly fire
+    let src_pc = board
+        .get_piece(mv.src)
+        .expect("move source should have piece");
+    if let Some(dest_pc) = board.get_piece(mv.dest) {
+        if dest_pc.col == src_pc.col {
+            return false;
+        }
+    }

-impl PseudoMoveGen for BoardState {
-    fn gen_pseudo_moves(&self) -> impl IntoIterator<Item = Move> {
+    // disallow moving into check
+    let anti_move = mv.make(board);
+    let is_check = board.is_check(board.turn.flip());
+    anti_move.unmake(board);
+    if is_check {
+        return false;
+    }
+
+    true
+}
+
+impl MoveGen for Board {
+    fn gen_moves(&mut self, gen_type: MoveGenType) -> impl IntoIterator<Item = Move> {
        let mut ret = Vec::new();
        let pl = self.pl(self.turn);
        macro_rules! squares {
@ -491,7 +603,7 @@ impl PseudoMoveGen for BoardState {
                    .map(|dest| {
                        let mut board = *self;
                        board.move_piece(src, dest);
-                        is_check(&board, self.turn)
+                        board.is_check(self.turn)
                    })
                    .any(|x| x);
                if is_any_checked {
@ -597,97 +709,26 @@ impl PseudoMoveGen for BoardState {
                }
            }
        }
-        ret
-    }
-}
-
-/// Legal move generation.
-pub trait LegalMoveGen {
-    fn gen_moves(&self) -> impl IntoIterator<Item = Move>;
-}
-
-/// Is a given player in check?
-fn is_check(board: &BoardState, pl: Color) -> bool {
-    for src in board.pl(pl).board(Piece::King).into_iter() {
-        macro_rules! detect_checker {
-            ($dirs: ident, $pc: ident, $keep_going: expr) => {
-                for dir in $dirs.into_iter() {
-                    let (mut r, mut c) = src.to_row_col_signed();
-                    loop {
-                        let (nr, nc) = (r + dir.0, c + dir.1);
-                        if let Ok(sq) = Square::from_row_col_signed(nr, nc) {
-                            if let Some(pc) = board.get_piece(sq) {
-                                if pc.pc == Piece::$pc && pc.col != pl {
-                                    return true;
-                                } else {
-                                    break;
-                                }
-                            }
-                        } else {
-                            break;
-                        }
-                        if (!($keep_going)) {
-                            break;
-                        }
-                        r = nr;
-                        c = nc;
-                    }
-                }
-            };
-        }
-
-        let dirs_white_pawn = [(-1, 1), (-1, -1)];
-        let dirs_black_pawn = [(1, 1), (1, -1)];
-
-        detect_checker!(DIRS_STAR, Queen, true);
-        detect_checker!(DIRS_DIAG, Bishop, true);
-        detect_checker!(DIRS_STRAIGHT, Rook, true);
-        detect_checker!(DIRS_STAR, King, false);
-        detect_checker!(DIRS_KNIGHT, Knight, false);
-        match pl {
-            Color::White => detect_checker!(dirs_black_pawn, Pawn, false),
-            Color::Black => detect_checker!(dirs_white_pawn, Pawn, false),
-        }
-    }
-    false
-}
-
-impl LegalMoveGen for Node {
-    fn gen_moves(&self) -> impl IntoIterator<Item = Move> {
-        self.pos
-            .gen_pseudo_moves()
-            .into_iter()
-            .filter(|mv| {
-                // disallow friendly fire
-                let src_pc = self
-                    .pos
-                    .get_piece(mv.src)
-                    .expect("move source should have piece");
-                if let Some(dest_pc) = self.pos.get_piece(mv.dest) {
-                    return dest_pc.col != src_pc.col;
-                }
-                true
-            })
-            .filter(|mv| {
-                // disallow moving into check
-                let new_pos = mv.make_unlinked(self.pos);
-                !is_check(&new_pos, self.pos.turn)
-            })
+        ret.into_iter().filter(move |mv| match gen_type {
+            MoveGenType::Legal => is_legal(self, *mv),
+            MoveGenType::Pseudo => true,
+        })
    }
 }

 /// How many nodes at depth N can be reached from this position.
-pub fn perft(depth: usize, node: &Rc<Node>) -> usize {
+pub fn perft(depth: usize, pos: &mut Board) -> usize {
    if depth == 0 {
        return 1;
    };

    let mut ans = 0;

-    let moves = node.gen_moves();
+    let moves: Vec<Move> = pos.gen_moves(MoveGenType::Legal).into_iter().collect();
    for mv in moves {
-        let new_node = mv.make(node);
-        ans += perft(depth - 1, &new_node);
+        let anti_move = mv.make(pos);
+        ans += perft(depth - 1, pos);
+        anti_move.unmake(pos);
    }

    ans
@ -696,21 +737,20 @@ pub fn perft(depth: usize, node: &Rc<Node>) -> usize {
 #[cfg(test)]
 mod tests {
    use super::*;
-    use crate::fen::{ToFen, START_POSITION};
+    use crate::fen::{FromFen, ToFen, START_POSITION};

    #[test]
    /// Ensure that bitboard properly reflects captures.
    fn test_bitboard_capture() {
-        let board = BoardState::from_fen("8/8/8/8/8/8/r7/R7 w - - 0 1").unwrap();
+        let mut pos = Board::from_fen("8/8/8/8/8/8/r7/R7 w - - 0 1").unwrap();
        let mv = Move::from_uci_algebraic("a1a2").unwrap();
-        // there's an assertion within make move that should
-        let new_pos = mv.make_unlinked(board);
+        let _anti_move = mv.make(&mut pos);

        use std::collections::hash_set::HashSet;
        use Piece::*;
        for pc in [Rook, Bishop, Knight, Queen, King, Pawn] {
-            let white: HashSet<_> = new_pos.pl(Color::White).board(pc).into_iter().collect();
-            let black: HashSet<_> = new_pos.pl(Color::Black).board(pc).into_iter().collect();
+            let white: HashSet<_> = pos.pl(Color::White).board(pc).into_iter().collect();
+            let black: HashSet<_> = pos.pl(Color::Black).board(pc).into_iter().collect();
            let intersect = white.intersection(&black).collect::<Vec<_>>();
            assert!(
                intersect.is_empty(),
@ -721,11 +761,9 @@ mod tests {
    }

    /// Helper to produce test cases.
-    fn decondense_moves(
-        test_case: (&str, Vec<(&str, Vec<&str>, MoveType)>),
-    ) -> (BoardState, Vec<Move>) {
+    fn decondense_moves(test_case: (&str, Vec<(&str, Vec<&str>, MoveType)>)) -> (Board, Vec<Move>) {
        let (fen, expected) = test_case;
-        let board = BoardState::from_fen(fen).unwrap();
+        let board = Board::from_fen(fen).unwrap();

        let mut expected_moves = expected
            .iter()
@ -749,7 +787,7 @@ mod tests {
    }

    /// Generate new test cases by flipping colors on existing ones.
-    fn flip_test_case(board: BoardState, moves: &Vec<Move>) -> (BoardState, Vec<Move>) {
+    fn flip_test_case(board: Board, moves: &Vec<Move>) -> (Board, Vec<Move>) {
        let mut move_vec = moves
            .iter()
            .map(|mv| Move {
@ -1007,8 +1045,8 @@ mod tests {
        let augmented_test_cases = test_cases.clone().map(|tc| flip_test_case(tc.0, &tc.1));
        let all_cases = [augmented_test_cases, test_cases].concat();

-        for (board, expected_moves) in all_cases {
-            let mut moves: Vec<Move> = board.gen_pseudo_moves().into_iter().collect();
+        for (mut board, expected_moves) in all_cases {
+            let mut moves: Vec<Move> = board.gen_moves(MoveGenType::Pseudo).into_iter().collect();
            moves.sort_unstable();
            let moves = moves;

@ -1044,17 +1082,12 @@ mod tests {

        let all_cases = check_cases.iter().chain(&not_check_cases);
        for (fen, expected) in all_cases {
-            let board = BoardState::from_fen(fen).unwrap();
-            assert_eq!(
-                is_check(&board, Color::White),
-                *expected,
-                "failed on {}",
-                fen
-            );
+            let board = Board::from_fen(fen).unwrap();
+            assert_eq!(board.is_check(Color::White), *expected, "failed on {}", fen);

            let board_anti = board.flip_colors();
            assert_eq!(
-                is_check(&board_anti, Color::Black),
+                board_anti.is_check(Color::Black),
                *expected,
                "failed on anti-version of {} ({})",
                fen,
@ -1163,14 +1196,12 @@ mod tests {

        let all_cases = [augmented_test_cases, test_cases].concat();

-        for (board, mut expected_moves) in all_cases {
+        for (mut board, mut expected_moves) in all_cases {
            eprintln!("on test '{}'", board.to_fen());
            expected_moves.sort_unstable();
            let expected_moves = expected_moves;

-            let node = Node::new(board);
-
-            let mut moves: Vec<Move> = node.gen_moves().into_iter().collect();
+            let mut moves: Vec<Move> = board.gen_moves(MoveGenType::Legal).into_iter().collect();
            moves.sort_unstable();
            let moves = moves;

@ -1236,6 +1267,14 @@ mod tests {
                    ),
                ],
            ),
+            // promotion unmake regression test
+            (
+                "r3k2r/Pppp1ppp/1b3nbN/nP6/BBPPP3/q4N2/Pp4PP/R2Q1RK1 b kq - 0 1",
+                vec![(
+                    "b2a1q",
+                    "r3k2r/Pppp1ppp/1b3nbN/nP6/BBPPP3/q4N2/P5PP/q2Q1RK1 w kq - 0 2",
+                )],
+            ),
            // castling rights test (kings)
            (
                "rnbqkbnr/pppp1ppp/8/4p3/4P3/8/PPPP1PPP/RNBQKBNR w KQkq - 0 2",
@ -1290,24 +1329,23 @@ mod tests {
        for (i, test_case) in test_cases.iter().enumerate() {
            let (start_pos, moves) = test_case;

-            // make move
            eprintln!("Starting test case {i}, make move.");
-            let mut node = Rc::new(Node::new(BoardState::from_fen(start_pos).unwrap()));
+            let mut pos = Board::from_fen(start_pos).unwrap();
            for (move_str, expect_fen) in moves {
+                let prior_fen = pos.to_fen();
                let mv = Move::from_uci_algebraic(move_str).unwrap();
-                eprintln!("Moving {move_str}.");
-                node = mv.make(&node);
-                assert_eq!(node.pos.to_fen(), expect_fen.to_string())
-            }
-
-            // unmake move
-            eprintln!("Starting test case {i}, unmake move.");
-            for (_, expect_fen) in moves.iter().rev().chain([("", *start_pos)].iter()) {
-                eprintln!("{}", expect_fen);
-                assert_eq!(*node.pos.to_fen(), expect_fen.to_string());
-                if *expect_fen != *start_pos {
-                    node = node.unmake();
-                }
+                eprintln!("Moving {move_str} on {}", prior_fen);
+                let anti_move = mv.make(&mut pos);
+                eprintln!("Unmaking {move_str} on {}.", pos.to_fen());
+                anti_move.unmake(&mut pos);
+                assert_eq!(
+                    pos.to_fen(),
+                    prior_fen.to_string(),
+                    "failed unmake with {anti_move:?}"
+                );
+                eprintln!("Remaking {move_str}.");
+                let _anti_move = mv.make(&mut pos);
+                assert_eq!(pos.to_fen(), expect_fen.to_string());
            }
        }
    }
@ -1353,18 +1391,18 @@ mod tests {
                3,
            ),
        ];
-        for (fen, expected_values, debug_limit_depth) in test_cases {
-            let root_node = Rc::new(Node::new(BoardState::from_fen(fen).unwrap()));
+        for (fen, expected_values, _debug_limit_depth) in test_cases {
+            let mut pos = Board::from_fen(fen).unwrap();

            for (depth, expected) in expected_values.iter().enumerate() {
                eprintln!("running perft depth {depth} on position '{fen}'");
                #[cfg(debug_assertions)]
                {
-                    if depth > debug_limit_depth {
+                    if depth > _debug_limit_depth {
                        break;
                    }
                }
-                assert_eq!(perft(depth, &root_node), *expected,);
+                assert_eq!(perft(depth, &mut pos), *expected,);
            }
        }
    }
Author	SHA1	Message	Date
dogeystamp	c2dcba81b8	chore: license	2024-10-25 22:30:03 -04:00
dogeystamp	3dac0e4388	refactor: make square idx size type a variable	2024-10-25 22:02:30 -04:00
dogeystamp	a36aa3b0c6	fix: compiler warnings	2024-10-25 21:34:33 -04:00
dogeystamp	3ed7f315c8	refactor: movegen	2024-10-25 21:25:38 -04:00
dogeystamp	e4b19b8bdd	fix: unmake broken	2024-10-25 20:26:41 -04:00
dogeystamp	21add6fec8	feat: debug tools for movegen/perft	2024-10-25 20:25:02 -04:00
dogeystamp	1b250f224d	test: movegen tool	2024-10-25 12:02:27 -04:00
dogeystamp	611cdd4d51	stub: proper make/unmake fails tests	2024-10-25 11:59:53 -04:00
dogeystamp	17bec263d9	perf: make_unlinked takes reference instead of ownership	2024-10-22 18:09:32 -04:00
dogeystamp	00bfbd7fbc	perf: remove redundant is_check direction for queen	2024-10-22 17:52:55 -04:00