i am a git main

COPYING

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://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 <http://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
+<http://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
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.

Makefile

@@ -0,0 +1,22 @@
+.PHONY: build serve clean scp
+
+build: chess.js main.js Makefile
+
+serve: build
+	python -m http.server
+
+upload: build
+	scp *.js *.html root@pyrope.net:/var/www/mysite/elo-worldle/
+
+# i'm so generous for putting random crap for you to see :]
+full-upload: build
+	scp * root@pyrope.net:/var/www/mysite/elo-worldle/
+
+clean: 
+	rm *.js
+
+# main.js: main.ts
+# 	tsc main.ts
+
+%.js: %.ts tsconfig.json
+	tsc

index.html

@@ -0,0 +1,122 @@
+<!DOCTYPE html>
+<html>
+    <head>
+        <title>Elo Worldle</title>
+        <script>var exports = {};</script>
+        <!-- <script defer src="chess.js"></script> -->
+        <script type="module" src="main.js"></script>
+        <script type="module" src="https://unpkg.com/gchessboard"></script>
+        <meta charset="UTF-8">
+        <meta name="viewport" content="width=device-width, initial-scale=1.0">
+        <link rel="stylesheet" href="./main.css"></link>
+        <style>
+            html {
+                background-color: #002121;
+                width: 100%;
+                height: 100%;
+            }
+            #board {
+                margin-left: auto;
+                margin-right: auto;
+                width:  calc(min(90vw, 90vh));
+                height: calc(min(90vw, 90vh));
+            }
+            #game-over, #stats, #copy-stats  {
+                display: none;
+                margin-left: auto;
+                margin-right: auto;
+                color: white;
+            }
+
+            #game-over {
+                text-align: center;
+                width: 100%;
+            }
+
+            #stats {
+                width: fit-content;
+                font-size: x-large;
+                font-weight: bold;
+                outline: 2px solid white;
+                margin-bottom: 0;
+            }
+
+            #copy-stats {
+                color: black;
+            }
+
+            #finish {
+                display: block;
+                margin-left: auto;
+                margin-right: auto;
+            }
+
+            :host {
+                --square-color-dark:  #86A666;
+                --square-color-light: #FFFFDD;   
+            }
+
+            h1, pre {
+                font-family: 'Courier New', Courier, monospace;
+            }
+
+            p {
+                font-family: 'Times New Roman', Times, serif;
+            }
+
+            #players, .player {
+                color: white;
+                margin-left: auto;
+                margin-right: auto;
+                text-align: center;
+            }
+
+            .strikethrough {
+                text-decoration: line-through;
+            }
+
+            .player {
+                width: fit-content;
+            }
+            .player-name {
+                cursor: pointer;
+                user-select: none;
+            }
+
+            .correct {
+                color: #538d4e;
+            }
+
+            .wrong {
+                color: #3a3a3c;
+                text-decoration: line-through;
+            }
+
+            g-chess-board::part(piece-wb) { background-image: url("./piece-wb.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-wr) { background-image: url("./piece-wr.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-wp) { background-image: url("./piece-wp.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-wn) { background-image: url("./piece-wn.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-wk) { background-image: url("./piece-wk.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-wq) { background-image: url("./piece-wq.png"); image-rendering: pixelated; }
+
+            g-chess-board::part(piece-bb) { background-image: url("./piece-bb.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-br) { background-image: url("./piece-br.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-bp) { background-image: url("./piece-bp.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-bn) { background-image: url("./piece-bn.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-bk) { background-image: url("./piece-bk.png"); image-rendering: pixelated; }
+            g-chess-board::part(piece-bq) { background-image: url("./piece-bq.png"); image-rendering: pixelated; }
+        </style>
+    </head>
+    <body>
+        <g-chess-board
+            id="board" fen="start" interactive turn="white"
+        ></g-chess-board>
+        <button style="display: none" id="finish">show me the answer please i toootally guessed already</button>
+        <h1 id="game-over"></h1>
+        <pre id="stats"></pre>
+        <button id="copy-stats">^ copy ^</button>
+        <div id="players">
+            <h1>Players: (click name to toggle strikethrough)</h1>
+        </div>
+    </body>
+</html>

main.js

@@ -0,0 +1,706 @@
+var _a;
+import { Chess, Ox88, DEFAULT_POSITION, SQUARES, rank, file, WHITE, BLACK, KING, } from "./chess.js";
+function with_move(board, move) {
+    let new_board = new Chess(board.fen());
+    new_board.move(move);
+    return new_board;
+}
+// function max_move_by(board: Chess, score: (_: Chess) => number): string {
+//     let best_score = 0;
+//     let best_move = "";
+//     for (const move in board.moves()) {
+//         let new_board = with_move(board, move);
+//         let new_score = score(new_board);
+//         if (
+//             new_score > best_score ||
+//             (new_score == new_score && Math.random() > 0.5)
+//         ) {
+//             best_score = new_score;
+//             best_move = move;
+//         }
+//     }
+//     return best_move;
+// }
+// could return early if zero but meh
+function min_move_by(board, score) {
+    let best_score = Infinity;
+    let best_move = "";
+    let moves = board.moves();
+    // console.log(moves);
+    for (const i in moves) {
+        let move = moves[i];
+        try {
+            let new_board = with_move(board, move);
+            let new_score = score(new_board);
+            // console.log({ move, best_score, new_score, best_move });
+            if (new_score < best_score ||
+                (new_score == best_score && Math.random() > 0.5)) {
+                console.log("New best (or equal): ", new_score, move);
+                best_score = new_score;
+                best_move = move;
+            }
+        }
+        catch (e) {
+            console.error(e);
+            continue;
+        }
+    }
+    return best_move;
+}
+// D --> movelist users (bad name whatever)
+const random_move = board => {
+    const moves = board.moves();
+    const move = moves[Math.floor(Math.random() * moves.length)];
+    return move;
+};
+function make_lexo(m) {
+    let { rank: src_row, file: src_col } = rank_and_file(m.from);
+    let { rank: dst_row, file: dst_col } = rank_and_file(m.to);
+    let promote_to = m.promotion;
+    return [src_row, src_col, dst_row, dst_col, promote_to];
+}
+function lexo_sort_moves(a, b) {
+    let al = make_lexo(a);
+    let bl = make_lexo(a);
+    for (const i in al) {
+        if (al[i] < bl[i]) {
+            return -1;
+        }
+        else if (al[i] > bl[i]) {
+            return 1;
+        }
+    }
+    return 0;
+}
+const first_move = board => {
+    const moves = board.moves({ verbose: true }).sort(lexo_sort_moves);
+    return moves[0].san;
+};
+const alphabetical = board => {
+    const moves = board.moves();
+    moves.sort();
+    return moves[0];
+};
+// i believe the actual one tracks things better (pawns are treated as different)
+// yeah this version sucks butttttt uh
+// yeah
+// prettier-ignore
+var equalizer_state = {
+    piece_moves: {
+        p: 0,
+        b: 0,
+        n: 0,
+        r: 0,
+        q: 0,
+        k: 0,
+    },
+    // bad
+    square_visits: {
+        a8: 0, b8: 0, c8: 0, d8: 0, e8: 0, f8: 0, g8: 0, h8: 0,
+        a7: 0, b7: 0, c7: 0, d7: 0, e7: 0, f7: 0, g7: 0, h7: 0,
+        a6: 0, b6: 0, c6: 0, d6: 0, e6: 0, f6: 0, g6: 0, h6: 0,
+        a5: 0, b5: 0, c5: 0, d5: 0, e5: 0, f5: 0, g5: 0, h5: 0,
+        a4: 0, b4: 0, c4: 0, d4: 0, e4: 0, f4: 0, g4: 0, h4: 0,
+        a3: 0, b3: 0, c3: 0, d3: 0, e3: 0, f3: 0, g3: 0, h3: 0,
+        a2: 0, b2: 0, c2: 0, d2: 0, e2: 0, f2: 0, g2: 0, h2: 0,
+        a1: 0, b1: 0, c1: 0, d1: 0, e1: 0, f1: 0, g1: 0, h1: 0
+    }
+};
+const equalizer = board => {
+    let best_move;
+    let least_moved_found = Infinity;
+    let least_visited_found = Infinity;
+    let piece_moving = "k";
+    let square_visiting = "a1";
+    // let least_moved = PIECE_SYMBOLS.sort(
+    //     (a, b) =>
+    //         equalizer_state.piece_moves[a] - equalizer_state.piece_moves[b]
+    // )[0];
+    // let least_visited = SQUARES.sort(
+    //     (a, b) =>
+    //         equalizer_state.square_visits[a] - equalizer_state.square_visits[b]
+    // )[0];
+    // cbb to do the proper randomness (23:41)
+    for (const move of board.moves({ verbose: true })) {
+        if (equalizer_state.piece_moves[move.piece] < least_moved_found ||
+            (equalizer_state.piece_moves[move.piece] == least_moved_found &&
+                equalizer_state.square_visits[move.to] < least_visited_found)) {
+            best_move = move;
+            least_moved_found = equalizer_state.piece_moves[move.piece];
+            least_visited_found = equalizer_state.square_visits[move.to];
+            piece_moving = move.piece;
+            square_visiting = move.to;
+        }
+    }
+    equalizer_state.piece_moves[piece_moving] += 1;
+    equalizer_state.square_visits[square_visiting] += 1;
+    return best_move.san;
+};
+// D --> min-maxxing some score of the board after moving
+const min_oppt_move = board => {
+    let num_moves = b => b.moves().length;
+    return min_move_by(board, num_moves);
+};
+function num_pieces_on_own_color(b) {
+    let count = 0;
+    for (const square of SQUARES) {
+        let piece = b.get(square);
+        if (typeof piece == "boolean") {
+            continue;
+        }
+        if (piece.color == b.squareColor(square)) {
+            count += 1;
+        }
+    }
+    return count;
+}
+const same_color = board => {
+    return min_move_by(board, b => 64 - num_pieces_on_own_color(b));
+};
+const opposite_color = board => {
+    return min_move_by(board, num_pieces_on_own_color);
+};
+function rank_and_file(s) {
+    return { rank: rank(Ox88[s]), file: file(Ox88[s]) };
+}
+function chebyshev_distance(a, b) {
+    let { rank: r1, file: f1 } = rank_and_file(a);
+    let { rank: r2, file: f2 } = rank_and_file(b);
+    // forgot the abs UGH
+    return Math.max(Math.abs(r2 - r1), Math.abs(f2 - f1));
+}
+const START_BOARD = new Chess(DEFAULT_POSITION);
+// good enough
+function move_distance(piece) {
+    let rank = rank_and_file(piece.square).rank;
+    let file = rank_and_file(piece.square).file;
+    switch (piece.type) {
+        case "k":
+            return chebyshev_distance(piece.square, find({ color: HUMAN_COLOR, type: "k" }, START_BOARD));
+        case "p":
+            return Math.abs(rank - 6);
+        case "r":
+            return (Math.abs(rank - 7) +
+                Math.min(Math.abs(file - 7), Math.abs(file - 0)));
+        case "n":
+            // inauthentic
+            return pieces_of_color(START_BOARD, HUMAN_COLOR)
+                .filter(p => p.type == "k")
+                .map(p => chebyshev_distance(piece.square, p.square))
+                .reduce((a, b) => Math.max(a, b));
+        case "b":
+            let is_black = START_BOARD.squareColor(piece.square) == "b";
+            let dest_col = is_black ? 2 : 5;
+            let dr = Math.abs(rank - 7);
+            let dc = Math.abs(file - dest_col);
+            return Math.max(dr, dc);
+        case "q":
+            return Math.max(Math.abs(rank - 7), Math.abs(file - 3));
+    }
+}
+// oh gosh i can do symmetry by making the "distance" just a score fn which
+// would... work but dang so many things have done something similar in hindsight
+// actually hm symmetry is weird
+function minimize_distances(distance_fn) {
+    const player_score = (board) => {
+        let total_distance = 0;
+        for (const piece of pieces_of_color(board, ROBOT_COLOR)) {
+            total_distance += distance_fn(piece);
+        }
+        return total_distance;
+    };
+    return b => min_move_by(b, player_score);
+}
+const reverse_starting = minimize_distances(move_distance);
+// or lens :]
+function mirror_player(mirror_fn) {
+    let player_score = (b) => {
+        // it's worrying how the strategies have shifted, before it was more
+        // common for them to weigh your pieces equally, meaning they might take
+        // them to make the score better; silver lining: a bit easier to tell
+        // apart potentially
+        // the penalties are taken from the og code (the last four are the ones
+        // where i finally figured out where to find the players (curse_you
+        // UpperCamelCase))
+        // the behavior is likely still slightly different
+        let total = 0;
+        for (const square of SQUARES) {
+            let reflected = mirror_fn(square);
+            console.log(square, reflected);
+            let piece = b.get(square);
+            let reflection = b.get(reflected);
+            if (typeof piece == "boolean" && typeof reflection == "boolean") {
+                continue;
+            }
+            if (typeof piece == "boolean") {
+                total += 10;
+                continue;
+            }
+            if (typeof reflection == "boolean") {
+                total += 10;
+                continue;
+            }
+            if (piece.color == reflection.color) {
+                total += 5;
+                continue;
+            }
+            if (piece.type != reflection.type) {
+                total += 1;
+                continue;
+            }
+        }
+        return total;
+    };
+    return b => min_move_by(b, player_score);
+}
+function rank_and_file_to_algebraic(rf) {
+    let r = "8";
+    let f = "h";
+    // vim's <C-a> was very helpful here :]
+    // I WAS MIRRORING AND THEN MIRRORING AGAIN OH MY GOOOOOSH
+    // prettier-ignore
+    switch (rf.rank) {
+        case 0:
+            r = "8";
+            break;
+        case 1:
+            r = "7";
+            break;
+        case 2:
+            r = "6";
+            break;
+        case 3:
+            r = "5";
+            break;
+        case 4:
+            r = "4";
+            break;
+        case 5:
+            r = "3";
+            break;
+        case 6:
+            r = "7";
+            break;
+        case 7:
+            r = "1";
+            break;
+    }
+    // prettier-ignore
+    switch (rf.file) {
+        case 0:
+            f = "a";
+            break;
+        case 1:
+            f = "b";
+            break;
+        case 2:
+            f = "c";
+            break;
+        case 3:
+            f = "d";
+            break;
+        case 4:
+            f = "e";
+            break;
+        case 5:
+            f = "f";
+            break;
+        case 6:
+            f = "g";
+            break;
+        case 7:
+            f = "h";
+            break;
+    }
+    return `${f}${r}`;
+}
+function mirror_y(s) {
+    let rf = rank_and_file(s);
+    rf.rank = 7 - rf.rank;
+    return rank_and_file_to_algebraic(rf);
+}
+const sym_mirror_y = mirror_player(mirror_y);
+function mirror_x(s) {
+    let rf = rank_and_file(s);
+    rf.file = 7 - rf.file;
+    return rank_and_file_to_algebraic(rf);
+}
+const sym_mirror_x = mirror_player(mirror_x);
+function flip(s) {
+    let rf = rank_and_file(s);
+    rf.rank = 7 - rf.rank;
+    rf.file = 7 - rf.file;
+    return rank_and_file_to_algebraic(rf);
+}
+const sym_180 = mirror_player(flip);
+function find(p, b) {
+    for (const square of SQUARES) {
+        let got = b.get(square);
+        if (typeof got == "boolean") {
+            continue;
+        }
+        if (got.color == p.color && got.type == p.type) {
+            return square;
+        }
+    }
+    console.log(`didn't find this :O ${p}`);
+    return null;
+}
+// maybe a find function would be useful Piece -> Board -> Square | null
+const suicide_king = board => {
+    let distance_between_kings = (b) => {
+        var _a, _b;
+        return chebyshev_distance((_a = find({ color: WHITE, type: KING }, b)) !== null && _a !== void 0 ? _a : "a1", (_b = find({ color: BLACK, type: KING }, b)) !== null && _b !== void 0 ? _b : "a1");
+    };
+    return min_move_by(board, distance_between_kings);
+};
+// cccp and pacifist are basically opposites
+// ugh not really
+function pieces_of_color(b, color) {
+    let flat_board = b.board().flat();
+    let non_empties = [];
+    for (const s of flat_board) {
+        if (typeof s == "boolean") {
+            continue;
+        }
+        non_empties.push(s);
+    }
+    return non_empties.filter(p => p.color == color);
+}
+function num_pieces_of_color(b, color) {
+    return pieces_of_color(b, color).length;
+}
+// see generous in http://tom7.org/chess/weak.pdf
+function value_piece(type) {
+    switch (type) {
+        case "p":
+            return 1;
+        case "b":
+        case "n":
+            return 3;
+        case "r":
+            return 5;
+        case "q":
+            return 9;
+        case "k":
+            // impossible (mostly)
+            // idk why i said this it's really not impossible lol
+            return 413;
+    }
+}
+function value_of_pieces_of_color(b, color) {
+    return pieces_of_color(b, color)
+        .map(p => value_piece(p.type))
+        .reduce((a, b) => a + b);
+}
+// hm
+const HUMAN_COLOR = WHITE;
+const ROBOT_COLOR = BLACK;
+// DONE: I THINK: UGH piece value
+const cccp = board => {
+    let cccp_score = (b) => {
+        if (b.isCheckmate()) {
+            console.log("Found checkmate! :D");
+            return 0;
+        }
+        if (b.isCheck()) {
+            console.log("Found check! :T");
+            return 1;
+        }
+        // maximize the difference in value
+        let prev_value = value_of_pieces_of_color(board, HUMAN_COLOR);
+        let new_value = value_of_pieces_of_color(b, HUMAN_COLOR);
+        if (new_value < prev_value) {
+            console.log("There's less human-colored pieces now! :)");
+            return 10 * (6 - (prev_value - new_value));
+        }
+        // sum the ranks of the robot pieces (brittle with piece colors changing which uhh just don't do that :))
+        // they are zero based oopsie
+        return (100 *
+            pieces_of_color(b, ROBOT_COLOR)
+                .map(b => 8 - rank_and_file(b.square).rank)
+                .reduce((a, b) => a + b));
+    };
+    return min_move_by(board, cccp_score);
+};
+// FIXME: function name is TOO short FIX
+function total_chebyshev_distances_of_pieces_of_color_to_square(board, color, square) {
+    return pieces_of_color(board, color)
+        .map(p => chebyshev_distance(p.square, square))
+        .reduce((a, b) => a + b);
+}
+const huddle = board => {
+    return min_move_by(board, b => {
+        var _a;
+        return total_chebyshev_distances_of_pieces_of_color_to_square(b, ROBOT_COLOR, (_a = find({ color: ROBOT_COLOR, type: KING }, b)) !== null && _a !== void 0 ? _a : "a1");
+    });
+};
+const swarm = board => {
+    return min_move_by(board, b => {
+        var _a;
+        return total_chebyshev_distances_of_pieces_of_color_to_square(b, ROBOT_COLOR, (_a = find({ color: HUMAN_COLOR, type: KING }, b)) !== null && _a !== void 0 ? _a : "a1");
+    });
+};
+function sum_of_possible_capture_value(b) {
+    let prev_value = value_of_pieces_of_color(b, ROBOT_COLOR);
+    let sum = 0;
+    for (const move of b.moves()) {
+        let new_board = with_move(b, move);
+        let new_value = value_of_pieces_of_color(new_board, ROBOT_COLOR);
+        // value only goes down..... pretty much
+        // but the negation is now done by the guys so
+        sum += prev_value - new_value;
+    }
+    return sum;
+}
+// surprisingly not too difficult
+const generous = board => {
+    // sum of the difference in ROBOT_COLOR piece value of all moves
+    // but like uhh negative
+    let generous_score = (b) => {
+        return -sum_of_possible_capture_value(b);
+    };
+    return min_move_by(board, generous_score);
+};
+const no_i_insist = board => {
+    let no_i_insist_score = (b) => {
+        if (b.isCheckmate()) {
+            return 612;
+        }
+        if (b.isCheck()) {
+            return 413;
+        }
+        let prev_value = value_of_pieces_of_color(b, ROBOT_COLOR);
+        return -(sum_of_possible_capture_value(b) / b.moves().length);
+    };
+    return min_move_by(board, no_i_insist_score);
+};
+const pacifist = board => {
+    let pacifist_score = b => {
+        if (b.isCheckmate()) {
+            return 612;
+        }
+        if (b.isCheck()) {
+            return 413;
+        }
+        let prev_value = value_of_pieces_of_color(board, HUMAN_COLOR);
+        let new_value = value_of_pieces_of_color(b, HUMAN_COLOR);
+        if (new_value < prev_value) {
+            return prev_value - new_value;
+        }
+        return 0;
+    };
+    return min_move_by(board, pacifist_score);
+};
+const players = [
+    {
+        f: random_move,
+        name: "random_move",
+        description: "Moves randomly, believe it or not.",
+    },
+    {
+        f: same_color,
+        name: "same_color",
+        description: "Makes the move that maximizes the number of pieces on their own color",
+    },
+    {
+        f: opposite_color,
+        name: "opposite_color",
+        description: "Behavior left as an exercise to the reader",
+    },
+    {
+        f: pacifist,
+        name: "pacifist",
+        description: "Avoids checkmate, then avoids checks, then avoids captures, if forced, captures the lowest value piece it can",
+    },
+    {
+        f: first_move,
+        name: "first_move",
+        description: "Makes the lexicographically first move based on [source_row, source_col, dest_row, dest_col, promotion]",
+    },
+    {
+        f: alphabetical,
+        name: "alphabetical",
+        description: "Makes the first move asciilphabetically (based on algebraic notation)",
+    },
+    {
+        f: huddle,
+        name: "huddle",
+        description: "Makes the move that minimizes the total Chebyshev distances from their pieces to their king",
+    },
+    {
+        f: swarm,
+        name: "swarm",
+        description: "Makes the move that minimizes the total Chebyshev distances from their pieces to YOUR king",
+    },
+    {
+        f: generous,
+        name: "generous",
+        description: "Maximizes the number of YOUR moves that take their pieces, weighting by value",
+    },
+    {
+        f: no_i_insist,
+        name: "no_i_insist",
+        description: "Maximizes the proportion of potential capture value of YOUR moves to the number of YOUR moves; very weird the way i've done it",
+    },
+    {
+        f: reverse_starting,
+        name: "reverse_starting",
+        description: "Makes the move that minimizes the number of moves it takes to move their pieces to the opposite end",
+    },
+    {
+        f: cccp,
+        name: "cccp",
+        description: "First checkmates, then checks, then captures (the best piece it can), then pushes",
+    },
+    {
+        f: suicide_king,
+        name: "suicide_king",
+        description: "Makes the move that minimizes the Chebyshev distance between the two kings",
+    },
+    {
+        f: sym_mirror_y,
+        name: "sym_mirror_y",
+        description: "Tries to make the board as vertically symmetric as possible (basically copies your moves)",
+    },
+    {
+        f: sym_mirror_x,
+        name: "sym_mirror_x",
+        description: "Tries to make the board as horizontally symmetric as possible (basically doesn't copy your moves or do anything useful)",
+    },
+    {
+        f: sym_180,
+        name: "sym_180",
+        description: "Tries to make the board as symmetric as possible when flipped around",
+    },
+    {
+        f: min_oppt_move,
+        name: "min_oppt_move",
+        description: "Does the move that leaves the least moves for YOU",
+    },
+    {
+        f: equalizer,
+        name: "equalizer",
+        description: "Moves the least moved piece (actually piece type, e.g. moving a pawn counts for all pawns; it sucks, i know), breaking ties by moving to the least visited square",
+    },
+    // alphabetical is fine i guess, since the checklist order has little to do with the og paper
+    // ehhh nvm
+]; //.sort((a, b) => a.name.localeCompare(b.name));
+// https://stackoverflow.com/questions/12739171/javascript-epoch-time-in-days
+function days_since_epoch() {
+    var now = new Date().getMilliseconds();
+    return Math.floor(now / 8.64e7);
+}
+function find_specified_in_hash() {
+    return players.find(p => `#${p.name}` == window.location.hash);
+}
+// bad
+// const todays_player = players[days_since_epoch() % players.length];
+const todays_player = (_a = find_specified_in_hash()) !== null && _a !== void 0 ? _a : players[Math.floor(Math.random() * players.length)];
+console.log(`SPOILER: today's player is ${todays_player.name}`);
+// const todays_player = min_oppt_move;
+const board = document.getElementById("board");
+const game = new Chess();
+function computer_move() {
+    num_moves++;
+    console.log(num_moves);
+    return todays_player.f(game);
+}
+// might want to change this when it's more wordly
+function show_game_over() {
+    let game_over = document.getElementById("game-over");
+    game_over.style.display = "block";
+    game_over.innerText = `GAME OVER; player was ${todays_player.name}`;
+    console.log("GAME OVER");
+}
+function show_win() {
+    let game_over = document.getElementById("game-over");
+    game_over.style.display = "block";
+    game_over.innerText = "YOU WIN YOU WIN YOU WIN YOU WIN HOLY CRAP";
+    let stats = document.getElementById("stats");
+    stats.style.display = "block";
+    let stats_text = `#EloWorldle413\nGuesses: ${num_guesses}\nMoves:   ${num_moves}`;
+    stats.innerText = stats_text;
+    let copy_stats = document.getElementById("copy-stats");
+    copy_stats.style.display = "block";
+    copy_stats.addEventListener("click", _ => navigator.clipboard.writeText(stats_text));
+    console.log("PLAYER IS WIN");
+}
+var num_guesses = 0;
+var num_moves = 0;
+function append_players_to(n) {
+    for (const player of players) {
+        let child = document.createElement("div");
+        child.classList.add("player");
+        let child_name = document.createElement("h1");
+        child_name.classList.add("player-name");
+        child_name.innerText = player.name;
+        let child_desc = document.createElement("p");
+        child_desc.classList.add("player-desc");
+        child_desc.innerText = player.description;
+        let guess_button = document.createElement("button");
+        guess_button.innerText = "^ guess ^";
+        guess_button.onclick = _ => {
+            num_guesses++;
+            if (todays_player.name == player.name) {
+                show_win();
+                child.classList.add("correct");
+            }
+            else {
+                child.classList.add("wrong");
+            }
+            guess_button.onclick = () => { };
+        };
+        child.appendChild(child_name);
+        child.appendChild(child_desc);
+        child.appendChild(guess_button);
+        child_name.addEventListener("click", _ => child.classList.toggle("strikethrough"));
+        n.appendChild(child);
+    }
+}
+window.addEventListener("DOMContentLoaded", () => {
+    board.addEventListener("movestart", (e) => {
+        console.log(`Move started: ${e.detail.from}, ${e.detail.piece.color} ${e.detail.piece.pieceType}`);
+        e.detail.setTargets(
+        // This produces a list like ["e3", "e5"]
+        game.moves({ square: e.detail.from, verbose: true }).map(m => m.to));
+        if (game.isGameOver()) {
+            show_game_over();
+        }
+    });
+    board.addEventListener("moveend", (e) => {
+        console.log(`Move ending: ${e.detail.from} -> ${e.detail.to}, ${e.detail.piece.color} ${e.detail.piece.pieceType}`);
+        const move = game.move({
+            from: e.detail.from,
+            to: e.detail.to,
+            promotion: "q",
+        });
+        if (move === null) {
+            e.preventDefault();
+        }
+        if (game.isGameOver()) {
+            show_game_over();
+        }
+    });
+    board.addEventListener("movefinished", (e) => {
+        board.fen = game.fen();
+        board.turn = game.turn() === "w" ? "white" : "black";
+        board.interactive = game.turn() === "w";
+        if (!board.interactive) {
+            let move = computer_move();
+            if (!move) {
+                console.log("Didn't get a move from the computer (this is fine if the game is over)");
+                return;
+            }
+            console.log(`Computer move: ${move}`);
+            game.move(move);
+            board.fen = game.fen();
+            board.turn = "white";
+            board.interactive = true;
+        }
+    });
+    document
+        .getElementById("finish")
+        .addEventListener("click", _ => show_game_over());
+    append_players_to(document.getElementById("players"));
+});

main.ts

@@ -0,0 +1,858 @@
+import {
+    Chess,
+    Move,
+    Square,
+    Ox88,
+    DEFAULT_POSITION,
+    SQUARES,
+    rank,
+    file,
+    Piece,
+    WHITE,
+    BLACK,
+    KING,
+    PieceSymbol,
+    Color,
+    PIECE_SYMBOLS,
+} from "./chess.js";
+
+type Player = (_: Chess) => string;
+
+function with_move(board: Chess, move: string): Chess {
+    let new_board = new Chess(board.fen());
+    new_board.move(move);
+    return new_board;
+}
+
+// function max_move_by(board: Chess, score: (_: Chess) => number): string {
+//     let best_score = 0;
+//     let best_move = "";
+
+//     for (const move in board.moves()) {
+//         let new_board = with_move(board, move);
+//         let new_score = score(new_board);
+
+//         if (
+//             new_score > best_score ||
+//             (new_score == new_score && Math.random() > 0.5)
+//         ) {
+//             best_score = new_score;
+//             best_move = move;
+//         }
+//     }
+
+//     return best_move;
+// }
+
+// could return early if zero but meh
+function min_move_by(board: Chess, score: (_: Chess) => number): string {
+    let best_score = Infinity;
+    let best_move = "";
+
+    let moves = board.moves();
+    // console.log(moves);
+    for (const i in moves) {
+        let move = moves[i];
+        try {
+            let new_board = with_move(board, move);
+            let new_score = score(new_board);
+            // console.log({ move, best_score, new_score, best_move });
+
+            if (
+                new_score < best_score ||
+                (new_score == best_score && Math.random() > 0.5)
+            ) {
+                console.log("New best (or equal): ", new_score, move);
+                best_score = new_score;
+                best_move = move;
+            }
+        } catch (e) {
+            console.error(e);
+            continue;
+        }
+    }
+    return best_move;
+}
+
+// D --> movelist users (bad name whatever)
+const random_move: Player = board => {
+    const moves = board.moves();
+    const move = moves[Math.floor(Math.random() * moves.length)];
+    return move;
+};
+
+function make_lexo(m: Move): [number, number, number, number, PieceSymbol] {
+    let { rank: src_row, file: src_col } = rank_and_file(m.from);
+    let { rank: dst_row, file: dst_col } = rank_and_file(m.to);
+    let promote_to = m.promotion;
+
+    return [src_row, src_col, dst_row, dst_col, promote_to];
+}
+
+function lexo_sort_moves(a: Move, b: Move): -1 | 0 | 1 {
+    let al = make_lexo(a);
+    let bl = make_lexo(a);
+    for (const i in al) {
+        if (al[i] < bl[i]) {
+            return -1;
+        } else if (al[i] > bl[i]) {
+            return 1;
+        }
+    }
+
+    return 0;
+}
+
+const first_move: Player = board => {
+    const moves = board.moves({ verbose: true }).sort(lexo_sort_moves);
+    return moves[0].san;
+};
+
+const alphabetical: Player = board => {
+    const moves = board.moves();
+    moves.sort();
+
+    return moves[0];
+};
+
+// i believe the actual one tracks things better (pawns are treated as different)
+// yeah this version sucks butttttt uh
+// yeah
+// prettier-ignore
+var equalizer_state: {
+    piece_moves: Record<PieceSymbol, number>;
+    square_visits: Record<Square, number>;
+} = {
+    piece_moves: {
+        p: 0,
+        b: 0,
+        n: 0,
+        r: 0,
+        q: 0,
+        k: 0,
+    },
+    // bad
+    square_visits: {
+        a8: 0, b8: 0, c8: 0, d8: 0, e8: 0, f8: 0, g8: 0, h8: 0,
+        a7: 0, b7: 0, c7: 0, d7: 0, e7: 0, f7: 0, g7: 0, h7: 0,
+        a6: 0, b6: 0, c6: 0, d6: 0, e6: 0, f6: 0, g6: 0, h6: 0,
+        a5: 0, b5: 0, c5: 0, d5: 0, e5: 0, f5: 0, g5: 0, h5: 0,
+        a4: 0, b4: 0, c4: 0, d4: 0, e4: 0, f4: 0, g4: 0, h4: 0,
+        a3: 0, b3: 0, c3: 0, d3: 0, e3: 0, f3: 0, g3: 0, h3: 0,
+        a2: 0, b2: 0, c2: 0, d2: 0, e2: 0, f2: 0, g2: 0, h2: 0,
+        a1: 0, b1: 0, c1: 0, d1: 0, e1: 0, f1: 0, g1: 0, h1: 0
+    }
+};
+
+const equalizer: Player = board => {
+    let best_move: Move;
+    let least_moved_found = Infinity;
+    let least_visited_found = Infinity;
+    let piece_moving: PieceSymbol = "k";
+    let square_visiting: Square = "a1";
+
+    // let least_moved = PIECE_SYMBOLS.sort(
+    //     (a, b) =>
+    //         equalizer_state.piece_moves[a] - equalizer_state.piece_moves[b]
+    // )[0];
+    // let least_visited = SQUARES.sort(
+    //     (a, b) =>
+    //         equalizer_state.square_visits[a] - equalizer_state.square_visits[b]
+    // )[0];
+
+    // cbb to do the proper randomness (23:41)
+    for (const move of board.moves({ verbose: true })) {
+        if (
+            equalizer_state.piece_moves[move.piece] < least_moved_found ||
+            (equalizer_state.piece_moves[move.piece] == least_moved_found &&
+                equalizer_state.square_visits[move.to] < least_visited_found)
+        ) {
+            best_move = move;
+            least_moved_found = equalizer_state.piece_moves[move.piece];
+            least_visited_found = equalizer_state.square_visits[move.to];
+            piece_moving = move.piece;
+            square_visiting = move.to;
+        }
+    }
+
+    equalizer_state.piece_moves[piece_moving] += 1;
+    equalizer_state.square_visits[square_visiting] += 1;
+
+    return best_move.san;
+};
+
+// D --> min-maxxing some score of the board after moving
+const min_oppt_move: Player = board => {
+    let num_moves = b => b.moves().length;
+    return min_move_by(board, num_moves);
+};
+
+function num_pieces_on_own_color(b: Chess): number {
+    let count = 0;
+    for (const square of SQUARES) {
+        let piece = b.get(square);
+        if (typeof piece == "boolean") {
+            continue;
+        }
+        if (piece.color == b.squareColor(square)) {
+            count += 1;
+        }
+    }
+    return count;
+}
+
+const same_color: Player = board => {
+    return min_move_by(board, b => 64 - num_pieces_on_own_color(b));
+};
+
+const opposite_color: Player = board => {
+    return min_move_by(board, num_pieces_on_own_color);
+};
+
+function rank_and_file(s: Square): { rank: number; file: number } {
+    return { rank: rank(Ox88[s]), file: file(Ox88[s]) };
+}
+
+function chebyshev_distance(a: Square, b: Square): number {
+    let { rank: r1, file: f1 } = rank_and_file(a);
+    let { rank: r2, file: f2 } = rank_and_file(b);
+    // forgot the abs UGH
+    return Math.max(Math.abs(r2 - r1), Math.abs(f2 - f1));
+}
+
+const START_BOARD: Chess = new Chess(DEFAULT_POSITION);
+
+// good enough
+function move_distance(piece: { square: Square; type: PieceSymbol }): number {
+    let rank = rank_and_file(piece.square).rank;
+    let file = rank_and_file(piece.square).file;
+    switch (piece.type) {
+        case "k":
+            return chebyshev_distance(
+                piece.square,
+                find({ color: HUMAN_COLOR, type: "k" }, START_BOARD)
+            );
+        case "p":
+            return Math.abs(rank - 6);
+        case "r":
+            return (
+                Math.abs(rank - 7) +
+                Math.min(Math.abs(file - 7), Math.abs(file - 0))
+            );
+        case "n":
+            // inauthentic
+            return pieces_of_color(START_BOARD, HUMAN_COLOR)
+                .filter(p => p.type == "k")
+                .map(p => chebyshev_distance(piece.square, p.square))
+                .reduce((a, b) => Math.max(a, b));
+        case "b":
+            let is_black = START_BOARD.squareColor(piece.square) == "b";
+            let dest_col = is_black ? 2 : 5;
+            let dr = Math.abs(rank - 7);
+            let dc = Math.abs(file - dest_col);
+            return Math.max(dr, dc);
+        case "q":
+            return Math.max(Math.abs(rank - 7), Math.abs(file - 3));
+    }
+}
+
+// oh gosh i can do symmetry by making the "distance" just a score fn which
+// would... work but dang so many things have done something similar in hindsight
+// actually hm symmetry is weird
+function minimize_distances(
+    distance_fn: (piece: { square: Square; type: PieceSymbol }) => number
+): Player {
+    const player_score = (board: Chess) => {
+        let total_distance = 0;
+
+        for (const piece of pieces_of_color(board, ROBOT_COLOR)) {
+            total_distance += distance_fn(piece);
+        }
+
+        return total_distance;
+    };
+
+    return b => min_move_by(b, player_score);
+}
+
+const reverse_starting: Player = minimize_distances(move_distance);
+
+// or lens :]
+function mirror_player(mirror_fn: (_: Square) => Square): Player {
+    let player_score = (b: Chess) => {
+        // it's worrying how the strategies have shifted, before it was more
+        // common for them to weigh your pieces equally, meaning they might take
+        // them to make the score better; silver lining: a bit easier to tell
+        // apart potentially
+
+        // the penalties are taken from the og code (the last four are the ones
+        // where i finally figured out where to find the players (curse_you
+        // UpperCamelCase))
+        // the behavior is likely still slightly different
+        let total = 0;
+        for (const square of SQUARES) {
+            let reflected = mirror_fn(square);
+            console.log(square, reflected);
+            let piece = b.get(square);
+            let reflection = b.get(reflected);
+
+            if (typeof piece == "boolean" && typeof reflection == "boolean") {
+                continue;
+            }
+
+            if (typeof piece == "boolean") {
+                total += 10;
+                continue;
+            }
+
+            if (typeof reflection == "boolean") {
+                total += 10;
+                continue;
+            }
+
+            if (piece.color == reflection.color) {
+                total += 5;
+                continue;
+            }
+
+            if (piece.type != reflection.type) {
+                total += 1;
+                continue;
+            }
+        }
+
+        return total;
+    };
+
+    return b => min_move_by(b, player_score);
+}
+
+function rank_and_file_to_algebraic(rf: {
+    rank: number;
+    file: number;
+}): Square {
+    let r: "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" = "8";
+    let f: "a" | "b" | "c" | "d" | "e" | "f" | "g" | "h" = "h";
+
+    // vim's <C-a> was very helpful here :]
+    // I WAS MIRRORING AND THEN MIRRORING AGAIN OH MY GOOOOOSH
+    // prettier-ignore
+    switch (rf.rank) {
+        case 0: r = "8"; break;
+        case 1: r = "7"; break;
+        case 2: r = "6"; break;
+        case 3: r = "5"; break;
+        case 4: r = "4"; break;
+        case 5: r = "3"; break;
+        case 6: r = "7"; break;
+        case 7: r = "1"; break;
+    }
+
+    // prettier-ignore
+    switch (rf.file) {
+        case 0: f = "a"; break;
+        case 1: f = "b"; break;
+        case 2: f = "c"; break;
+        case 3: f = "d"; break;
+        case 4: f = "e"; break;
+        case 5: f = "f"; break;
+        case 6: f = "g"; break;
+        case 7: f = "h"; break;
+    }
+
+    return `${f}${r}`;
+}
+
+function mirror_y(s: Square): Square {
+    let rf = rank_and_file(s);
+    rf.rank = 7 - rf.rank;
+    return rank_and_file_to_algebraic(rf);
+}
+
+const sym_mirror_y: Player = mirror_player(mirror_y);
+
+function mirror_x(s: Square): Square {
+    let rf = rank_and_file(s);
+    rf.file = 7 - rf.file;
+    return rank_and_file_to_algebraic(rf);
+}
+
+const sym_mirror_x: Player = mirror_player(mirror_x);
+
+function flip(s: Square): Square {
+    let rf = rank_and_file(s);
+    rf.rank = 7 - rf.rank;
+    rf.file = 7 - rf.file;
+    return rank_and_file_to_algebraic(rf);
+}
+
+const sym_180: Player = mirror_player(flip);
+
+function find(p: Piece, b: Chess): Square | null {
+    for (const square of SQUARES) {
+        let got = b.get(square);
+        if (typeof got == "boolean") {
+            continue;
+        }
+        if (got.color == p.color && got.type == p.type) {
+            return square;
+        }
+    }
+    console.log(`didn't find this :O ${p}`);
+    return null;
+}
+
+// maybe a find function would be useful Piece -> Board -> Square | null
+const suicide_king: Player = board => {
+    let distance_between_kings = (b: Chess) =>
+        chebyshev_distance(
+            find({ color: WHITE, type: KING }, b) ?? "a1",
+            find({ color: BLACK, type: KING }, b) ?? "a1"
+        );
+    return min_move_by(board, distance_between_kings);
+};
+
+// cccp and pacifist are basically opposites
+// ugh not really
+
+function pieces_of_color(
+    b: Chess,
+    color: Color
+): { square: Square; type: PieceSymbol; color: Color }[] {
+    let flat_board = b.board().flat();
+    let non_empties: { square: Square; type: PieceSymbol; color: Color }[] = [];
+    for (const s of flat_board) {
+        if (typeof s == "boolean") {
+            continue;
+        }
+        non_empties.push(s);
+    }
+
+    return non_empties.filter(p => p.color == color);
+}
+
+function num_pieces_of_color(b: Chess, color: Color): number {
+    return pieces_of_color(b, color).length;
+}
+// see generous in http://tom7.org/chess/weak.pdf
+function value_piece(type: PieceSymbol): number {
+    switch (type) {
+        case "p":
+            return 1;
+        case "b":
+        case "n":
+            return 3;
+        case "r":
+            return 5;
+        case "q":
+            return 9;
+        case "k":
+            // impossible (mostly)
+            // idk why i said this it's really not impossible lol
+            return 413;
+    }
+}
+function value_of_pieces_of_color(b: Chess, color: Color): number {
+    return pieces_of_color(b, color)
+        .map(p => value_piece(p.type))
+        .reduce((a, b) => a + b);
+}
+
+// hm
+const HUMAN_COLOR: Color = WHITE;
+const ROBOT_COLOR: Color = BLACK;
+
+// DONE: I THINK: UGH piece value
+const cccp: Player = board => {
+    let cccp_score = (b: Chess) => {
+        if (b.isCheckmate()) {
+            console.log("Found checkmate! :D");
+            return 0;
+        }
+        if (b.isCheck()) {
+            console.log("Found check! :T");
+            return 1;
+        }
+        // maximize the difference in value
+        let prev_value = value_of_pieces_of_color(board, HUMAN_COLOR);
+        let new_value = value_of_pieces_of_color(b, HUMAN_COLOR);
+        if (new_value < prev_value) {
+            console.log("There's less human-colored pieces now! :)");
+            return 10 * (6 - (prev_value - new_value));
+        }
+        // sum the ranks of the robot pieces (brittle with piece colors changing which uhh just don't do that :))
+        // they are zero based oopsie
+        return (
+            100 *
+            pieces_of_color(b, ROBOT_COLOR)
+                .map(b => 8 - rank_and_file(b.square).rank)
+                .reduce((a, b) => a + b)
+        );
+    };
+    return min_move_by(board, cccp_score);
+};
+
+// FIXME: function name is TOO short FIX
+function total_chebyshev_distances_of_pieces_of_color_to_square(
+    board: Chess,
+    color: Color,
+    square: Square
+): number {
+    return pieces_of_color(board, color)
+        .map(p => chebyshev_distance(p.square, square))
+        .reduce((a, b) => a + b);
+}
+
+const huddle: Player = board => {
+    return min_move_by(board, b =>
+        total_chebyshev_distances_of_pieces_of_color_to_square(
+            b,
+            ROBOT_COLOR,
+            find({ color: ROBOT_COLOR, type: KING }, b) ?? "a1"
+        )
+    );
+};
+
+const swarm: Player = board => {
+    return min_move_by(board, b =>
+        total_chebyshev_distances_of_pieces_of_color_to_square(
+            b,
+            ROBOT_COLOR,
+            find({ color: HUMAN_COLOR, type: KING }, b) ?? "a1"
+        )
+    );
+};
+
+function sum_of_possible_capture_value(b: Chess): number {
+    let prev_value = value_of_pieces_of_color(b, ROBOT_COLOR);
+
+    let sum = 0;
+    for (const move of b.moves()) {
+        let new_board = with_move(b, move);
+        let new_value = value_of_pieces_of_color(new_board, ROBOT_COLOR);
+        // value only goes down..... pretty much
+        // but the negation is now done by the guys so
+        sum += prev_value - new_value;
+    }
+
+    return sum;
+}
+
+// surprisingly not too difficult
+const generous: Player = board => {
+    // sum of the difference in ROBOT_COLOR piece value of all moves
+    // but like uhh negative
+    let generous_score = (b: Chess) => {
+        return -sum_of_possible_capture_value(b);
+    };
+
+    return min_move_by(board, generous_score);
+};
+
+const no_i_insist: Player = board => {
+    let no_i_insist_score = (b: Chess) => {
+        if (b.isCheckmate()) {
+            return 612;
+        }
+        if (b.isCheck()) {
+            return 413;
+        }
+        let prev_value = value_of_pieces_of_color(b, ROBOT_COLOR);
+        return -(sum_of_possible_capture_value(b) / b.moves().length);
+    };
+
+    return min_move_by(board, no_i_insist_score);
+};
+
+const pacifist: Player = board => {
+    let pacifist_score = b => {
+        if (b.isCheckmate()) {
+            return 612;
+        }
+        if (b.isCheck()) {
+            return 413;
+        }
+
+        let prev_value = value_of_pieces_of_color(board, HUMAN_COLOR);
+        let new_value = value_of_pieces_of_color(b, HUMAN_COLOR);
+        if (new_value < prev_value) {
+            return prev_value - new_value;
+        }
+
+        return 0;
+    };
+
+    return min_move_by(board, pacifist_score);
+};
+
+const players = [
+    {
+        f: random_move,
+        name: "random_move",
+        description: "Moves randomly, believe it or not.",
+    },
+    {
+        f: same_color,
+        name: "same_color",
+        description:
+            "Makes the move that maximizes the number of pieces on their own color",
+    },
+    {
+        f: opposite_color,
+        name: "opposite_color",
+        description: "Behavior left as an exercise to the reader",
+    },
+    {
+        f: pacifist,
+        name: "pacifist",
+        description:
+            "Avoids checkmate, then avoids checks, then avoids captures, if forced, captures the lowest value piece it can",
+    },
+    {
+        f: first_move,
+        name: "first_move",
+        description:
+            "Makes the lexicographically first move based on [source_row, source_col, dest_row, dest_col, promotion]",
+    },
+    {
+        f: alphabetical,
+        name: "alphabetical",
+        description:
+            "Makes the first move asciilphabetically (based on algebraic notation)",
+    },
+    {
+        f: huddle,
+        name: "huddle",
+        description:
+            "Makes the move that minimizes the total Chebyshev distances from their pieces to their king",
+    },
+    {
+        f: swarm,
+        name: "swarm",
+        description:
+            "Makes the move that minimizes the total Chebyshev distances from their pieces to YOUR king",
+    },
+    {
+        f: generous,
+        name: "generous",
+        description:
+            "Maximizes the number of YOUR moves that take their pieces, weighting by value",
+    },
+    {
+        f: no_i_insist,
+        name: "no_i_insist",
+        description:
+            "Maximizes the proportion of potential capture value of YOUR moves to the number of YOUR moves; very weird the way i've done it",
+    },
+    {
+        f: reverse_starting,
+        name: "reverse_starting",
+        description:
+            "Makes the move that minimizes the number of moves it takes to move their pieces to the opposite end",
+    },
+    {
+        f: cccp,
+        name: "cccp",
+        description:
+            "First checkmates, then checks, then captures (the best piece it can), then pushes",
+    },
+    {
+        f: suicide_king,
+        name: "suicide_king",
+        description:
+            "Makes the move that minimizes the Chebyshev distance between the two kings",
+    },
+    {
+        f: sym_mirror_y,
+        name: "sym_mirror_y",
+        description:
+            "Tries to make the board as vertically symmetric as possible (basically copies your moves)",
+    },
+    {
+        f: sym_mirror_x,
+        name: "sym_mirror_x",
+        description:
+            "Tries to make the board as horizontally symmetric as possible (basically doesn't copy your moves or do anything useful)",
+    },
+    {
+        f: sym_180,
+        name: "sym_180",
+        description:
+            "Tries to make the board as symmetric as possible when flipped around",
+    },
+    {
+        f: min_oppt_move,
+        name: "min_oppt_move",
+        description: "Does the move that leaves the least moves for YOU",
+    },
+    {
+        f: equalizer,
+        name: "equalizer",
+        description:
+            "Moves the least moved piece (actually piece type, e.g. moving a pawn counts for all pawns; it sucks, i know), breaking ties by moving to the least visited square",
+    },
+    // alphabetical is fine i guess, since the checklist order has little to do with the og paper
+    // ehhh nvm
+]; //.sort((a, b) => a.name.localeCompare(b.name));
+
+// https://stackoverflow.com/questions/12739171/javascript-epoch-time-in-days
+
+function days_since_epoch() {
+    var now = new Date().getMilliseconds();
+    return Math.floor(now / 8.64e7);
+}
+
+function find_specified_in_hash(): null | {
+    f: Player;
+    name: string;
+    description: string;
+} {
+    return players.find(p => `#${p.name}` == window.location.hash);
+}
+
+// bad
+// const todays_player = players[days_since_epoch() % players.length];
+const todays_player =
+    find_specified_in_hash() ??
+    players[Math.floor(Math.random() * players.length)];
+
+console.log(`SPOILER: today's player is ${todays_player.name}`);
+// const todays_player = min_oppt_move;
+
+const board: any = document.getElementById("board");
+
+const game = new Chess();
+
+function computer_move() {
+    num_moves++;
+    return todays_player.f(game);
+}
+
+// might want to change this when it's more wordly
+function show_game_over() {
+    let game_over = document.getElementById("game-over");
+    game_over.style.display = "block";
+    game_over.innerText = `GAME OVER; player was ${todays_player.name}`;
+
+    console.log("GAME OVER");
+}
+
+function show_win() {
+    let game_over = document.getElementById("game-over");
+    game_over.style.display = "block";
+    game_over.innerText = "YOU WIN YOU WIN YOU WIN YOU WIN HOLY CRAP";
+
+    let stats = document.getElementById("stats");
+    stats.style.display = "block";
+    let stats_text = `#EloWorldle413\nGuesses: ${num_guesses}\nMoves:   ${num_moves}`;
+    stats.innerText = stats_text;
+
+    let copy_stats = document.getElementById("copy-stats");
+    copy_stats.style.display = "block";
+    copy_stats.addEventListener("click", _ =>
+        navigator.clipboard.writeText(stats_text)
+    );
+
+    console.log("PLAYER IS WIN");
+}
+
+var num_guesses = 0;
+var num_moves = 0;
+
+function append_players_to(n: Node) {
+    for (const player of players) {
+        let child = document.createElement("div");
+        child.classList.add("player");
+
+        let child_name = document.createElement("h1");
+        child_name.classList.add("player-name");
+        child_name.innerText = player.name;
+
+        let child_desc = document.createElement("p");
+        child_desc.classList.add("player-desc");
+        child_desc.innerText = player.description;
+
+        let guess_button = document.createElement("button");
+        guess_button.innerText = "^ guess ^";
+
+        guess_button.onclick = _ => {
+            num_guesses++;
+            if (todays_player.name == player.name) {
+                show_win();
+                child.classList.add("correct");
+            } else {
+                child.classList.add("wrong");
+            }
+            guess_button.onclick = () => {};
+        };
+
+        child.appendChild(child_name);
+        child.appendChild(child_desc);
+        child.appendChild(guess_button);
+        child_name.addEventListener("click", _ =>
+            child.classList.toggle("strikethrough")
+        );
+        n.appendChild(child);
+    }
+}
+
+window.addEventListener("DOMContentLoaded", () => {
+    board.addEventListener("movestart", (e: any) => {
+        console.log(
+            `Move started: ${e.detail.from}, ${e.detail.piece.color} ${e.detail.piece.pieceType}`
+        );
+        e.detail.setTargets(
+            // This produces a list like ["e3", "e5"]
+            game.moves({ square: e.detail.from, verbose: true }).map(m => m.to)
+        );
+
+        if (game.isGameOver()) {
+            show_game_over();
+        }
+    });
+
+    board.addEventListener("moveend", (e: any) => {
+        console.log(
+            `Move ending: ${e.detail.from} -> ${e.detail.to}, ${e.detail.piece.color} ${e.detail.piece.pieceType}`
+        );
+        const move = game.move({
+            from: e.detail.from,
+            to: e.detail.to,
+            promotion: "q",
+        });
+        if (move === null) {
+            e.preventDefault();
+        }
+
+        if (game.isGameOver()) {
+            show_game_over();
+        }
+    });
+
+    board.addEventListener("movefinished", (e: any) => {
+        board.fen = game.fen();
+        board.turn = game.turn() === "w" ? "white" : "black";
+        board.interactive = game.turn() === "w";
+
+        if (!board.interactive) {
+            let move = computer_move();
+            if (!move) {
+                console.log(
+                    "Didn't get a move from the computer (this is fine if the game is over)"
+                );
+                return;
+            }
+            console.log(`Computer move: ${move}`);
+            game.move(move);
+            board.fen = game.fen();
+            board.turn = "white";
+            board.interactive = true;
+        }
+    });
+
+    document
+        .getElementById("finish")
+        .addEventListener("click", _ => show_game_over());
+
+    append_players_to(document.getElementById("players"));
+});

paper-ideas.txt

@@ -0,0 +1,16 @@
+* a survery of 10 american high school students (R=0, i don't make mistakes)
+* an in-depth analysis of the viewcount of https://www.youtube.com/watch?v=DpXy041BIlA shows that it is less than half the number of students in 'merica
+    * "ask eliza" which is more: 734k or the num. of highschool students in 'mmmmerica
+    * sadly, research has shown that we do, in fact, live in a society (see: outside, probably)
+    * this is worrying as knowledge of bad chess algorithms is projected to be the new literacy by 2013 (citation: Orin Kerr is the Fred C. Stevenson Research Professor at the George Washington University Law School.
+    1 See generally Orin S. Kerr, A Theory of Law, 16 G REEN B AG 2 D 111 (2012).)
+* teenager-friendly language as an excuse for implementation limitations (toootally is like, really great (anti-pun y'see?)) 
+* honor system (again, as an excuse for lazy impl) (joke that high schoolers are the most honorable age)
+* the reconstruction of many of the algorithms is severely flawed, unfortunately looking at the original code just [isn't possible](svn link) (footnote to svn link). maybe one day all_with_link_and_footnote_to_svn_maybe_specific_files(the code will be released)
+* 'merica 'mmerica 'mmmerica 'mmmmerica
+* "hashes tag" to maximize rad power and engagementness
+
+* !!! make sure to give due credit to tom7, so, so much is taken
+    * good artists copy, great artists steal, other people also steal :T
+* make sure licensing is good (gpl should be fine? look at source license)
+    * very scary ugh

paper/paper.aux

@@ -0,0 +1,19 @@
+\relax 
+\providecommand\hyper@newdestlabel[2]{}
+\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
+\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
+\global\let\oldcontentsline\contentsline
+\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
+\global\let\oldnewlabel\newlabel
+\gdef\newlabel#1#2{\newlabelxx{#1}#2}
+\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
+\AtEndDocument{\ifx\hyper@anchor\@undefined
+\let\contentsline\oldcontentsline
+\let\newlabel\oldnewlabel
+\fi}
+\fi}
+\global\let\hyper@last\relax 
+\gdef\HyperFirstAtBeginDocument#1{#1}
+\providecommand\HyField@AuxAddToFields[1]{}
+\providecommand\HyField@AuxAddToCoFields[2]{}
+\gdef \@abspage@last{3}

paper/paper.log

@@ -0,0 +1,308 @@
+This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022/Arch Linux) (preloaded format=pdflatex 2023.3.18)  26 MAR 2023 23:32
+entering extended mode
+ restricted \write18 enabled.
+ %&-line parsing enabled.
+**paper.tex
+(./paper.tex
+LaTeX2e <2021-11-15> patch level 1
+L3 programming layer <2022-04-10>
+(/usr/share/texmf-dist/tex/latex/base/article.cls
+Document Class: article 2021/10/04 v1.4n Standard LaTeX document class
+(/usr/share/texmf-dist/tex/latex/base/size10.clo
+File: size10.clo 2021/10/04 v1.4n Standard LaTeX file (size option)
+)
+\c@part=\count185
+\c@section=\count186
+\c@subsection=\count187
+\c@subsubsection=\count188
+\c@paragraph=\count189
+\c@subparagraph=\count190
+\c@figure=\count191
+\c@table=\count192
+\abovecaptionskip=\skip47
+\belowcaptionskip=\skip48
+\bibindent=\dimen138
+)
+(/usr/share/texmf-dist/tex/latex/base/inputenc.sty
+Package: inputenc 2021/02/14 v1.3d Input encoding file
+\inpenc@prehook=\toks16
+\inpenc@posthook=\toks17
+)
+(/usr/share/texmf-dist/tex/latex/hyperref/hyperref.sty
+Package: hyperref 2022-02-21 v7.00n Hypertext links for LaTeX
+
+(/usr/share/texmf-dist/tex/generic/ltxcmds/ltxcmds.sty
+Package: ltxcmds 2020-05-10 v1.25 LaTeX kernel commands for general use (HO)
+)
+(/usr/share/texmf-dist/tex/generic/iftex/iftex.sty
+Package: iftex 2022/02/03 v1.0f TeX engine tests
+)
+(/usr/share/texmf-dist/tex/generic/pdftexcmds/pdftexcmds.sty
+Package: pdftexcmds 2020-06-27 v0.33 Utility functions of pdfTeX for LuaTeX (HO
+)
+
+(/usr/share/texmf-dist/tex/generic/infwarerr/infwarerr.sty
+Package: infwarerr 2019/12/03 v1.5 Providing info/warning/error messages (HO)
+)
+Package pdftexcmds Info: \pdf@primitive is available.
+Package pdftexcmds Info: \pdf@ifprimitive is available.
+Package pdftexcmds Info: \pdfdraftmode found.
+)
+(/usr/share/texmf-dist/tex/latex/graphics/keyval.sty
+Package: keyval 2014/10/28 v1.15 key=value parser (DPC)
+\KV@toks@=\toks18
+)
+(/usr/share/texmf-dist/tex/generic/kvsetkeys/kvsetkeys.sty
+Package: kvsetkeys 2019/12/15 v1.18 Key value parser (HO)
+)
+(/usr/share/texmf-dist/tex/generic/kvdefinekeys/kvdefinekeys.sty
+Package: kvdefinekeys 2019-12-19 v1.6 Define keys (HO)
+)
+(/usr/share/texmf-dist/tex/generic/pdfescape/pdfescape.sty
+Package: pdfescape 2019/12/09 v1.15 Implements pdfTeX's escape features (HO)
+)
+(/usr/share/texmf-dist/tex/latex/hycolor/hycolor.sty
+Package: hycolor 2020-01-27 v1.10 Color options for hyperref/bookmark (HO)
+)
+(/usr/share/texmf-dist/tex/latex/letltxmacro/letltxmacro.sty
+Package: letltxmacro 2019/12/03 v1.6 Let assignment for LaTeX macros (HO)
+)
+(/usr/share/texmf-dist/tex/latex/auxhook/auxhook.sty
+Package: auxhook 2019-12-17 v1.6 Hooks for auxiliary files (HO)
+)
+(/usr/share/texmf-dist/tex/latex/kvoptions/kvoptions.sty
+Package: kvoptions 2020-10-07 v3.14 Key value format for package options (HO)
+)
+\@linkdim=\dimen139
+\Hy@linkcounter=\count193
+\Hy@pagecounter=\count194
+
+(/usr/share/texmf-dist/tex/latex/hyperref/pd1enc.def
+File: pd1enc.def 2022-02-21 v7.00n Hyperref: PDFDocEncoding definition (HO)
+Now handling font encoding PD1 ...
+... no UTF-8 mapping file for font encoding PD1
+)
+(/usr/share/texmf-dist/tex/generic/intcalc/intcalc.sty
+Package: intcalc 2019/12/15 v1.3 Expandable calculations with integers (HO)
+)
+(/usr/share/texmf-dist/tex/generic/etexcmds/etexcmds.sty
+Package: etexcmds 2019/12/15 v1.7 Avoid name clashes with e-TeX commands (HO)
+)
+\Hy@SavedSpaceFactor=\count195
+
+(/usr/share/texmf-dist/tex/latex/hyperref/puenc.def
+File: puenc.def 2022-02-21 v7.00n Hyperref: PDF Unicode definition (HO)
+Now handling font encoding PU ...
+... no UTF-8 mapping file for font encoding PU
+)
+Package hyperref Info: Hyper figures OFF on input line 4137.
+Package hyperref Info: Link nesting OFF on input line 4142.
+Package hyperref Info: Hyper index ON on input line 4145.
+Package hyperref Info: Plain pages OFF on input line 4152.
+Package hyperref Info: Backreferencing OFF on input line 4157.
+Package hyperref Info: Implicit mode ON; LaTeX internals redefined.
+Package hyperref Info: Bookmarks ON on input line 4390.
+\c@Hy@tempcnt=\count196
+
+(/usr/share/texmf-dist/tex/latex/url/url.sty
+\Urlmuskip=\muskip16
+Package: url 2013/09/16  ver 3.4  Verb mode for urls, etc.
+)
+LaTeX Info: Redefining \url on input line 4749.
+\XeTeXLinkMargin=\dimen140
+
+(/usr/share/texmf-dist/tex/generic/bitset/bitset.sty
+Package: bitset 2019/12/09 v1.3 Handle bit-vector datatype (HO)
+
+(/usr/share/texmf-dist/tex/generic/bigintcalc/bigintcalc.sty
+Package: bigintcalc 2019/12/15 v1.5 Expandable calculations on big integers (HO
+)
+))
+\Fld@menulength=\count197
+\Field@Width=\dimen141
+\Fld@charsize=\dimen142
+Package hyperref Info: Hyper figures OFF on input line 6027.
+Package hyperref Info: Link nesting OFF on input line 6032.
+Package hyperref Info: Hyper index ON on input line 6035.
+Package hyperref Info: backreferencing OFF on input line 6042.
+Package hyperref Info: Link coloring OFF on input line 6047.
+Package hyperref Info: Link coloring with OCG OFF on input line 6052.
+Package hyperref Info: PDF/A mode OFF on input line 6057.
+LaTeX Info: Redefining \ref on input line 6097.
+LaTeX Info: Redefining \pageref on input line 6101.
+
+(/usr/share/texmf-dist/tex/latex/base/atbegshi-ltx.sty
+Package: atbegshi-ltx 2021/01/10 v1.0c Emulation of the original atbegshi
+package with kernel methods
+)
+\Hy@abspage=\count198
+\c@Item=\count199
+\c@Hfootnote=\count266
+)
+Package hyperref Info: Driver (autodetected): hpdftex.
+
+(/usr/share/texmf-dist/tex/latex/hyperref/hpdftex.def
+File: hpdftex.def 2022-02-21 v7.00n Hyperref driver for pdfTeX
+
+(/usr/share/texmf-dist/tex/latex/base/atveryend-ltx.sty
+Package: atveryend-ltx 2020/08/19 v1.0a Emulation of the original atveryend pac
+kage
+with kernel methods
+)
+\Fld@listcount=\count267
+\c@bookmark@seq@number=\count268
+
+(/usr/share/texmf-dist/tex/latex/rerunfilecheck/rerunfilecheck.sty
+Package: rerunfilecheck 2019/12/05 v1.9 Rerun checks for auxiliary files (HO)
+
+(/usr/share/texmf-dist/tex/generic/uniquecounter/uniquecounter.sty
+Package: uniquecounter 2019/12/15 v1.4 Provide unlimited unique counter (HO)
+)
+Package uniquecounter Info: New unique counter `rerunfilecheck' on input line 2
+86.
+)
+\Hy@SectionHShift=\skip49
+)
+Package hyperref Info: Option `colorlinks' set `true' on input line 8.
+
+(/usr/share/texmf-dist/tex/latex/l3backend/l3backend-pdftex.def
+File: l3backend-pdftex.def 2022-04-14 L3 backend support: PDF output (pdfTeX)
+\l__color_backend_stack_int=\count269
+\l__pdf_internal_box=\box50
+) (./paper.aux)
+\openout1 = `paper.aux'.
+
+LaTeX Font Info:    Checking defaults for OML/cmm/m/it on input line 16.
+LaTeX Font Info:    ... okay on input line 16.
+LaTeX Font Info:    Checking defaults for OMS/cmsy/m/n on input line 16.
+LaTeX Font Info:    ... okay on input line 16.
+LaTeX Font Info:    Checking defaults for OT1/cmr/m/n on input line 16.
+LaTeX Font Info:    ... okay on input line 16.
+LaTeX Font Info:    Checking defaults for T1/cmr/m/n on input line 16.
+LaTeX Font Info:    ... okay on input line 16.
+LaTeX Font Info:    Checking defaults for TS1/cmr/m/n on input line 16.
+LaTeX Font Info:    ... okay on input line 16.
+LaTeX Font Info:    Checking defaults for OMX/cmex/m/n on input line 16.
+LaTeX Font Info:    ... okay on input line 16.
+LaTeX Font Info:    Checking defaults for U/cmr/m/n on input line 16.
+LaTeX Font Info:    ... okay on input line 16.
+LaTeX Font Info:    Checking defaults for PD1/pdf/m/n on input line 16.
+LaTeX Font Info:    ... okay on input line 16.
+LaTeX Font Info:    Checking defaults for PU/pdf/m/n on input line 16.
+LaTeX Font Info:    ... okay on input line 16.
+
+(/usr/share/texmf-dist/tex/latex/graphics/color.sty
+Package: color 2021/12/07 v1.3c Standard LaTeX Color (DPC)
+
+(/usr/share/texmf-dist/tex/latex/graphics-cfg/color.cfg
+File: color.cfg 2016/01/02 v1.6 sample color configuration
+)
+Package color Info: Driver file: pdftex.def on input line 149.
+
+(/usr/share/texmf-dist/tex/latex/graphics-def/pdftex.def
+File: pdftex.def 2020/10/05 v1.2a Graphics/color driver for pdftex
+
+(/usr/share/texmf-dist/tex/context/base/mkii/supp-pdf.mkii
+[Loading MPS to PDF converter (version 2006.09.02).]
+\scratchcounter=\count270
+\scratchdimen=\dimen143
+\scratchbox=\box51
+\nofMPsegments=\count271
+\nofMParguments=\count272
+\everyMPshowfont=\toks19
+\MPscratchCnt=\count273
+\MPscratchDim=\dimen144
+\MPnumerator=\count274
+\makeMPintoPDFobject=\count275
+\everyMPtoPDFconversion=\toks20
+)))
+Package hyperref Info: Link coloring ON on input line 16.
+ (/usr/share/texmf-dist/tex/latex/hyperref/nameref.sty
+Package: nameref 2021-04-02 v2.47 Cross-referencing by name of section
+
+(/usr/share/texmf-dist/tex/latex/refcount/refcount.sty
+Package: refcount 2019/12/15 v3.6 Data extraction from label references (HO)
+)
+(/usr/share/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty
+Package: gettitlestring 2019/12/15 v1.6 Cleanup title references (HO)
+)
+\c@section@level=\count276
+)
+LaTeX Info: Redefining \ref on input line 16.
+LaTeX Info: Redefining \pageref on input line 16.
+LaTeX Info: Redefining \nameref on input line 16.
+
+(./paper.out) (./paper.out)
+\@outlinefile=\write3
+\openout3 = `paper.out'.
+
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <12> on input line 19.
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <8> on input line 19.
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <6> on input line 19.
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <9> on input line 25.
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <5> on input line 25.
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <7> on input line 34.
+
+Overfull \hbox (1.49698pt too wide) in paragraph at lines 49--49
+[]\OT1/cmtt/m/n/10 * Given that Youtube Video has less views than half the popu
+lation[] 
+ []
+
+
+Overfull \hbox (6.74693pt too wide) in paragraph at lines 49--49
+[]\OT1/cmtt/m/n/10 of the 'Ted 'Tes, is it possible that every 'Mmmmerican high
+ school[] 
+ []
+
+[1
+
+{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}]
+pdfTeX warning (ext4): destination with the same identifier (name{page.}) has b
+een already used, duplicate ignored
+<to be read again> 
+                   \relax 
+l.78 \end{document}
+                    [2]
+pdfTeX warning (ext4): destination with the same identifier (name{page.}) has b
+een already used, duplicate ignored
+<to be read again> 
+                   \relax 
+l.78 \end{document}
+                    [3] (./paper.aux)
+Package rerunfilecheck Info: File `paper.out' has not changed.
+(rerunfilecheck)             Checksum: D41D8CD98F00B204E9800998ECF8427E;0.
+ ) 
+Here is how much of TeX's memory you used:
+ 7873 strings out of 478238
+ 123244 string characters out of 5850456
+ 427050 words of memory out of 5000000
+ 26024 multiletter control sequences out of 15000+600000
+ 475142 words of font info for 48 fonts, out of 8000000 for 9000
+ 1141 hyphenation exceptions out of 8191
+ 60i,8n,63p,427b,462s stack positions out of 5000i,500n,10000p,200000b,80000s
+{/usr/share/texmf-dist/fonts/enc/dvips/cm-super/cm-super-ts1.enc}</usr/share/
+texmf-dist/fonts/type1/public/amsfonts/cm/cmbx12.pfb></usr/share/texmf-dist/fon
+ts/type1/public/amsfonts/cm/cmbx9.pfb></usr/share/texmf-dist/fonts/type1/public
+/amsfonts/cm/cmmi8.pfb></usr/share/texmf-dist/fonts/type1/public/amsfonts/cm/cm
+r10.pfb></usr/share/texmf-dist/fonts/type1/public/amsfonts/cm/cmr12.pfb></usr/s
+hare/texmf-dist/fonts/type1/public/amsfonts/cm/cmr17.pfb></usr/share/texmf-dist
+/fonts/type1/public/amsfonts/cm/cmr6.pfb></usr/share/texmf-dist/fonts/type1/pub
+lic/amsfonts/cm/cmr7.pfb></usr/share/texmf-dist/fonts/type1/public/amsfonts/cm/
+cmr8.pfb></usr/share/texmf-dist/fonts/type1/public/amsfonts/cm/cmr9.pfb></usr/s
+hare/texmf-dist/fonts/type1/public/amsfonts/cm/cmti8.pfb></usr/share/texmf-dist
+/fonts/type1/public/amsfonts/cm/cmtt10.pfb></usr/share/texmf-dist/fonts/type1/p
+ublic/amsfonts/cm/cmtt8.pfb></usr/share/texmf-dist/fonts/type1/public/cm-super/
+sfrm1000.pfb>
+Output written on paper.pdf (3 pages, 175758 bytes).
+PDF statistics:
+ 159 PDF objects out of 1000 (max. 8388607)
+ 124 compressed objects within 2 object streams
+ 24 named destinations out of 1000 (max. 500000)
+ 1 words of extra memory for PDF output out of 10000 (max. 10000000)
+

paper/paper.tex

@@ -0,0 +1,80 @@
+\documentclass[a4paper,10pt]{article}
+\usepackage[utf8]{inputenc}
+\usepackage[hidelinks]{hyperref}
+\hypersetup{
+    colorlinks,
+    urlcolor = blue,
+    linkcolor = black,
+}
+
+%opening
+\title{Elo Worldle, a framework for teaching the children about weak chess engines}
+\author{Clark Levi Jones}
+\date{}
+\pagenumbering{gobble}
+
+\begin{document}
+
+\maketitle
+
+\begin{abstract}
+I see what I infer to be a mountain. In the center of the mountain, I infer that there is something. In the spirit of, I go to check my inferences. The mountain grows farther. I turn again. The mountain grows closer. I infer that a smile grows across my face. There is a tree. I infer that there is a tree. I am wrong.
+\end{abstract}
+
+\begin{abstract}
+Numerous studies\footnote{TODO: academic integrity, citations, not-lies, etc are valuable\footnotemark}\footnotetext{\url{https://www.marxists.org/archive/marx/works/1867-c1/appendix.htm}}
+have shown that it is impossible to learn without video games.
+Many of the children know little about bad chess engines.
+There is no videogame.
+The author seeks to rectify this.
+\end{abstract}
+
+\section*{Motivation}
+
+Before the advance of the action-packed, educational digigame Wordle\footnote{\url{https://www.nytimes.com/games/wordle/index.html}}, the vast majority of 'Merican highschool students were unaware that words even were.
+Similarly, Worldle\footnote{\url{https://worldle.teuteuf.fr/}} ushered in a new age of international politics, as now the world's elite ('Mmerican highschool students) were aware of nations.
+Most famously, LFMan helped the kids to learn.\footnote{\url{http://spacebar.org/lfman/}}
+Time and time again, video game makes the kids know.
+
+Most people believe vocabulary, geography, and dependent lambda calculus are the only things that the children need to know, but this is not the case; knowledge of bad chess algorithms is projected to be the new literacy by 2011.\footnote{See generally Orin S. Kerr, A Theory of Law, 16 G REEN B AG 2 D 111 (2012).}
+
+To assess the current literacy rates in the 'Nited 'Tates, we\footnote{I} performed a survey of ten random 'Mmmerican highschool students\footnote{$R=0$, I don't make mistakes.} and found them all to be illiterate.
+In addition, we\footnote{I} did an in-depth analysis of the view count of \url{https://www.youtube.com/watch?v=DpXy041BIlA} and found it to be less than half the population of the 'Ited 'Ates!
+We asked a sentient chatbot\footnote{\url{https://pyrope.net/2023.pdf}} for its analysis on the matter:
+\begin{verbatim}
+* Given that Youtube Video has less views than half the population
+of the 'Ted 'Tes, is it possible that every 'Mmmmerican high school
+student has watched it?
+> It is nice to be chatting with you.
+\end{verbatim}
+It is clear that a Video Game is needed.
+However, terrifyingly, in my extensive research,\footnote{} I was unable to find a single game that taught the children how to recognize what bad chess engine they are playing against? Whaaaat!?
+
+\section*{Implementation}
+After a few hours of frustration, implementation went relatively smoothly.
+Each engine was implemented as a Typescript\footnote{\url{https://isocpp.org}} function, using the laziest possible interpretations of the descriptions in \url{http://tom7.org/chess/weak.pdf}.\footnote{For example, `equalizer' is complete garbage because it is based on piece \emph{type} instead of the actual piece, which makes it completely boring and extremely difficult to identify.}
+An ideal implementation would simply port the original, but \href{https://sourceforge.net/p/tom7misc/svn/HEAD/tree/trunk/chess/}{there is no way to do that}.\footnote{\url{https://sourceforge.net/p/tom7misc/svn/HEAD/tree/trunk/chess}}
+\href{https://sourceforge.net/p/tom7misc/svn/HEAD/tree/trunk/chess/player.cc}{It's impossible}.\footnote{\url{https://sourceforge.net/p/tom7misc/svn/HEAD/tree/trunk/chess/player.cc}}
+The Javascript ecosystem, notorious for it's lack of libraries, did have a chess library\footnote{\url{https://www.npmjs.com/package/chess.js}} and a chessboard library\footnote{\url{https://www.npmjs.com/package/gchessboard}} both of which the author (ab)used greatly.
+
+\section*{Color Pickings}
+As is standard practice\footnote{\url{https://en.wikipedia.org/wiki/Standards_\%26_Practices_(album)}}, what colors were picked and from where are listed below:
+\begin{itemize}
+ \item \#86A666 ``Dark Square Color'': \url{http://tom7.org/chess/}
+ \item \#FFFFDD ``Light Square Color'': \url{http://tom7.org/chess/}
+ \item \#3A3A3C ``FAIL Color: Rad Variation'': \url{https://www.nytimes.com/games/wordle/index.html}
+ \item \#538D4E ``WIN Color: Rad Variation'': \url{https://www.nytimes.com/games/wordle/index.html}
+\end{itemize}
+
+\section*{Conclusion}
+Having made a game that will the children the learn, my life is complete.
+I can now choose to roam the earth as an empty husk, searching eternally and pointlessly for some new purpose, or I can become a robot ghost.
+
+Oh, you want to actually play the game?
+Are the numerous, gorgeous screenshots I have provided simply not enough?
+Fine, but you're going to have to work for it.
+In this sentence, there is a hidden link to the game \url{https://elo-worldle.pyrope.net}.
+And, in this sentence, there is a hidden link to the source code (which is technically also in the last link but it would be annoying to find everything) \url{https://git.pyrope.net/mbk/elo-worldle/}.
+\end{document}
+
+

players.md

@@ -0,0 +1,36 @@
+[x] random_move
+[x] same_color
+[x] opposite_color
+[x] pacifist
+[x] first_move
+[x] alphabetical
+[x] huddle
+[x] swarm
+[x] generous
+[x] no_i_insist
+[x] reverse_starting
+[x] cccp
+[x] suicide_king
+[x] sym_mirror_y
+[x] sym_mirror_x
+[x] sym_180
+[x] min_oppt_moves*
+[x] equalizer
+
+the last 4 unchecked (reverse_starting, sym_mirror_y, sym_mirror_x, and sym_180 for posterity) can likely use a similar function (the easiest possible interpretation of the og is that they minimize the total distance of pieces to some target, will probably be easiest to just manually although hmmmm reverse_starting + find + start_board could be clever)
+reading is helpful apparently: (in reverse_starting) "Since here we have
+a specific configuration in mind, we can produce a distance metric by computing the total distance from each piece to its desired destination."
+
+oh boy: *** Each piece uses a different distance metric; Chebyshev distance for the King, Manhattan distance for the Rook, and a pretty weird function for the Knight [3]. ***
+
+the player descriptions are too much about the specifics ("reverse_starting: Makes the move that minimizes the number of moves it takes to move their pieces to the opposite end" is particularly egregious) which is more honest but eh
+
+# fate-based players are going to be unreasonable 
+## JUST KIDDING: all-fate-data.cc thank you tom7 
+### but maybe they won't be funny
+#### i meant funny
+##### i don't know why i'm doing org-mode nesting
+###### i meant FUN
+####### why do i keep doing funny
+######## anyway what i meant to mention is laziness duh
+[ ]

tsconfig.json

@@ -0,0 +1,8 @@
+{
+    "compilerOptions": {
+        "target": "ES6",
+        "module": "ES6",
+        "moduleResolution": "node",
+        "esModuleInterop": true
+    }
+}