- GNU GENERAL PUBLIC LICENSE\r
- Version 2, June 1991\r
-\r
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.\r
- 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r
- Everyone is permitted to copy and distribute verbatim copies\r
- of this license document, but changing it is not allowed.\r
-\r
- Preamble\r
-\r
- The licenses for most software are designed to take away your\r
-freedom to share and change it. By contrast, the GNU General Public\r
-License is intended to guarantee your freedom to share and change free\r
-software--to make sure the software is free for all its users. This\r
-General Public License applies to most of the Free Software\r
-Foundation's software and to any other program whose authors commit to\r
-using it. (Some other Free Software Foundation software is covered by\r
-the GNU Library General Public License instead.) You can apply it to\r
-your programs, too.\r
-\r
- When we speak of free software, we are referring to freedom, not\r
-price. Our General Public Licenses are designed to make sure that you\r
-have the freedom to distribute copies of free software (and charge for\r
-this service if you wish), that you receive source code or can get it\r
-if you want it, that you can change the software or use pieces of it\r
-in new free programs; and that you know you can do these things.\r
-\r
- To protect your rights, we need to make restrictions that forbid\r
-anyone to deny you these rights or to ask you to surrender the rights.\r
-These restrictions translate to certain responsibilities for you if you\r
-distribute copies of the software, or if you modify it.\r
-\r
- For example, if you distribute copies of such a program, whether\r
-gratis or for a fee, you must give the recipients all the rights that\r
-you have. You must make sure that they, too, receive or can get the\r
-source code. And you must show them these terms so they know their\r
-rights.\r
-\r
- We protect your rights with two steps: (1) copyright the software, and\r
-(2) offer you this license which gives you legal permission to copy,\r
-distribute and/or modify the software.\r
-\r
- Also, for each author's protection and ours, we want to make certain\r
-that everyone understands that there is no warranty for this free\r
-software. If the software is modified by someone else and passed on, we\r
-want its recipients to know that what they have is not the original, so\r
-that any problems introduced by others will not reflect on the original\r
-authors' reputations.\r
-\r
- Finally, any free program is threatened constantly by software\r
-patents. We wish to avoid the danger that redistributors of a free\r
-program will individually obtain patent licenses, in effect making the\r
-program proprietary. To prevent this, we have made it clear that any\r
-patent must be licensed for everyone's free use or not licensed at all.\r
-\r
- The precise terms and conditions for copying, distribution and\r
-modification follow.\r
-\f\r
- GNU GENERAL PUBLIC LICENSE\r
- TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\r
-\r
- 0. This License applies to any program or other work which contains\r
-a notice placed by the copyright holder saying it may be distributed\r
-under the terms of this General Public License. The "Program", below,\r
-refers to any such program or work, and a "work based on the Program"\r
-means either the Program or any derivative work under copyright law:\r
-that is to say, a work containing the Program or a portion of it,\r
-either verbatim or with modifications and/or translated into another\r
-language. (Hereinafter, translation is included without limitation in\r
-the term "modification".) Each licensee is addressed as "you".\r
-\r
-Activities other than copying, distribution and modification are not\r
-covered by this License; they are outside its scope. The act of\r
-running the Program is not restricted, and the output from the Program\r
-is covered only if its contents constitute a work based on the\r
-Program (independent of having been made by running the Program).\r
-Whether that is true depends on what the Program does.\r
-\r
- 1. You may copy and distribute verbatim copies of the Program's\r
-source code as you receive it, in any medium, provided that you\r
-conspicuously and appropriately publish on each copy an appropriate\r
-copyright notice and disclaimer of warranty; keep intact all the\r
-notices that refer to this License and to the absence of any warranty;\r
-and give any other recipients of the Program a copy of this License\r
-along with the Program.\r
-\r
-You may charge a fee for the physical act of transferring a copy, and\r
-you may at your option offer warranty protection in exchange for a fee.\r
-\r
- 2. You may modify your copy or copies of the Program or any portion\r
-of it, thus forming a work based on the Program, and copy and\r
-distribute such modifications or work under the terms of Section 1\r
-above, provided that you also meet all of these conditions:\r
-\r
- a) You must cause the modified files to carry prominent notices\r
- stating that you changed the files and the date of any change.\r
-\r
- b) You must cause any work that you distribute or publish, that in\r
- whole or in part contains or is derived from the Program or any\r
- part thereof, to be licensed as a whole at no charge to all third\r
- parties under the terms of this License.\r
-\r
- c) If the modified program normally reads commands interactively\r
- when run, you must cause it, when started running for such\r
- interactive use in the most ordinary way, to print or display an\r
- announcement including an appropriate copyright notice and a\r
- notice that there is no warranty (or else, saying that you provide\r
- a warranty) and that users may redistribute the program under\r
- these conditions, and telling the user how to view a copy of this\r
- License. (Exception: if the Program itself is interactive but\r
- does not normally print such an announcement, your work based on\r
- the Program is not required to print an announcement.)\r
-\f\r
-These requirements apply to the modified work as a whole. If\r
-identifiable sections of that work are not derived from the Program,\r
-and can be reasonably considered independent and separate works in\r
-themselves, then this License, and its terms, do not apply to those\r
-sections when you distribute them as separate works. But when you\r
-distribute the same sections as part of a whole which is a work based\r
-on the Program, the distribution of the whole must be on the terms of\r
-this License, whose permissions for other licensees extend to the\r
-entire whole, and thus to each and every part regardless of who wrote it.\r
-\r
-Thus, it is not the intent of this section to claim rights or contest\r
-your rights to work written entirely by you; rather, the intent is to\r
-exercise the right to control the distribution of derivative or\r
-collective works based on the Program.\r
-\r
-In addition, mere aggregation of another work not based on the Program\r
-with the Program (or with a work based on the Program) on a volume of\r
-a storage or distribution medium does not bring the other work under\r
-the scope of this License.\r
-\r
- 3. You may copy and distribute the Program (or a work based on it,\r
-under Section 2) in object code or executable form under the terms of\r
-Sections 1 and 2 above provided that you also do one of the following:\r
-\r
- a) Accompany it with the complete corresponding machine-readable\r
- source code, which must be distributed under the terms of Sections\r
- 1 and 2 above on a medium customarily used for software interchange; or,\r
-\r
- b) Accompany it with a written offer, valid for at least three\r
- years, to give any third party, for a charge no more than your\r
- cost of physically performing source distribution, a complete\r
- machine-readable copy of the corresponding source code, to be\r
- distributed under the terms of Sections 1 and 2 above on a medium\r
- customarily used for software interchange; or,\r
-\r
- c) Accompany it with the information you received as to the offer\r
- to distribute corresponding source code. (This alternative is\r
- allowed only for noncommercial distribution and only if you\r
- received the program in object code or executable form with such\r
- an offer, in accord with Subsection b above.)\r
-\r
-The source code for a work means the preferred form of the work for\r
-making modifications to it. For an executable work, complete source\r
-code means all the source code for all modules it contains, plus any\r
-associated interface definition files, plus the scripts used to\r
-control compilation and installation of the executable. However, as a\r
-special exception, the source code distributed need not include\r
-anything that is normally distributed (in either source or binary\r
-form) with the major components (compiler, kernel, and so on) of the\r
-operating system on which the executable runs, unless that component\r
-itself accompanies the executable.\r
-\r
-If distribution of executable or object code is made by offering\r
-access to copy from a designated place, then offering equivalent\r
-access to copy the source code from the same place counts as\r
-distribution of the source code, even though third parties are not\r
-compelled to copy the source along with the object code.\r
-\f\r
- 4. You may not copy, modify, sublicense, or distribute the Program\r
-except as expressly provided under this License. Any attempt\r
-otherwise to copy, modify, sublicense or distribute the Program is\r
-void, and will automatically terminate your rights under this License.\r
-However, parties who have received copies, or rights, from you under\r
-this License will not have their licenses terminated so long as such\r
-parties remain in full compliance.\r
-\r
- 5. You are not required to accept this License, since you have not\r
-signed it. However, nothing else grants you permission to modify or\r
-distribute the Program or its derivative works. These actions are\r
-prohibited by law if you do not accept this License. Therefore, by\r
-modifying or distributing the Program (or any work based on the\r
-Program), you indicate your acceptance of this License to do so, and\r
-all its terms and conditions for copying, distributing or modifying\r
-the Program or works based on it.\r
-\r
- 6. Each time you redistribute the Program (or any work based on the\r
-Program), the recipient automatically receives a license from the\r
-original licensor to copy, distribute or modify the Program subject to\r
-these terms and conditions. You may not impose any further\r
-restrictions on the recipients' exercise of the rights granted herein.\r
-You are not responsible for enforcing compliance by third parties to\r
-this License.\r
-\r
- 7. If, as a consequence of a court judgment or allegation of patent\r
-infringement or for any other reason (not limited to patent issues),\r
-conditions are imposed on you (whether by court order, agreement or\r
-otherwise) that contradict the conditions of this License, they do not\r
-excuse you from the conditions of this License. If you cannot\r
-distribute so as to satisfy simultaneously your obligations under this\r
-License and any other pertinent obligations, then as a consequence you\r
-may not distribute the Program at all. For example, if a patent\r
-license would not permit royalty-free redistribution of the Program by\r
-all those who receive copies directly or indirectly through you, then\r
-the only way you could satisfy both it and this License would be to\r
-refrain entirely from distribution of the Program.\r
-\r
-If any portion of this section is held invalid or unenforceable under\r
-any particular circumstance, the balance of the section is intended to\r
-apply and the section as a whole is intended to apply in other\r
-circumstances.\r
-\r
-It is not the purpose of this section to induce you to infringe any\r
-patents or other property right claims or to contest validity of any\r
-such claims; this section has the sole purpose of protecting the\r
-integrity of the free software distribution system, which is\r
-implemented by public license practices. Many people have made\r
-generous contributions to the wide range of software distributed\r
-through that system in reliance on consistent application of that\r
-system; it is up to the author/donor to decide if he or she is willing\r
-to distribute software through any other system and a licensee cannot\r
-impose that choice.\r
-\r
-This section is intended to make thoroughly clear what is believed to\r
-be a consequence of the rest of this License.\r
-\f\r
- 8. If the distribution and/or use of the Program is restricted in\r
-certain countries either by patents or by copyrighted interfaces, the\r
-original copyright holder who places the Program under this License\r
-may add an explicit geographical distribution limitation excluding\r
-those countries, so that distribution is permitted only in or among\r
-countries not thus excluded. In such case, this License incorporates\r
-the limitation as if written in the body of this License.\r
-\r
- 9. The Free Software Foundation may publish revised and/or new versions\r
-of the General Public License from time to time. Such new versions will\r
-be similar in spirit to the present version, but may differ in detail to\r
-address new problems or concerns.\r
-\r
-Each version is given a distinguishing version number. If the Program\r
-specifies a version number of this License which applies to it and "any\r
-later version", you have the option of following the terms and conditions\r
-either of that version or of any later version published by the Free\r
-Software Foundation. If the Program does not specify a version number of\r
-this License, you may choose any version ever published by the Free Software\r
-Foundation.\r
-\r
- 10. If you wish to incorporate parts of the Program into other free\r
-programs whose distribution conditions are different, write to the author\r
-to ask for permission. For software which is copyrighted by the Free\r
-Software Foundation, write to the Free Software Foundation; we sometimes\r
-make exceptions for this. Our decision will be guided by the two goals\r
-of preserving the free status of all derivatives of our free software and\r
-of promoting the sharing and reuse of software generally.\r
-\r
- NO WARRANTY\r
-\r
- 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY\r
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN\r
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES\r
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED\r
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\r
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS\r
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE\r
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,\r
-REPAIR OR CORRECTION.\r
-\r
- 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\r
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR\r
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,\r
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING\r
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED\r
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY\r
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER\r
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE\r
-POSSIBILITY OF SUCH DAMAGES.\r
-\r
- END OF TERMS AND CONDITIONS\r
-\f\r
- How to Apply These Terms to Your New Programs\r
-\r
- If you develop a new program, and you want it to be of the greatest\r
-possible use to the public, the best way to achieve this is to make it\r
-free software which everyone can redistribute and change under these terms.\r
-\r
- To do so, attach the following notices to the program. It is safest\r
-to attach them to the start of each source file to most effectively\r
-convey the exclusion of warranty; and each file should have at least\r
-the "copyright" line and a pointer to where the full notice is found.\r
-\r
- <one line to give the program's name and a brief idea of what it does.>\r
- Copyright (C) <year> <name of author>\r
-\r
- This program is free software; you can redistribute it and/or modify\r
- it under the terms of the GNU General Public License as published by\r
- the Free Software Foundation; either version 2 of the License, or\r
- (at your option) any later version.\r
-\r
- This program is distributed in the hope that it will be useful,\r
- but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
- GNU General Public License for more details.\r
-\r
- You should have received a copy of the GNU General Public License\r
- along with this program; if not, write to the Free Software\r
- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r
-\r
-\r
-Also add information on how to contact you by electronic and paper mail.\r
-\r
-If the program is interactive, make it output a short notice like this\r
-when it starts in an interactive mode:\r
-\r
- Gnomovision version 69, Copyright (C) year name of author\r
- Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\r
- This is free software, and you are welcome to redistribute it\r
- under certain conditions; type `show c' for details.\r
-\r
-The hypothetical commands `show w' and `show c' should show the appropriate\r
-parts of the General Public License. Of course, the commands you use may\r
-be called something other than `show w' and `show c'; they could even be\r
-mouse-clicks or menu items--whatever suits your program.\r
-\r
-You should also get your employer (if you work as a programmer) or your\r
-school, if any, to sign a "copyright disclaimer" for the program, if\r
-necessary. Here is a sample; alter the names:\r
-\r
- Yoyodyne, Inc., hereby disclaims all copyright interest in the program\r
- `Gnomovision' (which makes passes at compilers) written by James Hacker.\r
-\r
- <signature of Ty Coon>, 1 April 1989\r
- Ty Coon, President of Vice\r
-\r
-This General Public License does not permit incorporating your program into\r
-proprietary programs. If your program is a subroutine library, you may\r
-consider it more useful to permit linking proprietary applications with the\r
-library. If this is what you want to do, use the GNU Library General\r
-Public License instead of this License.\r
+ GNU GENERAL PUBLIC LICENSE
+ Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+ 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The licenses for most software are designed to take away your
+freedom to share and change it. By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users. This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it. (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.) 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
+this service 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 make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have. 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.
+
+ We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+ Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software. If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+ Finally, any free program is threatened constantly by software
+patents. We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary. To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+\f
+ GNU GENERAL PUBLIC LICENSE
+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+ 0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License. The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language. (Hereinafter, translation is included without limitation in
+the term "modification".) Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope. The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+ 1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+ 2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+ a) You must cause the modified files to carry prominent notices
+ stating that you changed the files and the date of any change.
+
+ b) You must cause any work that you distribute or publish, that in
+ whole or in part contains or is derived from the Program or any
+ part thereof, to be licensed as a whole at no charge to all third
+ parties under the terms of this License.
+
+ c) If the modified program normally reads commands interactively
+ when run, you must cause it, when started running for such
+ interactive use in the most ordinary way, to print or display an
+ announcement including an appropriate copyright notice and a
+ notice that there is no warranty (or else, saying that you provide
+ a warranty) and that users may redistribute the program under
+ these conditions, and telling the user how to view a copy of this
+ License. (Exception: if the Program itself is interactive but
+ does not normally print such an announcement, your work based on
+ the Program is not required to print an announcement.)
+\f
+These requirements apply to the modified work as a whole. If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works. But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+ 3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+ a) Accompany it with the complete corresponding machine-readable
+ source code, which must be distributed under the terms of Sections
+ 1 and 2 above on a medium customarily used for software interchange; or,
+
+ b) Accompany it with a written offer, valid for at least three
+ years, to give any third party, for a charge no more than your
+ cost of physically performing source distribution, a complete
+ machine-readable copy of the corresponding source code, to be
+ distributed under the terms of Sections 1 and 2 above on a medium
+ customarily used for software interchange; or,
+
+ c) Accompany it with the information you received as to the offer
+ to distribute corresponding source code. (This alternative is
+ allowed only for noncommercial distribution and only if you
+ received the program in object code or executable form with such
+ an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it. For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable. However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+\f
+ 4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License. Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+ 5. You are not required to accept this License, since you have not
+signed it. However, nothing else grants you permission to modify or
+distribute the Program or its derivative works. These actions are
+prohibited by law if you do not accept this License. Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+ 6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions. You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+ 7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+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
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all. For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices. Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+\f
+ 8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded. In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+ 9. The Free Software Foundation may publish revised and/or new versions
+of the 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 a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation. If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+ 10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission. For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this. Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+ NO WARRANTY
+
+ 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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.
+
+ 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE 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.
+
+ END OF TERMS AND CONDITIONS
+\f
+ 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
+convey 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 2 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, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+ Gnomovision version 69, Copyright (C) year name of author
+ Gnomovision 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, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary. Here is a sample; alter the names:
+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+ `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+ <signature of Ty Coon>, 1 April 1989
+ Ty Coon, President of Vice
+
+This 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 Library General
+Public License instead of this License.
-========1.4.61b=================\r
-- uci_isready replaced by uci_isready_sync. Polyglot should not send commands to the engine while it is syncing.\r
-========1.4.60b=================\r
-- The result string after an illegal move now shows the actual attempted move.\r
-========1.4.59b=================\r
-- Bugfix: the changes in 1.4.57b created a regression where the input buffer of polyglot could overflow with engines producing lots of output very fast. \r
-========1.4.58b=================\r
-- Implementation of BookDepth in UCI mode.\r
-- Small corrections to the manpage.\r
-========1.4.57b=================\r
-- First attempt at killing engines that do not react to "quit". \r
-========1.4.56b=================\r
-- Better handling of non-existing engine command on Linux. No changes on Windows.\r
-=========1.4.55b================\r
-- Suppression of some error dialogs.\r
-- Small delay in between final error message and actually quitting.\r
-=========1.4.54b================\r
-- More graceful handling of engine crashes.\r
-- New EngineCommand is now passed through wordexp on Linux.\r
-=========1.4.53b================\r
-- Multipv code by HGM. \r
-=========1.4.52b================\r
-- Reexport SyncStop. It is apparently necessary for the Aquarium Book Adapter.\r
-=========1.4.51b================\r
-- Support for new nps command. Code provided by Harm Geert Muller. \r
-=========1.4.50b================\r
-- Change in architecture. Persistence is disabled. The user is required to push the "Save" button explicitly to save the settings. What is retained is that in case PG is invoked with -noini (or as a special exception for WB 4.4.0 when the config files are polyglot_1st.ini or polyglot_2nd.ini) then PG uses a default config file whose name is derived from the engine name. \r
-- New option: OnlyWbOptions (default: true). Restrict the options that PG sends to those that are potentially useful for WinBoard.\r
-=========1.4.47b================\r
-- Try to detect if the engine is not an UCI engine.\r
-=========1.4.46b================\r
-- The default persistence directory on Windows is now _PG. The names of the engine specific ini files are mangled so as not to contain spaces. \r
-- PG now tries to guess if a string option is really a file or a path (like in the Arena GUI). \r
-=========1.4.45b================\r
-- The engine specific config files (<myname>.ini) are now stored in a separate directory. $HOME/.polyglot on Linux and "./Polyglot Settings" on Windows. \r
-- The engine specific config files are now complete config files. So they can be used in a stand alone fashion.\r
-- Implemented a minor hack to make xboard show error messages during startup. \r
-=========1.4.44b================\r
-- "Implementation" of new buttons and controls.\r
-- The "Persist" option is now persistent. That is if you turn of "Persist" then as a special case PG will remember this.\r
-- There is now a "reset" button which restores the default options. The code is commented out since WB does not support it yet.\r
-=========1.4.42b================\r
-- SaveSettingsOnExit/SaveFile renamed as Persist/PersistFile.\r
-- Many bug fixes in the persistence feature.\r
-- The PG_<myname>.ini file now contains only options that have been changed. So the resulting ini files are much smaller. This makes this version of PG usable on WB 4.3.15 as now the engine specific ini file will be empty (the user has no way to change options).\r
-=========1.4.41b================\r
-- Some segfaults fixed in case of corrupt config files.\r
-- Persistence of options. If the option SaveSettingsOnExit is true (the default) PolyGlot now saves its options in a file whose name is given by the option SaveFile which by default is equal to the engine name, prefixex by PG_ and suffixed by ".ini".\r
-=========1.4.39b================\r
-- Refactoring of config file parsing\r
-- Fix crash bug in epd-test\r
-- Do not export Chess960. This is handled completely internally. \r
-- Do not export UCI_Opponent and UCI_Chess960. These are handled internally.\r
-- PG can now also be comfortably configured through command line options (i.e. without using a config file). \r
-- Allow quotes in configfile (as in Fonzy Bleumer's PG). \r
-=========1.4.37b================\r
-- Two new options: BookDepth and BookTreshold. BookDepth limits the number of moves the book is used and BookTreshold sets the minimum weight a book move should have.\r
-=========1.4.36b================\r
-- Bugfix: option = 0/1 was translated incorrectly.\r
-- Default node count is 1.\r
-- EOF received from the engine should now be logged correctly (i.e. after the buffer is empty).\r
-- Bugfix: Nasty buffer overflow in the macro CONSTRUCT_ARG_STRING.\r
-- Bugfix: pipex_writeln (win32) was logging at the wrong spot. \r
-- Log board when an illegal move is received. \r
-=========1.4.35b================\r
-- New WbWorkAround for silly bug in WB. Depth <=1 clears the engine output window. Why should an engine not be allowed to send info at depth one?\r
-=========1.4.34b================\r
-- Warning: this release is less well tested as usual\r
-- Allow spaces around "=" in "option =" commands.\r
-- WbWorkArounds is now true by default. It decapitalizes Draw when this appears in engine option. \r
-- Trying to set a non existent UCI option gives an error. \r
-- PG will now resign in case of an illegal engine move. \r
-- More code has been put in "pipex".\r
-- info strings and unrecognized info lines are relayed to the GUI.\r
-=========1.4.33b================\r
-- New option: "WbWorkArounds" to work around bugs in WB. Currently it blocks options which contain "Draw" in their name from being sent to the GUI. Engines that have such options are Rybka and HIARCS. \r
-- Bugfix for ASSERT failure in bright. Now another ASSERT failure has appeared which seems to be bright's fault however. \r
-=========1.4.32b================\r
-- Bugfix: the default setting for RepeatPV had become false again...\r
-=========1.4.31b================\r
-- Bugfix: improper handling of vararg function.\r
-=========1.4.30b================\r
-- Some more meaningful error messages added.\r
-- Some buffer overflow checks added.\r
-- Simplification of strange signal kludge in gui.c. \r
-- Removal of obsolete code in engine.c and gui.c. Platform specific code has been abstracted and pushed into pipex_win32.c and pipex_posix.c\r
-- The format of the version number has changed once again. Debian was unhappy with the previous one.\r
-=========1.4b29================\r
-- Conversion from C++ to C (suggested by E.M.)\r
-- More refactoring. The win32 and posix I/O now have a uniform interface (see pipex.h). \r
-=========1.4b28================\r
-- Some comments added to explain the exact behaviour of some of the public functions in pipe.cpp. \r
-- LineInput now returns a bool which is FALSE in case of EOF. \r
-=========1.4b27================\r
-- Option "ScoreWhite" : report score from white's point of view (suggested by E.M.).\r
-- Option "KibitzInterval" : try to wait this many seconds between kibitzes (suggested by E.M.)\r
-=========1.4b26================\r
-- Contraction of version number.\r
-- Log if SetProcessAffinityMask is not available (suggested by E.M.).\r
-- pipe.cpp : Make PipeStruct a proper class with private/public members.\r
-- Check for EOF in GUI input.\r
-- pipe.cpp : delay reporting EOF until buffer is empty.\r
-- Messages from the Engine to PG were not logged in the windows version.\r
-=========1.4w10UCIb24===========\r
-- Portability fixes for WIN9X (Eric Mullins).\r
-- Portability fixes for MSVC++ (Eric Mullins).\r
-- Default setting of RepeatPV is now true.\r
-- Do not read data if input buffer is full (Windows).\r
-=========1.4w10UCIb22===========\r
-- Polyglot now completely poll free...\r
-=========1.4w10UCIb21===========\r
-- Crash bug in memory command fixed\r
-- Small optimizations\r
-=========1.4w10UCIb20===========\r
-- More refactoring.\r
-- No more polling for GUI input\r
-=========1.4w10UCIb18===========\r
-- Two new utilities: info-book and dump-book.\r
-=========1.4w10UCIb17===========\r
-- More refactoring. main.cpp is now #ifdef _WIN32 free.\r
-- The main loop (previously in adapter.cpp) is now in its own file mainloop.cpp.\r
-- adapter.cpp has been renamed into xboard2uci.cpp. It is #ifdef _WIN32 free.\r
-- EOF from the engine no longer kills PG. It should now\r
-be possible to close an engine and reopen another one (if that ever became useful) \r
-=========1.4w10UCIb16===========\r
-- xboard options commands\r
-- correction of handling of combo boxes in UCI protocol\r
-- "gui-mode". It is now possible to run PG without config file\r
-- The polyglot options are not exported, so they are now settable by the GUI\r
-=========1.4w10UCIb15===========\r
-- Due to refactoring time stamps in Windows would be written twice. \r
-This has been fixed. \r
-- More refactoring; the number of #ifdef _WIN32's has again been\r
-drastically reduced.\r
-=========1.4w10UCIb14===========\r
-- option to alter priority now also works on windows\r
-(Eric Mullins)\r
-- refactoring so that posix and win32 part share more\r
-code\r
-- a number of potential busy loop scenarios have been eliminated \r
-in the Windows code (Windows uses polling)\r
-- the return value of CreateProcess is now checked\r
-=========1.4w10UCIb13===========\r
-- perft mode exposed.\r
-=========1.4w10UCIb12===========\r
-- Replaced %lld everywhere by S64_FORMAT.\r
-=========1.4w10UCIb11===========\r
-- Crash bug fix (wrong parentheses in instruction that checked for help\r
-option).\r
-=========1.4w10UCIb10===========\r
-- It is now possible to do "make rpm" to make an rpm binary package. \r
-- Trivial bug fixes.\r
-- Documentation added for epd-test functionality (man page).\r
-- Cosmetic cleanups of output of epd-test.\r
-- "polyglot --help" output added.\r
-- Added polyglot book format specification to distribution.\r
-=========1.4w10UCIb9===========\r
-- Trivial cosmetic fixes\r
-- Some engines do not support the "Hash" options.\r
-So we do not send memory=1 in that case. \r
-=========1.4w10UCIb8===========\r
-- Support for egtpath command in xboard protocol\r
-=========1.4w10UCIb7===========\r
-- Debianization: it is now possible to do "make deb" to build a Debian/Ubuntu\r
-package.\r
-=========1.4w10UCIb6===========\r
-- UCI GUI support added. This makes it possible to use PG as a book engine\r
-on GUI's like ChessBase and Arena which normally only support their\r
-own proprietary format. \r
-\r
-- Support for new xboard "cores N" and "memory N" commands. See here\r
-for a complete description\r
-\r
- http://home.hccnet.nl/h.g.muller/engine-intf.html\r
-\r
-- Some work arounds for engines like Toga which only allow some settings\r
-to be set before the first "isready" command. \r
-\r
-- Autotooled distribution.\r
-\r
-- Proper manual page. The README file is generated automatically from this. \r
-\r
-- More sane naming of README files.\r
-\r
-- If BookLearn is false (the default) PG will open the book read only.\r
-\r
-- Windows and non-Windows log file formats are now the same.\r
-\r
-- Proper ChangeLog (you are reading it!).\r
-=========1.4w10================\r
-fixed analysis output for toga\r
-=========1.4w9=================\r
-fixed bug in 1.4w8\r
-added RepeatPV workaround\r
- fixed disappearing output in engine-output window while in multipv mode\r
- when an engine sends its move to polyglot,\r
- polyglot normally repeats the last pv string(which also contains score,depth and time usage) it got from the engine.\r
- Some engines however do not send a new pv string just before sending the move and the now old pv string\r
- find might confuse debugtools that parse the winboard debug files.\r
- Adding "RepeatPV = false" to the [POLYGLOT] section of the ini file stops this repetition.\r
- \r
-=========1.4w8=================\r
-fixed multipv output\r
-note that the pv with the worst score will be on top of the engine-output window.\r
-added timestamp in logfile (Jaap Weidemann)\r
-\r
-=========1.4w7=================\r
-compiles under linux/unix again\r
-=========1.4w6=================\r
-access to winboard draw/drawoffer and resign\r
-\r
- 1:to activate draw offers the engine has \r
- to define the "UCI_DrawOffers" parameter with the 'option" command at startup. \r
- 2:to offer a draw or accept a draw offer:just send "info string DrawOffer" to polyglot. \r
- 3:if winboard sends "draw" polyglot sends "setoption DrawOffer draw" to the engine.\r
- 4.to resign: send "info string Resign" to polyglot.\r
- please check the winboard documentation for the draw/drawoffer and resign commands.\r
- \r
-=========1.4w5:================\r
-Fixed errors in SyncStop handling.\r
-book building: the error message now also contains the game number \r
-added Affinity option:\r
-In the [PolyGlot] section(ini file):\r
-- "Affinity" mask\r
-mask is a bit vector in which each bit represents the processors that a process is allowed to run on.\r
-\r
-some minor bugs fixed\r
-\r
-checks if child did really quit.\r
-\r
-\r
+========1.4.63b=================
+- Give ponder move as hint.
+- Support for egtpath gaviota (this is a bit hacky right now).
+========1.4.62b=================
+- StringSize was not everywhere the same in Polyglot. This could lead to a buffer overflow in case of very long PV's.
+========1.4.61b=================
+- uci_isready replaced by uci_isready_sync. Polyglot should not send commands to the engine while it is syncing.
+========1.4.60b=================
+- The result string after an illegal move now shows the actual attempted move.
+========1.4.59b=================
+- Bugfix: the changes in 1.4.57b created a regression where the input buffer of polyglot could overflow with engines producing lots of output very fast.
+========1.4.58b=================
+- Implementation of BookDepth in UCI mode.
+- Small corrections to the manpage.
+========1.4.57b=================
+- First attempt at killing engines that do not react to "quit".
+========1.4.56b=================
+- Better handling of non-existing engine command on Linux. No changes on Windows.
+=========1.4.55b================
+- Suppression of some error dialogs.
+- Small delay in between final error message and actually quitting.
+=========1.4.54b================
+- More graceful handling of engine crashes.
+- New EngineCommand is now passed through wordexp on Linux.
+=========1.4.53b================
+- Multipv code by HGM.
+=========1.4.52b================
+- Reexport SyncStop. It is apparently necessary for the Aquarium Book Adapter.
+=========1.4.51b================
+- Support for new nps command. Code provided by Harm Geert Muller.
+=========1.4.50b================
+- Change in architecture. Persistence is disabled. The user is required to push the "Save" button explicitly to save the settings. What is retained is that in case PG is invoked with -noini (or as a special exception for WB 4.4.0 when the config files are polyglot_1st.ini or polyglot_2nd.ini) then PG uses a default config file whose name is derived from the engine name.
+- New option: OnlyWbOptions (default: true). Restrict the options that PG sends to those that are potentially useful for WinBoard.
+=========1.4.47b================
+- Try to detect if the engine is not an UCI engine.
+=========1.4.46b================
+- The default persistence directory on Windows is now _PG. The names of the engine specific ini files are mangled so as not to contain spaces.
+- PG now tries to guess if a string option is really a file or a path (like in the Arena GUI).
+=========1.4.45b================
+- The engine specific config files (<myname>.ini) are now stored in a separate directory. $HOME/.polyglot on Linux and "./Polyglot Settings" on Windows.
+- The engine specific config files are now complete config files. So they can be used in a stand alone fashion.
+- Implemented a minor hack to make xboard show error messages during startup.
+=========1.4.44b================
+- "Implementation" of new buttons and controls.
+- The "Persist" option is now persistent. That is if you turn of "Persist" then as a special case PG will remember this.
+- There is now a "reset" button which restores the default options. The code is commented out since WB does not support it yet.
+=========1.4.42b================
+- SaveSettingsOnExit/SaveFile renamed as Persist/PersistFile.
+- Many bug fixes in the persistence feature.
+- The PG_<myname>.ini file now contains only options that have been changed. So the resulting ini files are much smaller. This makes this version of PG usable on WB 4.3.15 as now the engine specific ini file will be empty (the user has no way to change options).
+=========1.4.41b================
+- Some segfaults fixed in case of corrupt config files.
+- Persistence of options. If the option SaveSettingsOnExit is true (the default) PolyGlot now saves its options in a file whose name is given by the option SaveFile which by default is equal to the engine name, prefixex by PG_ and suffixed by ".ini".
+=========1.4.39b================
+- Refactoring of config file parsing
+- Fix crash bug in epd-test
+- Do not export Chess960. This is handled completely internally.
+- Do not export UCI_Opponent and UCI_Chess960. These are handled internally.
+- PG can now also be comfortably configured through command line options (i.e. without using a config file).
+- Allow quotes in configfile (as in Fonzy Bleumer's PG).
+=========1.4.37b================
+- Two new options: BookDepth and BookTreshold. BookDepth limits the number of moves the book is used and BookTreshold sets the minimum weight a book move should have.
+=========1.4.36b================
+- Bugfix: option = 0/1 was translated incorrectly.
+- Default node count is 1.
+- EOF received from the engine should now be logged correctly (i.e. after the buffer is empty).
+- Bugfix: Nasty buffer overflow in the macro CONSTRUCT_ARG_STRING.
+- Bugfix: pipex_writeln (win32) was logging at the wrong spot.
+- Log board when an illegal move is received.
+=========1.4.35b================
+- New WbWorkAround for silly bug in WB. Depth <=1 clears the engine output window. Why should an engine not be allowed to send info at depth one?
+=========1.4.34b================
+- Warning: this release is less well tested as usual
+- Allow spaces around "=" in "option =" commands.
+- WbWorkArounds is now true by default. It decapitalizes Draw when this appears in engine option.
+- Trying to set a non existent UCI option gives an error.
+- PG will now resign in case of an illegal engine move.
+- More code has been put in "pipex".
+- info strings and unrecognized info lines are relayed to the GUI.
+=========1.4.33b================
+- New option: "WbWorkArounds" to work around bugs in WB. Currently it blocks options which contain "Draw" in their name from being sent to the GUI. Engines that have such options are Rybka and HIARCS.
+- Bugfix for ASSERT failure in bright. Now another ASSERT failure has appeared which seems to be bright's fault however.
+=========1.4.32b================
+- Bugfix: the default setting for RepeatPV had become false again...
+=========1.4.31b================
+- Bugfix: improper handling of vararg function.
+=========1.4.30b================
+- Some more meaningful error messages added.
+- Some buffer overflow checks added.
+- Simplification of strange signal kludge in gui.c.
+- Removal of obsolete code in engine.c and gui.c. Platform specific code has been abstracted and pushed into pipex_win32.c and pipex_posix.c
+- The format of the version number has changed once again. Debian was unhappy with the previous one.
+=========1.4b29================
+- Conversion from C++ to C (suggested by E.M.)
+- More refactoring. The win32 and posix I/O now have a uniform interface (see pipex.h).
+=========1.4b28================
+- Some comments added to explain the exact behaviour of some of the public functions in pipe.cpp.
+- LineInput now returns a bool which is FALSE in case of EOF.
+=========1.4b27================
+- Option "ScoreWhite" : report score from white's point of view (suggested by E.M.).
+- Option "KibitzInterval" : try to wait this many seconds between kibitzes (suggested by E.M.)
+=========1.4b26================
+- Contraction of version number.
+- Log if SetProcessAffinityMask is not available (suggested by E.M.).
+- pipe.cpp : Make PipeStruct a proper class with private/public members.
+- Check for EOF in GUI input.
+- pipe.cpp : delay reporting EOF until buffer is empty.
+- Messages from the Engine to PG were not logged in the windows version.
+=========1.4w10UCIb24===========
+- Portability fixes for WIN9X (Eric Mullins).
+- Portability fixes for MSVC++ (Eric Mullins).
+- Default setting of RepeatPV is now true.
+- Do not read data if input buffer is full (Windows).
+=========1.4w10UCIb22===========
+- Polyglot now completely poll free...
+=========1.4w10UCIb21===========
+- Crash bug in memory command fixed
+- Small optimizations
+=========1.4w10UCIb20===========
+- More refactoring.
+- No more polling for GUI input
+=========1.4w10UCIb18===========
+- Two new utilities: info-book and dump-book.
+=========1.4w10UCIb17===========
+- More refactoring. main.cpp is now #ifdef _WIN32 free.
+- The main loop (previously in adapter.cpp) is now in its own file mainloop.cpp.
+- adapter.cpp has been renamed into xboard2uci.cpp. It is #ifdef _WIN32 free.
+- EOF from the engine no longer kills PG. It should now
+be possible to close an engine and reopen another one (if that ever became useful)
+=========1.4w10UCIb16===========
+- xboard options commands
+- correction of handling of combo boxes in UCI protocol
+- "gui-mode". It is now possible to run PG without config file
+- The polyglot options are not exported, so they are now settable by the GUI
+=========1.4w10UCIb15===========
+- Due to refactoring time stamps in Windows would be written twice.
+This has been fixed.
+- More refactoring; the number of #ifdef _WIN32's has again been
+drastically reduced.
+=========1.4w10UCIb14===========
+- option to alter priority now also works on windows
+(Eric Mullins)
+- refactoring so that posix and win32 part share more
+code
+- a number of potential busy loop scenarios have been eliminated
+in the Windows code (Windows uses polling)
+- the return value of CreateProcess is now checked
+=========1.4w10UCIb13===========
+- perft mode exposed.
+=========1.4w10UCIb12===========
+- Replaced %lld everywhere by S64_FORMAT.
+=========1.4w10UCIb11===========
+- Crash bug fix (wrong parentheses in instruction that checked for help
+option).
+=========1.4w10UCIb10===========
+- It is now possible to do "make rpm" to make an rpm binary package.
+- Trivial bug fixes.
+- Documentation added for epd-test functionality (man page).
+- Cosmetic cleanups of output of epd-test.
+- "polyglot --help" output added.
+- Added polyglot book format specification to distribution.
+=========1.4w10UCIb9===========
+- Trivial cosmetic fixes
+- Some engines do not support the "Hash" options.
+So we do not send memory=1 in that case.
+=========1.4w10UCIb8===========
+- Support for egtpath command in xboard protocol
+=========1.4w10UCIb7===========
+- Debianization: it is now possible to do "make deb" to build a Debian/Ubuntu
+package.
+=========1.4w10UCIb6===========
+- UCI GUI support added. This makes it possible to use PG as a book engine
+on GUI's like ChessBase and Arena which normally only support their
+own proprietary format.
+
+- Support for new xboard "cores N" and "memory N" commands. See here
+for a complete description
+
+ http://home.hccnet.nl/h.g.muller/engine-intf.html
+
+- Some work arounds for engines like Toga which only allow some settings
+to be set before the first "isready" command.
+
+- Autotooled distribution.
+
+- Proper manual page. The README file is generated automatically from this.
+
+- More sane naming of README files.
+
+- If BookLearn is false (the default) PG will open the book read only.
+
+- Windows and non-Windows log file formats are now the same.
+
+- Proper ChangeLog (you are reading it!).
+=========1.4w10================
+fixed analysis output for toga
+=========1.4w9=================
+fixed bug in 1.4w8
+added RepeatPV workaround
+ fixed disappearing output in engine-output window while in multipv mode
+ when an engine sends its move to polyglot,
+ polyglot normally repeats the last pv string(which also contains score,depth and time usage) it got from the engine.
+ Some engines however do not send a new pv string just before sending the move and the now old pv string
+ find might confuse debugtools that parse the winboard debug files.
+ Adding "RepeatPV = false" to the [POLYGLOT] section of the ini file stops this repetition.
+
+=========1.4w8=================
+fixed multipv output
+note that the pv with the worst score will be on top of the engine-output window.
+added timestamp in logfile (Jaap Weidemann)
+
+=========1.4w7=================
+compiles under linux/unix again
+=========1.4w6=================
+access to winboard draw/drawoffer and resign
+
+ 1:to activate draw offers the engine has
+ to define the "UCI_DrawOffers" parameter with the 'option" command at startup.
+ 2:to offer a draw or accept a draw offer:just send "info string DrawOffer" to polyglot.
+ 3:if winboard sends "draw" polyglot sends "setoption DrawOffer draw" to the engine.
+ 4.to resign: send "info string Resign" to polyglot.
+ please check the winboard documentation for the draw/drawoffer and resign commands.
+
+=========1.4w5:================
+Fixed errors in SyncStop handling.
+book building: the error message now also contains the game number
+added Affinity option:
+In the [PolyGlot] section(ini file):
+- "Affinity" mask
+mask is a bit vector in which each bit represents the processors that a process is allowed to run on.
+
+some minor bugs fixed
+
+checks if child did really quit.
+
+
-\r
-Legal details\r
--------------\r
-\r
-PolyGlot 1.3 Copyright 2004-2005 Fabien Letouzey.\r
-\r
-This program is free software; you can redistribute it and/or modify\r
-it under the terms of the GNU General Public License as published by\r
-the Free Software Foundation; either version 2 of the License, or (at\r
-your option) any later version.\r
-\r
-This program is distributed in the hope that it will be useful, but\r
-WITHOUT ANY WARRANTY; without even the implied warranty of\r
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
-General Public License for more details.\r
-\r
-You should have received a copy of the GNU General Public License\r
-along with this program; if not, write to the Free Software\r
-Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307\r
-USA\r
-\r
-See the file "copying.txt" for details.\r
-\r
-\r
-General\r
--------\r
-\r
-PolyGlot 1.3 (2005/06/03).\r
-\r
-PolyGlot is a "UCI adapter". It connects a UCI chess engine to an\r
-xboard interface such as WinBoard. UCI2WB is another such adapter\r
-(for Windows).\r
-\r
-PolyGlot tries to solve known problems with other adapters. For\r
-instance, it detects and reports draws by fifty-move rule, repetition,\r
-etc ...\r
-\r
-\r
-Official distribution URL\r
--------------------------\r
-\r
-The official distribution web site is Leo Dijksman's WBEC Ridderkerk:\r
-http://wbec-ridderkerk.nl/ This is where you should be looking for\r
-PolyGlot updates in the future.\r
-\r
-\r
-Install\r
--------\r
-\r
-PolyGlot should have its own directory. The INI files for engines\r
-should also be put there. Dirtier solutions are needed when\r
-BookThinker is used though.\r
-\r
-On Windows the files "polyglot.exe" and "cygwin1.dll" (which you can\r
-download from http://wbec-ridderkerk.nl/) are needed. On Linux and\r
-Mac OS X only the file "polyglot_linux" or "polyglot_mac" is required.\r
-\r
-\r
-Compiling\r
----------\r
-\r
-The distribution comes up with Windows, Linux and Mac OS X binaries.\r
-Compiling is therefore not necessary on those systems unless you want\r
-to make a change in the program. In any case this section describes\r
-the compiling procedure, it is safe to skip it.\r
-\r
-PolyGlot is a POSIX application (Unix compatible), and was developed\r
-on Linux using g++ (the GNU C++ compiler).\r
-\r
-1) Unix\r
-\r
-You should be able to compile it on any POSIX-compliant operating\r
-system (*not* Windows) with the following command line (or similar):\r
-\r
-> g++ -O2 -o polyglot *.cpp\r
-\r
-IMPORTANT: In "io.cpp", the variable "UseCR" should be set to "false".\r
-\r
-A Makefile is provided but might not work on your system ...\r
-\r
-2) Windows\r
-\r
-On Windows, you *must* use Cygnus GCC to compile PolyGlot.\r
-\r
-IMPORTANT: In "io.cpp", the variable "UseCR" should be set to "true".\r
-\r
-\r
-Usage\r
------\r
-\r
-PolyGlot acts as an xboard engine. There should be no difference with\r
-a normal chess program as far as the interface (e.g. WinBoard) is\r
-concerned.\r
-\r
-PolyGlot is invoked using "polyglot <INI file>". Note that PolyGlot\r
-will look for the INI file in the current directory. If no <INI file>\r
-is given, "polyglot.ini" is selected.\r
-\r
-To use PolyGlot with XBoard, you would type something like this:\r
-> xboard -fd 'polyglot_dir' -fcp 'polyglot engine.ini'\r
-\r
-Quotes are important when there is a space in the argument.\r
-\r
-\r
-INI file\r
---------\r
-\r
-There should be a different INI file for each engine. Sections are\r
-composed of "variable = value" lines. See the sample INI files in the\r
-"example" directory.\r
-\r
-NOTE: There can be spaces in variable names or values. Do not use\r
-quotes.\r
-\r
-1) [PolyGlot] section\r
-\r
-This section is used by PolyGlot only. The engine is unaware of these\r
-options. The list of available options is detailed below in this\r
-document.\r
-\r
-2) [Engine] section\r
-\r
-This section contains engine UCI options. PolyGlot does not\r
-understand them, but sends the information to the engine at startup\r
-(converted to UCI form). You can add any UCI option that makes sense\r
-to the engine (not just the common options about hash-table size and\r
-tablebases).\r
-\r
-NOTE: use INI syntax, not UCI. For example "OwnBook = true" is\r
-correct. It will be replaced by PolyGlot with "setoption name OwnBook\r
-value true" at engine startup.\r
-\r
-Standard UCI options are "Hash", "NalimovPath", "NalimovCache" and\r
-"OwnBook". Hidden options like "Ponder" or "UCI_xxx" are automatic\r
-and should not be put in an INI file.\r
-\r
-The other options are engine-specific. Check their name using a UCI\r
-GUI or launch the engine in a console and type "uci".\r
-\r
-\r
-Options\r
--------\r
-\r
-These should be put in the [PolyGlot] section.\r
-\r
-- "EngineName" (default: UCI name)\r
-\r
-This is the name that will appear in the xboard interface. It is\r
-cosmetic only. You can use different names for tweaked versions of\r
-the same engine.\r
-\r
-If no "Engine Name" is given, the UCI name will be used.\r
-\r
-- "EngineDir" (default: ".")\r
-\r
-Full path of the directory where the engine is installed. You can use\r
-"." (without the quotes) if you know that PolyGlot will be launched in\r
-the engine directory or the engine is in the "path" and does not need\r
-any data file.\r
-\r
-- "EngineCommand"\r
-\r
-Put here the name of the engine executable file. You can also add\r
-command-line arguments. Path searching is used and the current\r
-directory will be "EngineDir".\r
-\r
-NOTE: Unix users are recommended to prepend "./"; this is required on\r
-some secure systems.\r
-\r
-- "Log" (default: false)\r
-\r
-Whether PolyGlot should log all transactions with the interface and\r
-the engine. This should be necessary only to locate problems.\r
-\r
-- "LogFile"\r
-\r
-The name of the log file. Note that it is put where PolyGlot was\r
-launched from, not into the engine directory.\r
-\r
-WARNING: Log files are not cleared between sessions, and can become\r
-very large. It is safe to remove them though.\r
-\r
-- "Resign" (default: false)\r
-\r
-Set this to "true" if you want PolyGlot to resign on behalf of the\r
-engine.\r
-\r
-NOTE: Some engines display buggy scores from time to time although the\r
-best move is correct. Use this option only if you know what you are\r
-doing (e.g. you always check the final position of games).\r
-\r
-- "ResignMoves" (default: 3)\r
-\r
-Number of consecutive moves with "resign" score (see below) before\r
-PolyGlot resigns for the engine. Positions with only one legal move\r
-are ignored.\r
-\r
-- "ResignScore" (default: 600)\r
-\r
-This is the score in centipawns that will trigger resign "counting".\r
-\r
-- "ShowPonder" (*** NEW ***, default: true)\r
-\r
-Show search information during engine pondering. Turning this off\r
-might be better for interactive use in some interfaces.\r
-\r
-- "KibitzMove" (*** NEW ***, default: false)\r
-\r
-Whether to kibitz when playing a move.\r
-\r
-- "KibitzPV" (*** NEW ***, default: false)\r
-\r
-Whether to kibitz when the PV is changed (new iteration or new best move).\r
-\r
-- "KibitzCommand" (*** NEW ***, default: "tellall")\r
-\r
-xboard command to use for kibitzing, normally "tellall" for kibitzing\r
-or "tellothers" for whispering.\r
-\r
-- "KibitzDelay" (*** NEW ***, default: 5)\r
-\r
-How many seconds to wait before starting kibitzing. This has an\r
-affect only if "KibitzPV" is selected, move kibitzes are always sent\r
-regardless of the delay.\r
-\r
-\r
-Work arounds\r
-------------\r
-\r
-Work arounds are identical to options except that they should be used\r
-only when necessary. Their purpose is to try to hide problems with\r
-various software (not just engines). The default value is always\r
-correct for bug-free software.\r
-\r
-IMPORTANT: Any of these work arounds might be removed in future\r
-versions of PolyGlot. You are strongly recommended to contact the\r
-author of faulty software and truly fix the problem.\r
-\r
-In PolyGlot 1.3 there is only one optional work around:\r
-\r
-- "UCIVersion" (default: 2)\r
-\r
-The default value of 2 corresponds to UCI+. Use 1 to select plain\r
-UCI for engines that have problems with UCI+.\r
-\r
-\r
-Opening Book\r
-------------\r
-\r
-*** NEW ***\r
-\r
-PolyGlot 1.3 provides a minimal opening-book implementation.\r
-\r
-New options can be added to the [PolyGlot] section:\r
-\r
-- "Book" (default: false)\r
-\r
-Indicates whether a PolyGlot book should be used. This has no effect\r
-on the engine own book (which can be controlled with the UCI option\r
-"OwnBook" in the [Engine] section). In particular, it is possible to\r
-use both a PolyGlot book and an engine book. In that case, the engine\r
-book will be used whenever PolyGlot is out of book. Remember that\r
-PolyGlot is unaware of whether the engine is itself using a book or\r
-not.\r
-\r
-- "BookFile"\r
-\r
-The name of the (binary) book file. Note that PolyGlot will look for\r
-it in the directory it was launched from, not in the engine directory.\r
-Of course, full path can be used in which case the current directory\r
-does not matter.\r
-\r
-Note that there is no option to control book usage. All parameters\r
-are fixed when compiling a PGN file into a binary book (see below).\r
-This is purposeful and is not likely to change.\r
-\r
-Using a book does not require any additional memory, this can be\r
-important for memory-limited tournaments.\r
-\r
-A default book "fruit.bin" is provided in the archive. Note that this\r
-book is very small and should probably not be used in serious games.\r
-I hope that users will make other books available in the future.\r
-\r
-\r
-Book Making\r
------------\r
-\r
-*** NEW ***\r
-\r
-You can compile a PGN file into a binary book using PolyGlot on the\r
-command line. At the moment, only a main (random) book is provided.\r
-It is not yet possible to control opening lines manually. I am\r
-working on it though.\r
-\r
-Usage: "polyglot make-book <options>".\r
-\r
-"make-book" options are:\r
-\r
-- "-pgn"\r
-\r
-Name of the input PGN file. PolyGlot should support any\r
-standard-conforming file. Let me know if you encounter a problem.\r
-\r
-- "-bin"\r
-\r
-Name of the output binary file. I suggest ".bin" as the extension but\r
-in fact PolyGlot does not care.\r
-\r
-- "-max-ply" (default: infinite)\r
-\r
-How many plies (half moves) to read for each game. E.g. if set to\r
-"20", only the first 10 full moves of each game will be scanned.\r
-\r
-- "-min-game" (default: 3)\r
-\r
-How many times must a move be played to be kept in the book. In other\r
-words, moves that were played too rarely will be left out. If you\r
-scan full games "2" seems a minimum, but if you selected lines\r
-manually "1" will make sense.\r
-\r
-Example: "polyglot make-book -pgn games.pgn -bin book.bin -max-ply 30".\r
-\r
-Building a book is usually very fast (a few minutes at most). Note\r
-however that a lot of memory may be required. To reduce memory usage,\r
-select a ply limit.\r
-\r
-\r
-History\r
--------\r
-\r
-2004/04/30: PolyGlot 1.0\r
-\r
-- first public release.\r
-\r
-2004/10/01: PolyGlot 1.1\r
-\r
-- added "StartupWait" and "PonderWorkAround" ("AutoQuit" was available\r
- in version 1.0 but not documented).\r
-\r
-- fixed a minor bug that could prevent "AutoQuit" from working with\r
- some engines.\r
-\r
-2005/01/29: PolyGlot 1.2\r
-\r
-- rewrote engine initialisation and UCI parsing to increase\r
- UCI-standard compliance\r
-\r
-- added multi-move resign\r
-\r
-- added an internal work around for engines hanging with WinBoard\r
-\r
-2005/06/03: PolyGlot 1.3\r
-\r
-- added opening book\r
-\r
-- added kibitzing\r
-\r
-- added "ShowPonder" option\r
-\r
-\r
-\r
-Known bugs\r
-----------\r
-\r
-*** IMPORTANT ***\r
-\r
-There is a bug (!) in the xboard automaton. The bug is related to\r
-searching in draw positions (e.g. 50-move rule or repetition). I had\r
-only been able to make PolyGlot crash by using analysis mode and\r
-performing manual takebacks. I believe that this bug can only happen\r
-in highly-interactive use (e.g. manual analysis). It is present in\r
-all versions of PolyGlot, including this one.\r
-\r
-I attempted a work around in February. I vaguely remember the change\r
-prevents crashing (not sure) but it is possible that PolyGlot now gets\r
-stuck in some rare case, i.e. it refuses to produce a move. In any\r
-case, the bug cannot occur silently, e.g. in a game that terminated\r
-normally.\r
-\r
-Because of the small expected impact (nobody ever reported it to me)\r
-and because fixing the bug would require a whole redesign of the\r
-xboard module, I have no intention of working on it at the moment (!).\r
-\r
-Make sure to let me know if it appeared in any circounstance, thanks!\r
-In particular if the bug ever occurs during a non-interactive session\r
-(e.g. engine vs. engine game), then I will do something.\r
-\r
-\r
-Thanks\r
-------\r
-\r
-Big thanks go to:\r
-\r
-- Dann Corbit for spending a lot of time compiling, testing, making\r
- files available, etc ...\r
-\r
-- Leo Dijksman for hosting the PolyGlot distribution on his web site\r
- (see Links) and also for thorough testing\r
-\r
-- Tord Romstad, Joshua Shriver and George Sobala for compiling and\r
- testing on Mac OS X\r
-\r
-- users in the WinBoard forum for their feedback and encouraging\r
- words: Roger Brown, Leo Dijksman, Igor Gorelikov, Mogens Larsen,\r
- Volker Pittlik, Norm Pollock, Günther Simon and Salvo Spitaleri\r
- in particular\r
-\r
-\r
-Links\r
------\r
-\r
-- Tim Mann's Chess Pages: http://www.tim-mann.org/xboard.html\r
-- Leo Dijksman's WBEC Ridderkerk: http://wbec-ridderkerk.nl/\r
-- Volker Pittlik's Winboard Forum: http://wbforum.volker-pittlik.name/\r
-\r
-\r
-Contact me\r
-----------\r
-\r
-You can contact me at fabien_letouzey@hotmail.com\r
-\r
-If I am not available, you can discuss PolyGlot issues in Volker\r
-Pittlik's Winboard Forum: http://wbforum.volker-pittlik.name/\r
-\r
-In fact for questions regarding specific Windows-only engines, you are\r
-advised to ask directly in the WinBoard forum, as I don't have Windows\r
-myself.\r
-\r
-\r
-The end\r
--------\r
-\r
-Fabien Letouzey, 2005/06/03.\r
-\r
+
+Legal details
+-------------
+
+PolyGlot 1.3 Copyright 2004-2005 Fabien Letouzey.
+
+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 2 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, write to the Free Software
+Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
+USA
+
+See the file "copying.txt" for details.
+
+
+General
+-------
+
+PolyGlot 1.3 (2005/06/03).
+
+PolyGlot is a "UCI adapter". It connects a UCI chess engine to an
+xboard interface such as WinBoard. UCI2WB is another such adapter
+(for Windows).
+
+PolyGlot tries to solve known problems with other adapters. For
+instance, it detects and reports draws by fifty-move rule, repetition,
+etc ...
+
+
+Official distribution URL
+-------------------------
+
+The official distribution web site is Leo Dijksman's WBEC Ridderkerk:
+http://wbec-ridderkerk.nl/ This is where you should be looking for
+PolyGlot updates in the future.
+
+
+Install
+-------
+
+PolyGlot should have its own directory. The INI files for engines
+should also be put there. Dirtier solutions are needed when
+BookThinker is used though.
+
+On Windows the files "polyglot.exe" and "cygwin1.dll" (which you can
+download from http://wbec-ridderkerk.nl/) are needed. On Linux and
+Mac OS X only the file "polyglot_linux" or "polyglot_mac" is required.
+
+
+Compiling
+---------
+
+The distribution comes up with Windows, Linux and Mac OS X binaries.
+Compiling is therefore not necessary on those systems unless you want
+to make a change in the program. In any case this section describes
+the compiling procedure, it is safe to skip it.
+
+PolyGlot is a POSIX application (Unix compatible), and was developed
+on Linux using g++ (the GNU C++ compiler).
+
+1) Unix
+
+You should be able to compile it on any POSIX-compliant operating
+system (*not* Windows) with the following command line (or similar):
+
+> g++ -O2 -o polyglot *.cpp
+
+IMPORTANT: In "io.cpp", the variable "UseCR" should be set to "false".
+
+A Makefile is provided but might not work on your system ...
+
+2) Windows
+
+On Windows, you *must* use Cygnus GCC to compile PolyGlot.
+
+IMPORTANT: In "io.cpp", the variable "UseCR" should be set to "true".
+
+
+Usage
+-----
+
+PolyGlot acts as an xboard engine. There should be no difference with
+a normal chess program as far as the interface (e.g. WinBoard) is
+concerned.
+
+PolyGlot is invoked using "polyglot <INI file>". Note that PolyGlot
+will look for the INI file in the current directory. If no <INI file>
+is given, "polyglot.ini" is selected.
+
+To use PolyGlot with XBoard, you would type something like this:
+> xboard -fd 'polyglot_dir' -fcp 'polyglot engine.ini'
+
+Quotes are important when there is a space in the argument.
+
+
+INI file
+--------
+
+There should be a different INI file for each engine. Sections are
+composed of "variable = value" lines. See the sample INI files in the
+"example" directory.
+
+NOTE: There can be spaces in variable names or values. Do not use
+quotes.
+
+1) [PolyGlot] section
+
+This section is used by PolyGlot only. The engine is unaware of these
+options. The list of available options is detailed below in this
+document.
+
+2) [Engine] section
+
+This section contains engine UCI options. PolyGlot does not
+understand them, but sends the information to the engine at startup
+(converted to UCI form). You can add any UCI option that makes sense
+to the engine (not just the common options about hash-table size and
+tablebases).
+
+NOTE: use INI syntax, not UCI. For example "OwnBook = true" is
+correct. It will be replaced by PolyGlot with "setoption name OwnBook
+value true" at engine startup.
+
+Standard UCI options are "Hash", "NalimovPath", "NalimovCache" and
+"OwnBook". Hidden options like "Ponder" or "UCI_xxx" are automatic
+and should not be put in an INI file.
+
+The other options are engine-specific. Check their name using a UCI
+GUI or launch the engine in a console and type "uci".
+
+
+Options
+-------
+
+These should be put in the [PolyGlot] section.
+
+- "EngineName" (default: UCI name)
+
+This is the name that will appear in the xboard interface. It is
+cosmetic only. You can use different names for tweaked versions of
+the same engine.
+
+If no "Engine Name" is given, the UCI name will be used.
+
+- "EngineDir" (default: ".")
+
+Full path of the directory where the engine is installed. You can use
+"." (without the quotes) if you know that PolyGlot will be launched in
+the engine directory or the engine is in the "path" and does not need
+any data file.
+
+- "EngineCommand"
+
+Put here the name of the engine executable file. You can also add
+command-line arguments. Path searching is used and the current
+directory will be "EngineDir".
+
+NOTE: Unix users are recommended to prepend "./"; this is required on
+some secure systems.
+
+- "Log" (default: false)
+
+Whether PolyGlot should log all transactions with the interface and
+the engine. This should be necessary only to locate problems.
+
+- "LogFile"
+
+The name of the log file. Note that it is put where PolyGlot was
+launched from, not into the engine directory.
+
+WARNING: Log files are not cleared between sessions, and can become
+very large. It is safe to remove them though.
+
+- "Resign" (default: false)
+
+Set this to "true" if you want PolyGlot to resign on behalf of the
+engine.
+
+NOTE: Some engines display buggy scores from time to time although the
+best move is correct. Use this option only if you know what you are
+doing (e.g. you always check the final position of games).
+
+- "ResignMoves" (default: 3)
+
+Number of consecutive moves with "resign" score (see below) before
+PolyGlot resigns for the engine. Positions with only one legal move
+are ignored.
+
+- "ResignScore" (default: 600)
+
+This is the score in centipawns that will trigger resign "counting".
+
+- "ShowPonder" (*** NEW ***, default: true)
+
+Show search information during engine pondering. Turning this off
+might be better for interactive use in some interfaces.
+
+- "KibitzMove" (*** NEW ***, default: false)
+
+Whether to kibitz when playing a move.
+
+- "KibitzPV" (*** NEW ***, default: false)
+
+Whether to kibitz when the PV is changed (new iteration or new best move).
+
+- "KibitzCommand" (*** NEW ***, default: "tellall")
+
+xboard command to use for kibitzing, normally "tellall" for kibitzing
+or "tellothers" for whispering.
+
+- "KibitzDelay" (*** NEW ***, default: 5)
+
+How many seconds to wait before starting kibitzing. This has an
+affect only if "KibitzPV" is selected, move kibitzes are always sent
+regardless of the delay.
+
+
+Work arounds
+------------
+
+Work arounds are identical to options except that they should be used
+only when necessary. Their purpose is to try to hide problems with
+various software (not just engines). The default value is always
+correct for bug-free software.
+
+IMPORTANT: Any of these work arounds might be removed in future
+versions of PolyGlot. You are strongly recommended to contact the
+author of faulty software and truly fix the problem.
+
+In PolyGlot 1.3 there is only one optional work around:
+
+- "UCIVersion" (default: 2)
+
+The default value of 2 corresponds to UCI+. Use 1 to select plain
+UCI for engines that have problems with UCI+.
+
+
+Opening Book
+------------
+
+*** NEW ***
+
+PolyGlot 1.3 provides a minimal opening-book implementation.
+
+New options can be added to the [PolyGlot] section:
+
+- "Book" (default: false)
+
+Indicates whether a PolyGlot book should be used. This has no effect
+on the engine own book (which can be controlled with the UCI option
+"OwnBook" in the [Engine] section). In particular, it is possible to
+use both a PolyGlot book and an engine book. In that case, the engine
+book will be used whenever PolyGlot is out of book. Remember that
+PolyGlot is unaware of whether the engine is itself using a book or
+not.
+
+- "BookFile"
+
+The name of the (binary) book file. Note that PolyGlot will look for
+it in the directory it was launched from, not in the engine directory.
+Of course, full path can be used in which case the current directory
+does not matter.
+
+Note that there is no option to control book usage. All parameters
+are fixed when compiling a PGN file into a binary book (see below).
+This is purposeful and is not likely to change.
+
+Using a book does not require any additional memory, this can be
+important for memory-limited tournaments.
+
+A default book "fruit.bin" is provided in the archive. Note that this
+book is very small and should probably not be used in serious games.
+I hope that users will make other books available in the future.
+
+
+Book Making
+-----------
+
+*** NEW ***
+
+You can compile a PGN file into a binary book using PolyGlot on the
+command line. At the moment, only a main (random) book is provided.
+It is not yet possible to control opening lines manually. I am
+working on it though.
+
+Usage: "polyglot make-book <options>".
+
+"make-book" options are:
+
+- "-pgn"
+
+Name of the input PGN file. PolyGlot should support any
+standard-conforming file. Let me know if you encounter a problem.
+
+- "-bin"
+
+Name of the output binary file. I suggest ".bin" as the extension but
+in fact PolyGlot does not care.
+
+- "-max-ply" (default: infinite)
+
+How many plies (half moves) to read for each game. E.g. if set to
+"20", only the first 10 full moves of each game will be scanned.
+
+- "-min-game" (default: 3)
+
+How many times must a move be played to be kept in the book. In other
+words, moves that were played too rarely will be left out. If you
+scan full games "2" seems a minimum, but if you selected lines
+manually "1" will make sense.
+
+Example: "polyglot make-book -pgn games.pgn -bin book.bin -max-ply 30".
+
+Building a book is usually very fast (a few minutes at most). Note
+however that a lot of memory may be required. To reduce memory usage,
+select a ply limit.
+
+
+History
+-------
+
+2004/04/30: PolyGlot 1.0
+
+- first public release.
+
+2004/10/01: PolyGlot 1.1
+
+- added "StartupWait" and "PonderWorkAround" ("AutoQuit" was available
+ in version 1.0 but not documented).
+
+- fixed a minor bug that could prevent "AutoQuit" from working with
+ some engines.
+
+2005/01/29: PolyGlot 1.2
+
+- rewrote engine initialisation and UCI parsing to increase
+ UCI-standard compliance
+
+- added multi-move resign
+
+- added an internal work around for engines hanging with WinBoard
+
+2005/06/03: PolyGlot 1.3
+
+- added opening book
+
+- added kibitzing
+
+- added "ShowPonder" option
+
+
+
+Known bugs
+----------
+
+*** IMPORTANT ***
+
+There is a bug (!) in the xboard automaton. The bug is related to
+searching in draw positions (e.g. 50-move rule or repetition). I had
+only been able to make PolyGlot crash by using analysis mode and
+performing manual takebacks. I believe that this bug can only happen
+in highly-interactive use (e.g. manual analysis). It is present in
+all versions of PolyGlot, including this one.
+
+I attempted a work around in February. I vaguely remember the change
+prevents crashing (not sure) but it is possible that PolyGlot now gets
+stuck in some rare case, i.e. it refuses to produce a move. In any
+case, the bug cannot occur silently, e.g. in a game that terminated
+normally.
+
+Because of the small expected impact (nobody ever reported it to me)
+and because fixing the bug would require a whole redesign of the
+xboard module, I have no intention of working on it at the moment (!).
+
+Make sure to let me know if it appeared in any circounstance, thanks!
+In particular if the bug ever occurs during a non-interactive session
+(e.g. engine vs. engine game), then I will do something.
+
+
+Thanks
+------
+
+Big thanks go to:
+
+- Dann Corbit for spending a lot of time compiling, testing, making
+ files available, etc ...
+
+- Leo Dijksman for hosting the PolyGlot distribution on his web site
+ (see Links) and also for thorough testing
+
+- Tord Romstad, Joshua Shriver and George Sobala for compiling and
+ testing on Mac OS X
+
+- users in the WinBoard forum for their feedback and encouraging
+ words: Roger Brown, Leo Dijksman, Igor Gorelikov, Mogens Larsen,
+ Volker Pittlik, Norm Pollock, Günther Simon and Salvo Spitaleri
+ in particular
+
+
+Links
+-----
+
+- Tim Mann's Chess Pages: http://www.tim-mann.org/xboard.html
+- Leo Dijksman's WBEC Ridderkerk: http://wbec-ridderkerk.nl/
+- Volker Pittlik's Winboard Forum: http://wbforum.volker-pittlik.name/
+
+
+Contact me
+----------
+
+You can contact me at fabien_letouzey@hotmail.com
+
+If I am not available, you can discuss PolyGlot issues in Volker
+Pittlik's Winboard Forum: http://wbforum.volker-pittlik.name/
+
+In fact for questions regarding specific Windows-only engines, you are
+advised to ask directly in the WinBoard forum, as I don't have Windows
+myself.
+
+
+The end
+-------
+
+Fabien Letouzey, 2005/06/03.
+
-=== PolyGlot 1.4W ====\r
-Polyglot 1.4W is a modified polyglot 1.4 from Fabien Letouzy.\r
-Just like polyglot 1.3w(see below) it can be compiled and run under windows without\r
-the need for a cygwin1.dll\r
-\r
-Best\r
-Fonzy\r
-www.geenvis.net\r
-=========1.4w10================\r
-fixed analysis output for toga\r
-=========1.4w9=================\r
-fixed bug in 1.4w8\r
-added RepeatPV workaround\r
- fixed disappearing output in engine-output window while in multipv mode\r
- when an engine sends its move to polyglot,\r
- polyglot normally repeats the last pv string(which also contains score,depth and time usage) it got from the engine.\r
- Some engines however do not send a new pv string just before sending the move and the now old pv string\r
- find might confuse debugtools that parse the winboard debug files.\r
- Adding "RepeatPV = false" to the [POLYGLOT] section of the ini file stops this repetition.\r
- \r
-=========1.4w8=================\r
-fixed multipv output\r
-note that the pv with the worst score will be on top of the engine-output window.\r
-added timestamp in logfile (Jaap Weidemann)\r
-\r
-=========1.4w7=================\r
-compiles under linux/unix again\r
-=========1.4w6=================\r
-access to winboard draw/drawoffer and resign\r
-\r
- 1:to activate draw offers the engine has \r
- to define the "UCI_DrawOffers" parameter with the 'option" command at startup. \r
- 2:to offer a draw or accept a draw offer:just send "info string DrawOffer" to polyglot. \r
- 3:if winboard sends "draw" polyglot sends "setoption DrawOffer draw" to the engine.\r
- 4.to resign: send "info string Resign" to polyglot.\r
- please check the winboard documentation for the draw/drawoffer and resign commands.\r
- \r
-=========1.4w5:================\r
-Fixed errors in SyncStop handling.\r
-book building: the error message now also contains the game number \r
-added Affinity option:\r
-In the [PolyGlot] section(ini file):\r
-- "Affinity" mask\r
-mask is a bit vector in which each bit represents the processors that a process is allowed to run on.\r
-\r
-some minor bugs fixed\r
-\r
-checks if child did really quit.\r
-\r
-*********************************************************\r
-=== PolyGlot 1.3W ReadMe ===\r
-\r
-PolyGlot - a UCI-to-WinBoard Adapter for UCI Chess Engines\r
-Designed by Fabien Letouzey and Morning Yellow\r
-Version: 1.3W, Last Modified: Jan. 2006\r
-\r
-PolyGlot 1.3W is the modified version of 1.3 by Fabien Letouzey,\r
-which can be compiled and run under Windows without CygWin.\r
-\r
-The version of 1.3W has the following modifications:\r
-1. Added a module, "pipe.h/pipe.cpp".\r
-2. Removed two modules, "io.h/io.cpp" and "engine.h/engine.cpp".\r
-3. Modified all statements related on these modules.\r
-4. fixed "Move Now" (the bug fixed in PolyGlot 1.4).\r
-\r
-PolyGlot 1.3W can be downloaded from:\r
-http://www.elephantbase.net/download/polyglot.rar\r
-For information of "PolyGlot 1.3", see "readme.txt"\r
-For legal information, see "copying.txt"\r
+=== PolyGlot 1.4W ====
+Polyglot 1.4W is a modified polyglot 1.4 from Fabien Letouzy.
+Just like polyglot 1.3w(see below) it can be compiled and run under windows without
+the need for a cygwin1.dll
+
+Best
+Fonzy
+www.geenvis.net
+=========1.4w10================
+fixed analysis output for toga
+=========1.4w9=================
+fixed bug in 1.4w8
+added RepeatPV workaround
+ fixed disappearing output in engine-output window while in multipv mode
+ when an engine sends its move to polyglot,
+ polyglot normally repeats the last pv string(which also contains score,depth and time usage) it got from the engine.
+ Some engines however do not send a new pv string just before sending the move and the now old pv string
+ find might confuse debugtools that parse the winboard debug files.
+ Adding "RepeatPV = false" to the [POLYGLOT] section of the ini file stops this repetition.
+
+=========1.4w8=================
+fixed multipv output
+note that the pv with the worst score will be on top of the engine-output window.
+added timestamp in logfile (Jaap Weidemann)
+
+=========1.4w7=================
+compiles under linux/unix again
+=========1.4w6=================
+access to winboard draw/drawoffer and resign
+
+ 1:to activate draw offers the engine has
+ to define the "UCI_DrawOffers" parameter with the 'option" command at startup.
+ 2:to offer a draw or accept a draw offer:just send "info string DrawOffer" to polyglot.
+ 3:if winboard sends "draw" polyglot sends "setoption DrawOffer draw" to the engine.
+ 4.to resign: send "info string Resign" to polyglot.
+ please check the winboard documentation for the draw/drawoffer and resign commands.
+
+=========1.4w5:================
+Fixed errors in SyncStop handling.
+book building: the error message now also contains the game number
+added Affinity option:
+In the [PolyGlot] section(ini file):
+- "Affinity" mask
+mask is a bit vector in which each bit represents the processors that a process is allowed to run on.
+
+some minor bugs fixed
+
+checks if child did really quit.
+
+*********************************************************
+=== PolyGlot 1.3W ReadMe ===
+
+PolyGlot - a UCI-to-WinBoard Adapter for UCI Chess Engines
+Designed by Fabien Letouzey and Morning Yellow
+Version: 1.3W, Last Modified: Jan. 2006
+
+PolyGlot 1.3W is the modified version of 1.3 by Fabien Letouzey,
+which can be compiled and run under Windows without CygWin.
+
+The version of 1.3W has the following modifications:
+1. Added a module, "pipe.h/pipe.cpp".
+2. Removed two modules, "io.h/io.cpp" and "engine.h/engine.cpp".
+3. Modified all statements related on these modules.
+4. fixed "Move Now" (the bug fixed in PolyGlot 1.4).
+
+PolyGlot 1.3W can be downloaded from:
+http://www.elephantbase.net/download/polyglot.rar
+For information of "PolyGlot 1.3", see "readme.txt"
+For legal information, see "copying.txt"
-\r
-// attack.c\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "colour.h"\r
-#include "move.h"\r
-#include "attack.h"\r
-#include "piece.h"\r
-#include "util.h"\r
-\r
-// macros\r
-\r
-#define DELTA_INC(delta) (DeltaInc[128+(delta)])\r
-#define DELTA_MASK(delta) (DeltaMask[128+(delta)])\r
-\r
-// "constants"\r
-\r
-const sint8 KnightInc[8+1] = {\r
- -33, -31, -18, -14, +14, +18, +31, +33, 0\r
-};\r
-\r
-const sint8 BishopInc[4+1] = {\r
- -17, -15, +15, +17, 0\r
-};\r
-\r
-const sint8 RookInc[4+1] = {\r
- -16, -1, +1, +16, 0\r
-};\r
-\r
-const sint8 QueenInc[8+1] = {\r
- -17, -16, -15, -1, +1, +15, +16, +17, 0\r
-};\r
-\r
-const sint8 KingInc[8+1] = {\r
- -17, -16, -15, -1, +1, +15, +16, +17, 0\r
-};\r
-\r
-// variables\r
-\r
-static sint8 DeltaInc[256];\r
-static uint8 DeltaMask[256];\r
-\r
-// prototypes\r
-\r
-static bool delta_is_ok (int delta);\r
-static bool inc_is_ok (int inc);\r
-\r
-// functions\r
-\r
-// attack_init()\r
-\r
-void attack_init() {\r
-\r
- int delta;\r
- int dir, inc, dist;\r
-\r
- for (delta = -128; delta < +128; delta++) {\r
- DeltaInc[128+delta] = IncNone;\r
- DeltaMask[128+delta] = 0;\r
- }\r
-\r
- DeltaMask[128-17] |= BlackPawnFlag;\r
- DeltaMask[128-15] |= BlackPawnFlag;\r
-\r
- DeltaMask[128+15] |= WhitePawnFlag;\r
- DeltaMask[128+17] |= WhitePawnFlag;\r
-\r
- for (dir = 0; dir < 8; dir++) {\r
- delta = KnightInc[dir];\r
- ASSERT(delta_is_ok(delta));\r
- DeltaMask[128+delta] |= KnightFlag;\r
- }\r
-\r
- for (dir = 0; dir < 4; dir++) {\r
- inc = BishopInc[dir];\r
- ASSERT(inc!=IncNone);\r
- for (dist = 1; dist < 8; dist++) {\r
- delta = inc*dist;\r
- ASSERT(delta_is_ok(delta));\r
- ASSERT(DeltaInc[128+delta]==IncNone);\r
- DeltaInc[128+delta] = inc;\r
- DeltaMask[128+delta] |= BishopFlag;\r
- }\r
- }\r
-\r
- for (dir = 0; dir < 4; dir++) {\r
- inc = RookInc[dir];\r
- ASSERT(inc!=IncNone);\r
- for (dist = 1; dist < 8; dist++) {\r
- delta = inc*dist;\r
- ASSERT(delta_is_ok(delta));\r
- ASSERT(DeltaInc[128+delta]==IncNone);\r
- DeltaInc[128+delta] = inc;\r
- DeltaMask[128+delta] |= RookFlag;\r
- }\r
- }\r
-\r
- for (dir = 0; dir < 8; dir++) {\r
- delta = KingInc[dir];\r
- ASSERT(delta_is_ok(delta));\r
- DeltaMask[128+delta] |= KingFlag;\r
- }\r
-}\r
-\r
-// delta_is_ok()\r
-\r
-static bool delta_is_ok(int delta) {\r
-\r
- if (delta < -119 || delta > +119) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// inc_is_ok()\r
-\r
-static bool inc_is_ok(int inc) {\r
-\r
- int dir;\r
-\r
- for (dir = 0; dir < 8; dir++) {\r
- if (KingInc[dir] == inc) return TRUE;\r
- }\r
-\r
- return FALSE;\r
-}\r
-\r
-// is_in_check()\r
-\r
-bool is_in_check(const board_t * board, int colour) {\r
-\r
- ASSERT(board_is_ok(board));\r
- ASSERT(colour_is_ok(colour));\r
-\r
- return is_attacked(board,king_pos(board,colour),colour_opp(colour));\r
-}\r
-\r
-// is_attacked()\r
-\r
-bool is_attacked(const board_t * board, int to, int colour) {\r
-\r
- const uint8 * ptr;\r
- int from, piece;\r
-\r
- ASSERT(board_is_ok(board));\r
- ASSERT(square_is_ok(to));\r
- ASSERT(colour_is_ok(colour));\r
-\r
- for (ptr = board->list[colour]; (from=*ptr) != SquareNone; ptr++) {\r
-\r
- piece = board->square[from];\r
- ASSERT(colour_equal(piece,colour));\r
-\r
- if (piece_attack(board,piece,from,to)) return TRUE;\r
- }\r
-\r
- return FALSE;\r
-}\r
-\r
-// piece_attack()\r
-\r
-bool piece_attack(const board_t * board, int piece, int from, int to) {\r
-\r
- int delta;\r
- int inc, sq;\r
-\r
- ASSERT(board_is_ok(board));\r
- ASSERT(piece_is_ok(piece));\r
- ASSERT(square_is_ok(from));\r
- ASSERT(square_is_ok(to));\r
-\r
- delta = to - from;\r
- ASSERT(delta_is_ok(delta));\r
-\r
- if ((piece & DELTA_MASK(delta)) == 0) return FALSE; // no pseudo-attack\r
-\r
- if (!piece_is_slider(piece)) return TRUE;\r
-\r
- inc = DELTA_INC(delta);\r
- ASSERT(inc_is_ok(inc));\r
-\r
- for (sq = from+inc; sq != to; sq += inc) {\r
- ASSERT(square_is_ok(sq));\r
- if (board->square[sq] != Empty) return FALSE; // blocker\r
- }\r
-\r
- return TRUE;\r
-}\r
-\r
-// is_pinned()\r
-\r
-bool is_pinned(const board_t * board, int from, int to, int colour) {\r
-\r
- int king;\r
- int inc;\r
- int sq, piece;\r
-\r
- ASSERT(board!=NULL);\r
- ASSERT(square_is_ok(from));\r
- ASSERT(square_is_ok(to));\r
- ASSERT(colour_is_ok(colour));\r
-\r
- king = king_pos(board,colour);\r
-\r
- inc = DELTA_INC(king-from);\r
- if (inc == IncNone) return FALSE; // not a line\r
-\r
- sq = from;\r
- do sq += inc; while (board->square[sq] == Empty);\r
-\r
- if (sq != king) return FALSE; // blocker\r
-\r
- sq = from;\r
- do sq -= inc; while ((piece=board->square[sq]) == Empty);\r
-\r
- return square_is_ok(sq)\r
- && (piece & DELTA_MASK(king-sq)) != 0\r
- && piece_colour(piece) == colour_opp(colour)\r
- && DELTA_INC(king-to) != inc;\r
-}\r
-\r
-// end of attack.cpp\r
-\r
+
+// attack.c
+
+// includes
+
+#include "board.h"
+#include "colour.h"
+#include "move.h"
+#include "attack.h"
+#include "piece.h"
+#include "util.h"
+
+// macros
+
+#define DELTA_INC(delta) (DeltaInc[128+(delta)])
+#define DELTA_MASK(delta) (DeltaMask[128+(delta)])
+
+// "constants"
+
+const sint8 KnightInc[8+1] = {
+ -33, -31, -18, -14, +14, +18, +31, +33, 0
+};
+
+const sint8 BishopInc[4+1] = {
+ -17, -15, +15, +17, 0
+};
+
+const sint8 RookInc[4+1] = {
+ -16, -1, +1, +16, 0
+};
+
+const sint8 QueenInc[8+1] = {
+ -17, -16, -15, -1, +1, +15, +16, +17, 0
+};
+
+const sint8 KingInc[8+1] = {
+ -17, -16, -15, -1, +1, +15, +16, +17, 0
+};
+
+// variables
+
+static sint8 DeltaInc[256];
+static uint8 DeltaMask[256];
+
+// prototypes
+
+static bool delta_is_ok (int delta);
+static bool inc_is_ok (int inc);
+
+// functions
+
+// attack_init()
+
+void attack_init() {
+
+ int delta;
+ int dir, inc, dist;
+
+ for (delta = -128; delta < +128; delta++) {
+ DeltaInc[128+delta] = IncNone;
+ DeltaMask[128+delta] = 0;
+ }
+
+ DeltaMask[128-17] |= BlackPawnFlag;
+ DeltaMask[128-15] |= BlackPawnFlag;
+
+ DeltaMask[128+15] |= WhitePawnFlag;
+ DeltaMask[128+17] |= WhitePawnFlag;
+
+ for (dir = 0; dir < 8; dir++) {
+ delta = KnightInc[dir];
+ ASSERT(delta_is_ok(delta));
+ DeltaMask[128+delta] |= KnightFlag;
+ }
+
+ for (dir = 0; dir < 4; dir++) {
+ inc = BishopInc[dir];
+ ASSERT(inc!=IncNone);
+ for (dist = 1; dist < 8; dist++) {
+ delta = inc*dist;
+ ASSERT(delta_is_ok(delta));
+ ASSERT(DeltaInc[128+delta]==IncNone);
+ DeltaInc[128+delta] = inc;
+ DeltaMask[128+delta] |= BishopFlag;
+ }
+ }
+
+ for (dir = 0; dir < 4; dir++) {
+ inc = RookInc[dir];
+ ASSERT(inc!=IncNone);
+ for (dist = 1; dist < 8; dist++) {
+ delta = inc*dist;
+ ASSERT(delta_is_ok(delta));
+ ASSERT(DeltaInc[128+delta]==IncNone);
+ DeltaInc[128+delta] = inc;
+ DeltaMask[128+delta] |= RookFlag;
+ }
+ }
+
+ for (dir = 0; dir < 8; dir++) {
+ delta = KingInc[dir];
+ ASSERT(delta_is_ok(delta));
+ DeltaMask[128+delta] |= KingFlag;
+ }
+}
+
+// delta_is_ok()
+
+static bool delta_is_ok(int delta) {
+
+ if (delta < -119 || delta > +119) return FALSE;
+
+ return TRUE;
+}
+
+// inc_is_ok()
+
+static bool inc_is_ok(int inc) {
+
+ int dir;
+
+ for (dir = 0; dir < 8; dir++) {
+ if (KingInc[dir] == inc) return TRUE;
+ }
+
+ return FALSE;
+}
+
+// is_in_check()
+
+bool is_in_check(const board_t * board, int colour) {
+
+ ASSERT(board_is_ok(board));
+ ASSERT(colour_is_ok(colour));
+
+ return is_attacked(board,king_pos(board,colour),colour_opp(colour));
+}
+
+// is_attacked()
+
+bool is_attacked(const board_t * board, int to, int colour) {
+
+ const uint8 * ptr;
+ int from, piece;
+
+ ASSERT(board_is_ok(board));
+ ASSERT(square_is_ok(to));
+ ASSERT(colour_is_ok(colour));
+
+ for (ptr = board->list[colour]; (from=*ptr) != SquareNone; ptr++) {
+
+ piece = board->square[from];
+ ASSERT(colour_equal(piece,colour));
+
+ if (piece_attack(board,piece,from,to)) return TRUE;
+ }
+
+ return FALSE;
+}
+
+// piece_attack()
+
+bool piece_attack(const board_t * board, int piece, int from, int to) {
+
+ int delta;
+ int inc, sq;
+
+ ASSERT(board_is_ok(board));
+ ASSERT(piece_is_ok(piece));
+ ASSERT(square_is_ok(from));
+ ASSERT(square_is_ok(to));
+
+ delta = to - from;
+ ASSERT(delta_is_ok(delta));
+
+ if ((piece & DELTA_MASK(delta)) == 0) return FALSE; // no pseudo-attack
+
+ if (!piece_is_slider(piece)) return TRUE;
+
+ inc = DELTA_INC(delta);
+ ASSERT(inc_is_ok(inc));
+
+ for (sq = from+inc; sq != to; sq += inc) {
+ ASSERT(square_is_ok(sq));
+ if (board->square[sq] != Empty) return FALSE; // blocker
+ }
+
+ return TRUE;
+}
+
+// is_pinned()
+
+bool is_pinned(const board_t * board, int from, int to, int colour) {
+
+ int king;
+ int inc;
+ int sq, piece;
+
+ ASSERT(board!=NULL);
+ ASSERT(square_is_ok(from));
+ ASSERT(square_is_ok(to));
+ ASSERT(colour_is_ok(colour));
+
+ king = king_pos(board,colour);
+
+ inc = DELTA_INC(king-from);
+ if (inc == IncNone) return FALSE; // not a line
+
+ sq = from;
+ do sq += inc; while (board->square[sq] == Empty);
+
+ if (sq != king) return FALSE; // blocker
+
+ sq = from;
+ do sq -= inc; while ((piece=board->square[sq]) == Empty);
+
+ return square_is_ok(sq)
+ && (piece & DELTA_MASK(king-sq)) != 0
+ && piece_colour(piece) == colour_opp(colour)
+ && DELTA_INC(king-to) != inc;
+}
+
+// end of attack.cpp
+
-\r
-// attack.h\r
-\r
-#ifndef ATTACK_H\r
-#define ATTACK_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "util.h"\r
-\r
-// defines \r
-\r
-#define IncNone 0\r
-\r
-// "constants"\r
-\r
-extern const sint8 KnightInc[8+1];\r
-extern const sint8 BishopInc[4+1];\r
-extern const sint8 RookInc[4+1];\r
-extern const sint8 QueenInc[8+1];\r
-extern const sint8 KingInc[8+1];\r
-\r
-// functions\r
-\r
-extern void attack_init ();\r
-\r
-extern bool is_in_check (const board_t * board, int colour);\r
-extern bool is_attacked (const board_t * board, int to, int colour);\r
-extern bool piece_attack (const board_t * board, int piece, int from, int to);\r
-\r
-extern bool is_pinned (const board_t * board, int from, int to, int colour);\r
-\r
-#endif // !defined ATTACK_H\r
-\r
-// end of attack.h\r
-\r
+
+// attack.h
+
+#ifndef ATTACK_H
+#define ATTACK_H
+
+// includes
+
+#include "board.h"
+#include "util.h"
+
+// defines
+
+#define IncNone 0
+
+// "constants"
+
+extern const sint8 KnightInc[8+1];
+extern const sint8 BishopInc[4+1];
+extern const sint8 RookInc[4+1];
+extern const sint8 QueenInc[8+1];
+extern const sint8 KingInc[8+1];
+
+// functions
+
+extern void attack_init ();
+
+extern bool is_in_check (const board_t * board, int colour);
+extern bool is_attacked (const board_t * board, int to, int colour);
+extern bool piece_attack (const board_t * board, int piece, int from, int to);
+
+extern bool is_pinned (const board_t * board, int from, int to, int colour);
+
+#endif // !defined ATTACK_H
+
+// end of attack.h
+
-\r
-// board.c\r
-\r
-// includes\r
-\r
-#include <stdio.h>\r
-\r
-#include "attack.h"\r
-#include "board.h"\r
-#include "colour.h"\r
-#include "fen.h"\r
-#include "hash.h"\r
-#include "list.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_gen.h"\r
-#include "move_legal.h"\r
-#include "piece.h"\r
-#include "util.h"\r
-\r
-// constants\r
-\r
-static const bool UseSlowDebug = FALSE;\r
-\r
-// functions\r
-\r
-// board_is_ok()\r
-\r
-bool board_is_ok(const board_t * board) {\r
-\r
- int sq, piece;\r
- int colour, pos;\r
- int king, rook;\r
-\r
- if (board == NULL) return FALSE;\r
-\r
- // optional heavy DEBUG mode\r
-\r
- if (!UseSlowDebug) return TRUE;\r
-\r
- // squares\r
-\r
- for (sq = 0; sq < SquareNb; sq++) {\r
- piece = board->square[sq];\r
- if (square_is_ok(sq)) {\r
- pos = board->pos[sq];\r
- if (piece == Empty) {\r
- if (pos != -1) return FALSE;\r
- } else {\r
- if (pos < 0) return FALSE;\r
- if (board->list[piece_colour(piece)][pos] != sq) return FALSE;\r
- }\r
- } else {\r
- if (piece != Knight64) return FALSE;\r
- }\r
- }\r
-\r
- // white piece list\r
-\r
- colour = White;\r
- pos = 0;\r
-\r
- if (board->list_size[colour] <= 0 || board->list_size[colour] > 16) return FALSE;\r
-\r
- sq = board->list[colour][pos];\r
- if (sq == SquareNone) return FALSE;\r
- if (board->pos[sq] != pos) return FALSE;\r
- piece = board->square[sq];\r
- if (!colour_equal(piece,colour) || !piece_is_king(piece)) return FALSE;\r
-\r
- for (pos++; pos < board->list_size[colour]; pos++) {\r
- sq = board->list[colour][pos];\r
- if (sq == SquareNone) return FALSE;\r
- if (board->pos[sq] != pos) return FALSE;\r
- if (!colour_equal(board->square[sq],colour)) return FALSE;\r
- }\r
-\r
- sq = board->list[colour][pos];\r
- if (sq != SquareNone) return FALSE;\r
-\r
- // black piece list\r
-\r
- colour = Black;\r
- pos = 0;\r
-\r
- if (board->list_size[colour] <= 0 || board->list_size[colour] > 16) return FALSE;\r
-\r
- sq = board->list[colour][pos];\r
- if (sq == SquareNone) return FALSE;\r
- if (board->pos[sq] != pos) return FALSE;\r
- piece = board->square[sq];\r
- if (!colour_equal(piece,colour) || !piece_is_king(piece)) return FALSE;\r
-\r
- for (pos++; pos < board->list_size[colour]; pos++) {\r
- sq = board->list[colour][pos];\r
- if (sq == SquareNone) return FALSE;\r
- if (board->pos[sq] != pos) return FALSE;\r
- if (!colour_equal(board->square[sq],colour)) return FALSE;\r
- }\r
-\r
- sq = board->list[colour][pos];\r
- if (sq != SquareNone) return FALSE;\r
-\r
- // TODO: material\r
-\r
- if (board->number[WhiteKing12] != 1) return FALSE;\r
- if (board->number[BlackKing12] != 1) return FALSE;\r
-\r
- if (!colour_is_ok(board->turn)) return FALSE;\r
-\r
- // castling status\r
-\r
- if (board->castle[White][SideH] != SquareNone) {\r
-\r
- king = board->list[White][0];\r
- if ((king < A1) || (king > H1)) return FALSE;\r
- if (board->square[king] != WhiteKing256) return FALSE;\r
-\r
- rook = board->castle[White][SideH];\r
- if ((rook < A1) || (rook > H1)) return FALSE;\r
- if (board->square[rook] != WhiteRook256) return FALSE;\r
-\r
- if (rook <= king) return FALSE;\r
- }\r
-\r
- if (board->castle[White][SideA] != SquareNone) {\r
-\r
- king = board->list[White][0];\r
- if ((king < A1) || (king > H1)) return FALSE;\r
- if (board->square[king] != WhiteKing256) return FALSE;\r
-\r
- rook = board->castle[White][SideA];\r
- if ((rook < A1) || (rook > H1)) return FALSE;\r
- if (board->square[rook] != WhiteRook256) return FALSE;\r
-\r
- if (rook >= king) return FALSE;\r
- }\r
-\r
- if (board->castle[Black][SideH] != SquareNone) {\r
-\r
- king = board->list[Black][0];\r
- if ((king < A8) || (king > H8)) return FALSE;\r
- if (board->square[king] != BlackKing256) return FALSE;\r
-\r
- rook = board->castle[Black][SideH];\r
- if ((rook < A8) || (rook > H8)) return FALSE;\r
- if (board->square[rook] != BlackRook256) return FALSE;\r
-\r
- if (rook <= king) return FALSE;\r
- }\r
-\r
- if (board->castle[Black][SideA] != SquareNone) {\r
-\r
- king = board->list[Black][0];\r
- if (king < A8 || king > H8) return FALSE;\r
- if (board->square[king] != BlackKing256) return FALSE;\r
-\r
- rook = board->castle[Black][SideA];\r
- if (rook < A8 || rook > H8) return FALSE;\r
- if (board->square[rook] != BlackRook256) return FALSE;\r
-\r
- if (rook >= king) return FALSE;\r
- }\r
-\r
- return TRUE;\r
-}\r
-\r
-// board_clear()\r
-\r
-void board_clear(board_t * board) {\r
-\r
- int file, rank, sq;\r
- int colour, pos;\r
- int piece;\r
-\r
- ASSERT(board!=NULL);\r
-\r
- // edge squares\r
-\r
- for (sq = 0; sq < SquareNb; sq++) {\r
- board->square[sq] = Knight64; // HACK: uncoloured knight\r
- board->pos[sq] = -1;\r
- }\r
-\r
- // empty squares\r
-\r
- for (rank = 0; rank < 8; rank++) {\r
- for (file = 0; file < 8; file++) {\r
- sq = square_make(file,rank);\r
- board->square[sq] = Empty;\r
- }\r
- }\r
-\r
- // piece lists\r
-\r
- for (colour = 0; colour < 3; colour++) {\r
- for (pos = 0; pos < 32; pos++) { // HACK\r
- board->list[colour][pos] = SquareNone;\r
- }\r
- board->list_size[colour] = 0;\r
- }\r
-\r
- // material\r
-\r
- for (piece = 0; piece < 12; piece++) {\r
- board->number[piece] = 0;\r
- }\r
-\r
- // rest\r
-\r
- board->turn = ColourNone;\r
- board->castle[White][SideH] = SquareNone;\r
- board->castle[White][SideA] = SquareNone;\r
- board->castle[Black][SideH] = SquareNone;\r
- board->castle[Black][SideA] = SquareNone;\r
- board->ep_square = SquareNone;\r
-\r
- board->ply_nb = 0;\r
- board->move_nb = 0;\r
-\r
- board->key = 0;\r
-}\r
-\r
-// board_start()\r
-\r
-void board_start(board_t * board) {\r
-\r
- ASSERT(board!=NULL);\r
-\r
- if (!board_from_fen(board,StartFen)) ASSERT(FALSE);\r
-}\r
-\r
-// board_copy()\r
-\r
-void board_copy(board_t * dst, const board_t * src) {\r
-\r
- ASSERT(dst!=NULL);\r
- ASSERT(board_is_ok(src));\r
-\r
- *dst = *src;\r
-}\r
-\r
-// board_equal()\r
-\r
-bool board_equal(const board_t * board_1, const board_t * board_2) {\r
-\r
- int sq_64, sq;\r
-\r
- ASSERT(board_is_ok(board_1));\r
- ASSERT(board_is_ok(board_2));\r
-\r
- // fast comparison\r
-\r
- if (board_1->key != board_2->key) return FALSE;\r
-\r
- // slow comparison\r
-\r
- for (sq_64 = 0; sq_64 < 64; sq_64++) {\r
- sq = square_from_64(sq_64);\r
- if (board_1->square[sq] != board_2->square[sq]) return FALSE;\r
- }\r
-\r
- if (board_1->turn != board_2->turn) return FALSE;\r
- if (board_1->castle[White][SideH] != board_2->castle[White][SideH]) return FALSE;\r
- if (board_1->castle[White][SideA] != board_2->castle[White][SideA]) return FALSE;\r
- if (board_1->castle[Black][SideH] != board_2->castle[Black][SideH]) return FALSE;\r
- if (board_1->castle[Black][SideA] != board_2->castle[Black][SideA]) return FALSE;\r
- if (board_1->ep_square != board_2->ep_square) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// board_init_list()\r
-\r
-void board_init_list(board_t * board) {\r
-\r
- int sq_64, sq, piece;\r
- int colour, pos;\r
-\r
- ASSERT(board!=NULL);\r
-\r
- // init\r
-\r
- for (sq_64 = 0; sq_64 < 64; sq_64++) {\r
- sq = square_from_64(sq_64);\r
- board->pos[sq] = -1;\r
- }\r
-\r
- for (piece = 0; piece < 12; piece++) board->number[piece] = 0;\r
-\r
- // white piece list\r
-\r
- colour = White;\r
- pos = 0;\r
-\r
- for (sq_64 = 0; sq_64 < 64; sq_64++) {\r
- sq = square_from_64(sq_64);\r
- piece = board->square[sq];\r
- ASSERT(pos>=0&&pos<=16);\r
- if (colour_equal(piece,colour) && piece_is_king(piece)) {\r
- board->pos[sq] = pos;\r
- board->list[colour][pos] = sq;\r
- pos++;\r
- board->number[piece_to_12(piece)]++;\r
- }\r
- }\r
- ASSERT(pos==1);\r
-\r
- for (sq_64 = 0; sq_64 < 64; sq_64++) {\r
- sq = square_from_64(sq_64);\r
- piece = board->square[sq];\r
- ASSERT(pos>=0&&pos<=16);\r
- if (colour_equal(piece,colour) && !piece_is_king(piece)) {\r
- board->pos[sq] = pos;\r
- board->list[colour][pos] = sq;\r
- pos++;\r
- board->number[piece_to_12(piece)]++;\r
- }\r
- }\r
-\r
- ASSERT(pos>=1&&pos<=16);\r
- board->list[colour][pos] = SquareNone;\r
- board->list_size[colour] = pos;\r
-\r
- // black piece list\r
-\r
- colour = Black;\r
- pos = 0;\r
-\r
- for (sq_64 = 0; sq_64 < 64; sq_64++) {\r
- sq = square_from_64(sq_64);\r
- piece = board->square[sq];\r
- ASSERT(pos>=0&&pos<=16);\r
- if (colour_equal(piece,colour) && piece_is_king(piece)) {\r
- board->pos[sq] = pos;\r
- board->list[colour][pos] = sq;\r
- pos++;\r
- board->number[piece_to_12(piece)]++;\r
- }\r
- }\r
- ASSERT(pos==1);\r
-\r
- for (sq_64 = 0; sq_64 < 64; sq_64++) {\r
- sq = square_from_64(sq_64);\r
- piece = board->square[sq];\r
- ASSERT(pos>=1&&pos<=16);\r
- if (colour_equal(piece,colour) && !piece_is_king(piece)) {\r
- board->pos[sq] = pos;\r
- board->list[colour][pos] = sq;\r
- pos++;\r
- board->number[piece_to_12(piece)]++;\r
- }\r
- }\r
-\r
- ASSERT(pos>=1&&pos<=16);\r
- board->list[colour][pos] = SquareNone;\r
- board->list_size[colour] = pos;\r
-\r
- // hash key\r
-\r
- board->key = hash_key(board);\r
-}\r
-\r
-// board_flags()\r
-\r
-int board_flags(const board_t * board) {\r
-\r
- int flags;\r
-\r
- flags = 0;\r
-\r
- if (board->castle[White][SideH] != SquareNone) flags |= 1 << 0;\r
- if (board->castle[White][SideA] != SquareNone) flags |= 1 << 1;\r
- if (board->castle[Black][SideH] != SquareNone) flags |= 1 << 2;\r
- if (board->castle[Black][SideA] != SquareNone) flags |= 1 << 3;\r
-\r
- return flags;\r
-}\r
-\r
-// board_can_play()\r
-\r
-bool board_can_play(const board_t * board) {\r
-\r
- list_t list[1];\r
- int i, move;\r
-\r
- ASSERT(board_is_ok(board));\r
-\r
- gen_moves(list,board);\r
-\r
- for (i = 0; i < list_size(list); i++) {\r
- move = list_move(list,i);\r
- if (pseudo_is_legal(move,board)) return TRUE;\r
- }\r
-\r
- return FALSE; // no legal move\r
-}\r
-\r
-// board_mobility()\r
-\r
-int board_mobility(const board_t * board) {\r
-\r
- list_t list[1];\r
-\r
- ASSERT(board_is_ok(board));\r
-\r
- gen_legal_moves(list,board);\r
-\r
- return list_size(list);\r
-}\r
-\r
-// board_is_check()\r
-\r
-bool board_is_check(const board_t * board) {\r
-\r
- ASSERT(board_is_ok(board));\r
-\r
- return is_in_check(board,board->turn);\r
-}\r
-\r
-// board_is_mate()\r
-\r
-bool board_is_mate(const board_t * board) {\r
-\r
- ASSERT(board_is_ok(board));\r
-\r
- if (!board_is_check(board)) return FALSE;\r
- if (board_can_play(board)) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// board_is_stalemate()\r
-\r
-bool board_is_stalemate(const board_t * board) {\r
-\r
- ASSERT(board_is_ok(board));\r
-\r
- if (board_is_check(board)) return FALSE;\r
- if (board_can_play(board)) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// king_pos()\r
-\r
-int king_pos(const board_t * board, int colour) {\r
-\r
- ASSERT(board_is_ok(board));\r
- ASSERT(colour_is_ok(colour));\r
-\r
- return board->list[colour][0];\r
-}\r
-\r
-// board_disp()\r
-\r
-void board_disp(const board_t * board) {\r
-\r
- int file, rank, sq;\r
- int piece, c;\r
- char fen[256];\r
- char row[9];\r
- char line[256];\r
-\r
- ASSERT(board!=NULL);\r
-\r
- if (!board_to_fen(board,fen,256)) ASSERT(FALSE);\r
- my_log("POLYGLOT FEN %s\n",fen);\r
- my_log("POLYGLOT *** CURRENT BOARD ***\n");\r
-\r
- for (rank = 7; rank >= 0; rank--) {\r
-\r
- for (file = 0; file < 8; file++) {\r
-\r
- sq = square_make(file,rank);\r
- piece = board->square[sq];\r
-\r
- c = (piece != Empty) ? piece_to_char(piece) : '-';\r
- row[file]=c;\r
- }\r
- row[8]='\0';\r
- snprintf(line,sizeof(line),"POLYGLOT %s\n",row);\r
- line[sizeof(line)-1]='\0';\r
- my_log(line);\r
- }\r
-\r
- my_log("POLYGLOT %s to play\n",(colour_is_black(board->turn))?"black":"white");\r
- my_log("POLYGLOT\n");\r
-}\r
-\r
-// end of board.cpp\r
-\r
+
+// board.c
+
+// includes
+
+#include <stdio.h>
+
+#include "attack.h"
+#include "board.h"
+#include "colour.h"
+#include "fen.h"
+#include "hash.h"
+#include "list.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_gen.h"
+#include "move_legal.h"
+#include "piece.h"
+#include "util.h"
+
+// constants
+
+static const bool UseSlowDebug = FALSE;
+
+// functions
+
+// board_is_ok()
+
+bool board_is_ok(const board_t * board) {
+
+ int sq, piece;
+ int colour, pos;
+ int king, rook;
+
+ if (board == NULL) return FALSE;
+
+ // optional heavy DEBUG mode
+
+ if (!UseSlowDebug) return TRUE;
+
+ // squares
+
+ for (sq = 0; sq < SquareNb; sq++) {
+ piece = board->square[sq];
+ if (square_is_ok(sq)) {
+ pos = board->pos[sq];
+ if (piece == Empty) {
+ if (pos != -1) return FALSE;
+ } else {
+ if (pos < 0) return FALSE;
+ if (board->list[piece_colour(piece)][pos] != sq) return FALSE;
+ }
+ } else {
+ if (piece != Knight64) return FALSE;
+ }
+ }
+
+ // white piece list
+
+ colour = White;
+ pos = 0;
+
+ if (board->list_size[colour] <= 0 || board->list_size[colour] > 16) return FALSE;
+
+ sq = board->list[colour][pos];
+ if (sq == SquareNone) return FALSE;
+ if (board->pos[sq] != pos) return FALSE;
+ piece = board->square[sq];
+ if (!colour_equal(piece,colour) || !piece_is_king(piece)) return FALSE;
+
+ for (pos++; pos < board->list_size[colour]; pos++) {
+ sq = board->list[colour][pos];
+ if (sq == SquareNone) return FALSE;
+ if (board->pos[sq] != pos) return FALSE;
+ if (!colour_equal(board->square[sq],colour)) return FALSE;
+ }
+
+ sq = board->list[colour][pos];
+ if (sq != SquareNone) return FALSE;
+
+ // black piece list
+
+ colour = Black;
+ pos = 0;
+
+ if (board->list_size[colour] <= 0 || board->list_size[colour] > 16) return FALSE;
+
+ sq = board->list[colour][pos];
+ if (sq == SquareNone) return FALSE;
+ if (board->pos[sq] != pos) return FALSE;
+ piece = board->square[sq];
+ if (!colour_equal(piece,colour) || !piece_is_king(piece)) return FALSE;
+
+ for (pos++; pos < board->list_size[colour]; pos++) {
+ sq = board->list[colour][pos];
+ if (sq == SquareNone) return FALSE;
+ if (board->pos[sq] != pos) return FALSE;
+ if (!colour_equal(board->square[sq],colour)) return FALSE;
+ }
+
+ sq = board->list[colour][pos];
+ if (sq != SquareNone) return FALSE;
+
+ // TODO: material
+
+ if (board->number[WhiteKing12] != 1) return FALSE;
+ if (board->number[BlackKing12] != 1) return FALSE;
+
+ if (!colour_is_ok(board->turn)) return FALSE;
+
+ // castling status
+
+ if (board->castle[White][SideH] != SquareNone) {
+
+ king = board->list[White][0];
+ if ((king < A1) || (king > H1)) return FALSE;
+ if (board->square[king] != WhiteKing256) return FALSE;
+
+ rook = board->castle[White][SideH];
+ if ((rook < A1) || (rook > H1)) return FALSE;
+ if (board->square[rook] != WhiteRook256) return FALSE;
+
+ if (rook <= king) return FALSE;
+ }
+
+ if (board->castle[White][SideA] != SquareNone) {
+
+ king = board->list[White][0];
+ if ((king < A1) || (king > H1)) return FALSE;
+ if (board->square[king] != WhiteKing256) return FALSE;
+
+ rook = board->castle[White][SideA];
+ if ((rook < A1) || (rook > H1)) return FALSE;
+ if (board->square[rook] != WhiteRook256) return FALSE;
+
+ if (rook >= king) return FALSE;
+ }
+
+ if (board->castle[Black][SideH] != SquareNone) {
+
+ king = board->list[Black][0];
+ if ((king < A8) || (king > H8)) return FALSE;
+ if (board->square[king] != BlackKing256) return FALSE;
+
+ rook = board->castle[Black][SideH];
+ if ((rook < A8) || (rook > H8)) return FALSE;
+ if (board->square[rook] != BlackRook256) return FALSE;
+
+ if (rook <= king) return FALSE;
+ }
+
+ if (board->castle[Black][SideA] != SquareNone) {
+
+ king = board->list[Black][0];
+ if (king < A8 || king > H8) return FALSE;
+ if (board->square[king] != BlackKing256) return FALSE;
+
+ rook = board->castle[Black][SideA];
+ if (rook < A8 || rook > H8) return FALSE;
+ if (board->square[rook] != BlackRook256) return FALSE;
+
+ if (rook >= king) return FALSE;
+ }
+
+ return TRUE;
+}
+
+// board_clear()
+
+void board_clear(board_t * board) {
+
+ int file, rank, sq;
+ int colour, pos;
+ int piece;
+
+ ASSERT(board!=NULL);
+
+ // edge squares
+
+ for (sq = 0; sq < SquareNb; sq++) {
+ board->square[sq] = Knight64; // HACK: uncoloured knight
+ board->pos[sq] = -1;
+ }
+
+ // empty squares
+
+ for (rank = 0; rank < 8; rank++) {
+ for (file = 0; file < 8; file++) {
+ sq = square_make(file,rank);
+ board->square[sq] = Empty;
+ }
+ }
+
+ // piece lists
+
+ for (colour = 0; colour < 3; colour++) {
+ for (pos = 0; pos < 32; pos++) { // HACK
+ board->list[colour][pos] = SquareNone;
+ }
+ board->list_size[colour] = 0;
+ }
+
+ // material
+
+ for (piece = 0; piece < 12; piece++) {
+ board->number[piece] = 0;
+ }
+
+ // rest
+
+ board->turn = ColourNone;
+ board->castle[White][SideH] = SquareNone;
+ board->castle[White][SideA] = SquareNone;
+ board->castle[Black][SideH] = SquareNone;
+ board->castle[Black][SideA] = SquareNone;
+ board->ep_square = SquareNone;
+
+ board->ply_nb = 0;
+ board->move_nb = 0;
+
+ board->key = 0;
+}
+
+// board_start()
+
+void board_start(board_t * board) {
+
+ ASSERT(board!=NULL);
+
+ if (!board_from_fen(board,StartFen)) ASSERT(FALSE);
+}
+
+// board_copy()
+
+void board_copy(board_t * dst, const board_t * src) {
+
+ ASSERT(dst!=NULL);
+ ASSERT(board_is_ok(src));
+
+ *dst = *src;
+}
+
+// board_equal()
+
+bool board_equal(const board_t * board_1, const board_t * board_2) {
+
+ int sq_64, sq;
+
+ ASSERT(board_is_ok(board_1));
+ ASSERT(board_is_ok(board_2));
+
+ // fast comparison
+
+ if (board_1->key != board_2->key) return FALSE;
+
+ // slow comparison
+
+ for (sq_64 = 0; sq_64 < 64; sq_64++) {
+ sq = square_from_64(sq_64);
+ if (board_1->square[sq] != board_2->square[sq]) return FALSE;
+ }
+
+ if (board_1->turn != board_2->turn) return FALSE;
+ if (board_1->castle[White][SideH] != board_2->castle[White][SideH]) return FALSE;
+ if (board_1->castle[White][SideA] != board_2->castle[White][SideA]) return FALSE;
+ if (board_1->castle[Black][SideH] != board_2->castle[Black][SideH]) return FALSE;
+ if (board_1->castle[Black][SideA] != board_2->castle[Black][SideA]) return FALSE;
+ if (board_1->ep_square != board_2->ep_square) return FALSE;
+
+ return TRUE;
+}
+
+// board_init_list()
+
+void board_init_list(board_t * board) {
+
+ int sq_64, sq, piece;
+ int colour, pos;
+
+ ASSERT(board!=NULL);
+
+ // init
+
+ for (sq_64 = 0; sq_64 < 64; sq_64++) {
+ sq = square_from_64(sq_64);
+ board->pos[sq] = -1;
+ }
+
+ for (piece = 0; piece < 12; piece++) board->number[piece] = 0;
+
+ // white piece list
+
+ colour = White;
+ pos = 0;
+
+ for (sq_64 = 0; sq_64 < 64; sq_64++) {
+ sq = square_from_64(sq_64);
+ piece = board->square[sq];
+ ASSERT(pos>=0&&pos<=16);
+ if (colour_equal(piece,colour) && piece_is_king(piece)) {
+ board->pos[sq] = pos;
+ board->list[colour][pos] = sq;
+ pos++;
+ board->number[piece_to_12(piece)]++;
+ }
+ }
+ ASSERT(pos==1);
+
+ for (sq_64 = 0; sq_64 < 64; sq_64++) {
+ sq = square_from_64(sq_64);
+ piece = board->square[sq];
+ ASSERT(pos>=0&&pos<=16);
+ if (colour_equal(piece,colour) && !piece_is_king(piece)) {
+ board->pos[sq] = pos;
+ board->list[colour][pos] = sq;
+ pos++;
+ board->number[piece_to_12(piece)]++;
+ }
+ }
+
+ ASSERT(pos>=1&&pos<=16);
+ board->list[colour][pos] = SquareNone;
+ board->list_size[colour] = pos;
+
+ // black piece list
+
+ colour = Black;
+ pos = 0;
+
+ for (sq_64 = 0; sq_64 < 64; sq_64++) {
+ sq = square_from_64(sq_64);
+ piece = board->square[sq];
+ ASSERT(pos>=0&&pos<=16);
+ if (colour_equal(piece,colour) && piece_is_king(piece)) {
+ board->pos[sq] = pos;
+ board->list[colour][pos] = sq;
+ pos++;
+ board->number[piece_to_12(piece)]++;
+ }
+ }
+ ASSERT(pos==1);
+
+ for (sq_64 = 0; sq_64 < 64; sq_64++) {
+ sq = square_from_64(sq_64);
+ piece = board->square[sq];
+ ASSERT(pos>=1&&pos<=16);
+ if (colour_equal(piece,colour) && !piece_is_king(piece)) {
+ board->pos[sq] = pos;
+ board->list[colour][pos] = sq;
+ pos++;
+ board->number[piece_to_12(piece)]++;
+ }
+ }
+
+ ASSERT(pos>=1&&pos<=16);
+ board->list[colour][pos] = SquareNone;
+ board->list_size[colour] = pos;
+
+ // hash key
+
+ board->key = hash_key(board);
+}
+
+// board_flags()
+
+int board_flags(const board_t * board) {
+
+ int flags;
+
+ flags = 0;
+
+ if (board->castle[White][SideH] != SquareNone) flags |= 1 << 0;
+ if (board->castle[White][SideA] != SquareNone) flags |= 1 << 1;
+ if (board->castle[Black][SideH] != SquareNone) flags |= 1 << 2;
+ if (board->castle[Black][SideA] != SquareNone) flags |= 1 << 3;
+
+ return flags;
+}
+
+// board_can_play()
+
+bool board_can_play(const board_t * board) {
+
+ list_t list[1];
+ int i, move;
+
+ ASSERT(board_is_ok(board));
+
+ gen_moves(list,board);
+
+ for (i = 0; i < list_size(list); i++) {
+ move = list_move(list,i);
+ if (pseudo_is_legal(move,board)) return TRUE;
+ }
+
+ return FALSE; // no legal move
+}
+
+// board_mobility()
+
+int board_mobility(const board_t * board) {
+
+ list_t list[1];
+
+ ASSERT(board_is_ok(board));
+
+ gen_legal_moves(list,board);
+
+ return list_size(list);
+}
+
+// board_is_check()
+
+bool board_is_check(const board_t * board) {
+
+ ASSERT(board_is_ok(board));
+
+ return is_in_check(board,board->turn);
+}
+
+// board_is_mate()
+
+bool board_is_mate(const board_t * board) {
+
+ ASSERT(board_is_ok(board));
+
+ if (!board_is_check(board)) return FALSE;
+ if (board_can_play(board)) return FALSE;
+
+ return TRUE;
+}
+
+// board_is_stalemate()
+
+bool board_is_stalemate(const board_t * board) {
+
+ ASSERT(board_is_ok(board));
+
+ if (board_is_check(board)) return FALSE;
+ if (board_can_play(board)) return FALSE;
+
+ return TRUE;
+}
+
+// king_pos()
+
+int king_pos(const board_t * board, int colour) {
+
+ ASSERT(board_is_ok(board));
+ ASSERT(colour_is_ok(colour));
+
+ return board->list[colour][0];
+}
+
+// board_disp()
+
+void board_disp(const board_t * board) {
+
+ int file, rank, sq;
+ int piece, c;
+ char fen[256];
+ char row[9];
+ char line[256];
+
+ ASSERT(board!=NULL);
+
+ if (!board_to_fen(board,fen,256)) ASSERT(FALSE);
+ my_log("POLYGLOT FEN %s\n",fen);
+ my_log("POLYGLOT *** CURRENT BOARD ***\n");
+
+ for (rank = 7; rank >= 0; rank--) {
+
+ for (file = 0; file < 8; file++) {
+
+ sq = square_make(file,rank);
+ piece = board->square[sq];
+
+ c = (piece != Empty) ? piece_to_char(piece) : '-';
+ row[file]=c;
+ }
+ row[8]='\0';
+ snprintf(line,sizeof(line),"POLYGLOT %s\n",row);
+ line[sizeof(line)-1]='\0';
+ my_log(line);
+ }
+
+ my_log("POLYGLOT %s to play\n",(colour_is_black(board->turn))?"black":"white");
+ my_log("POLYGLOT\n");
+}
+
+// end of board.cpp
+
-\r
-// board.h\r
-\r
-#ifndef BOARD_H\r
-#define BOARD_H\r
-\r
-// includes\r
-\r
-#include "colour.h"\r
-#include "square.h"\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define Empty 0\r
-#define SideH 0\r
-#define SideA 1\r
-#define SideNb 2\r
-\r
-// types\r
-\r
-typedef struct {\r
-\r
- uint8 square[SquareNb];\r
- sint8 pos[SquareNb];\r
-\r
- uint8 list[ColourNb][32];\r
- sint8 list_size[ColourNb];\r
-\r
- sint8 number[12];\r
-\r
- sint8 turn;\r
- uint8 castle[ColourNb][SideNb];\r
- uint8 ep_square;\r
-\r
- sint16 ply_nb;\r
- sint16 move_nb;\r
-\r
- uint64 key;\r
-} board_t;\r
-\r
-// functions\r
-\r
-extern bool board_is_ok (const board_t * board);\r
-\r
-extern void board_clear (board_t * board);\r
-extern void board_start (board_t * board);\r
-\r
-extern void board_copy (board_t * dst, const board_t * src);\r
-extern bool board_equal (const board_t * board_1, const board_t * board_2);\r
-\r
-extern void board_init_list (board_t * board);\r
-\r
-extern int board_flags (const board_t * board);\r
-\r
-extern bool board_can_play (const board_t * board);\r
-extern int board_mobility (const board_t * board);\r
-\r
-extern bool board_is_check (const board_t * board);\r
-extern bool board_is_mate (const board_t * board);\r
-extern bool board_is_stalemate (const board_t * board);\r
-\r
-extern int king_pos (const board_t * board, int colour);\r
-\r
-extern void board_disp (const board_t * board);\r
-\r
-#endif // !defined BOARD_H\r
-\r
-// end of board.h\r
-\r
+
+// board.h
+
+#ifndef BOARD_H
+#define BOARD_H
+
+// includes
+
+#include "colour.h"
+#include "square.h"
+#include "util.h"
+
+// defines
+
+#define Empty 0
+#define SideH 0
+#define SideA 1
+#define SideNb 2
+
+// types
+
+typedef struct {
+
+ uint8 square[SquareNb];
+ sint8 pos[SquareNb];
+
+ uint8 list[ColourNb][32];
+ sint8 list_size[ColourNb];
+
+ sint8 number[12];
+
+ sint8 turn;
+ uint8 castle[ColourNb][SideNb];
+ uint8 ep_square;
+
+ sint16 ply_nb;
+ sint16 move_nb;
+
+ uint64 key;
+} board_t;
+
+// functions
+
+extern bool board_is_ok (const board_t * board);
+
+extern void board_clear (board_t * board);
+extern void board_start (board_t * board);
+
+extern void board_copy (board_t * dst, const board_t * src);
+extern bool board_equal (const board_t * board_1, const board_t * board_2);
+
+extern void board_init_list (board_t * board);
+
+extern int board_flags (const board_t * board);
+
+extern bool board_can_play (const board_t * board);
+extern int board_mobility (const board_t * board);
+
+extern bool board_is_check (const board_t * board);
+extern bool board_is_mate (const board_t * board);
+extern bool board_is_stalemate (const board_t * board);
+
+extern int king_pos (const board_t * board, int colour);
+
+extern void board_disp (const board_t * board);
+
+#endif // !defined BOARD_H
+
+// end of board.h
+
-\r
-// book.c\r
-\r
-// includes\r
-\r
-#include <errno.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "board.h"\r
-#include "book.h"\r
-#include "move.h"\r
-#include "move_legal.h"\r
-#include "san.h"\r
-#include "util.h"\r
-#include "option.h"\r
-\r
-// types\r
-\r
-typedef struct {\r
- uint64 key;\r
- uint16 move;\r
- uint16 count;\r
- uint16 n;\r
- uint16 sum;\r
-} entry_t;\r
-\r
-// variables\r
-\r
-static FILE * BookFile;\r
-static int BookSize;\r
-\r
-// prototypes\r
-\r
-static int find_pos (uint64 key);\r
-\r
-static void read_entry (entry_t * entry, int n);\r
-static void write_entry (const entry_t * entry, int n);\r
-\r
-static uint64 read_integer (FILE * file, int size);\r
-static void write_integer (FILE * file, int size, uint64 n);\r
-\r
-// functions\r
-\r
-// book_clear()\r
-\r
-void book_clear() {\r
-\r
- BookFile = NULL;\r
- BookSize = 0;\r
-}\r
-\r
-bool book_is_open(){\r
- return BookFile!=NULL;\r
-}\r
-\r
-// book_open()\r
-\r
-void book_open(const char file_name[]) {\r
-\r
- ASSERT(file_name!=NULL);\r
- if(option_get_bool(Option,"BookLearn")){\r
- BookFile = fopen(file_name,"rb+");\r
- }else{\r
- BookFile = fopen(file_name,"rb");\r
- }\r
- \r
-// if (BookFile == NULL) my_fatal("book_open(): can't open file \"%s\": %s\n",file_name,strerror(errno));\r
- if (BookFile == NULL) return; \r
-\r
- if (fseek(BookFile,0,SEEK_END) == -1) {\r
- my_fatal("book_open(): fseek(): %s\n",strerror(errno));\r
- }\r
-\r
- BookSize = ftell(BookFile) / 16;\r
-// if (BookSize == 0) my_fatal("book_open(): empty file\n");\r
- if (BookSize == 0) {\r
- book_close();\r
- book_clear(); \r
- };\r
-}\r
-\r
-// book_close()\r
-\r
-void book_close() {\r
-\r
- if(BookFile==NULL) return;\r
-\r
- if (fclose(BookFile) == EOF) {\r
- my_fatal("book_close(): fclose(): %s\n",strerror(errno));\r
- }\r
-}\r
-\r
-// is_in_book()\r
-\r
-bool is_in_book(const board_t * board) {\r
-\r
- int pos;\r
- entry_t entry[1];\r
-\r
- if(BookFile==NULL) return FALSE;\r
-\r
- ASSERT(board!=NULL);\r
-\r
- for (pos = find_pos(board->key); pos < BookSize; pos++) {\r
- read_entry(entry,pos);\r
- if (entry->key == board->key) return TRUE;\r
- }\r
-\r
- return FALSE;\r
-}\r
-\r
-// book_move()\r
-\r
-int book_move(const board_t * board, bool random) {\r
-\r
- int best_move;\r
- int best_score;\r
- int pos;\r
- entry_t entry[1];\r
- int move;\r
- int score;\r
- list_t list[1];\r
- int i;\r
-\r
- if(BookFile==NULL) return MoveNone;\r
-\r
- ASSERT(board!=NULL);\r
- ASSERT(random==TRUE||random==FALSE);\r
-\r
- // init\r
- \r
- list_clear(list);\r
-\r
- book_moves(list,board);\r
-\r
- best_move = MoveNone;\r
- best_score = 0;\r
- for(i=0; i<list_size(list); i++){\r
-\r
- move = list->move[i];\r
- score = list->value[i];\r
-\r
- if (move != MoveNone &&\r
- move_is_legal(move,board) &&\r
- score>10*option_get_int(Option,"BookTreshold")) {\r
-\r
- // pick this move?\r
-\r
- ASSERT(score>0);\r
-\r
- if (random) {\r
- best_score += score;\r
- if (my_random_int(best_score) < score) best_move = move;\r
- } else {\r
- if (score > best_score) {\r
- best_move = move;\r
- best_score = score;\r
- }\r
- }\r
-\r
- } else {\r
-\r
- ASSERT(FALSE);\r
- }\r
- }\r
-\r
- return best_move;\r
-}\r
-\r
-// book_moves()\r
-\r
-void book_moves(list_t * list, const board_t * board) {\r
-\r
- int first_pos;\r
- int sum;\r
- int pos;\r
- entry_t entry[1];\r
- int move;\r
- int score;\r
- char move_string[256];\r
-\r
- ASSERT(board!=NULL);\r
- ASSERT(list!=NULL);\r
-\r
- if(BookFile==NULL) return;\r
-\r
- // init\r
-\r
- list_clear(list);\r
-\r
- first_pos = find_pos(board->key);\r
-\r
- // sum\r
-\r
- sum = 0;\r
-\r
- for (pos = first_pos; pos < BookSize; pos++) {\r
-\r
- read_entry(entry,pos);\r
- if (entry->key != board->key) break;\r
-\r
- sum += entry->count;\r
- }\r
-\r
- // disp\r
-\r
- for (pos = first_pos; pos < BookSize; pos++) {\r
-\r
- read_entry(entry,pos);\r
- if (entry->key != board->key) break;\r
-\r
- move = entry->move;\r
- score = (((uint32)entry->count)*((uint32)10000))/sum; // 32 bit safe!\r
-\r
- if (move != MoveNone && move_is_legal(move,board)) {\r
- list_add_ex(list,move,score);\r
- }\r
- }\r
-\r
-}\r
-\r
-\r
-// book_disp()\r
-\r
-void book_disp(const board_t * board) {\r
-\r
- char move_string[256];\r
- list_t list[1];\r
- int i;\r
- int treshold=option_get_int(Option,"BookTreshold");\r
-\r
- ASSERT(board!=NULL);\r
-\r
- if(BookFile==NULL) return;\r
-\r
- book_moves(list,board);\r
- \r
- for(i=0; i<list_size(list); i++){\r
- move_to_san(list->move[i],board,move_string,256);\r
- if(list->value[i]>10*treshold){\r
- printf(" %6s %5.2f%%\n",move_string,list->value[i]/100.0);\r
- }else{\r
- printf(" %6s %5.2f%% (below treshold %4.2f%%)\n",\r
- move_string,list->value[i]/100.0,treshold/10.0);\r
- }\r
- }\r
- // this is necessary by the xboard protocol\r
- printf("\n");\r
-}\r
-\r
-// book_learn_move()\r
-\r
-void book_learn_move(const board_t * board, int move, int result) {\r
-\r
- int pos;\r
- entry_t entry[1];\r
-\r
- if(BookFile==NULL) return;\r
-\r
- ASSERT(board!=NULL);\r
- ASSERT(move_is_ok(move));\r
- ASSERT(result>=-1&&result<=+1);\r
-\r
- ASSERT(move_is_legal(move,board));\r
-\r
- for (pos = find_pos(board->key); pos < BookSize; pos++) {\r
-\r
- read_entry(entry,pos);\r
- if (entry->key != board->key) break;\r
-\r
- if (entry->move == move) {\r
-\r
- entry->n++;\r
- entry->sum += result+1;\r
-\r
- write_entry(entry,pos);\r
-\r
- break;\r
- }\r
- }\r
-}\r
-\r
-// book_flush()\r
-\r
-void book_flush() {\r
-\r
- if(BookFile==NULL) return;\r
-\r
- if (fflush(BookFile) == EOF) {\r
- my_fatal("book_flush(): fflush(): %s\n",strerror(errno));\r
- }\r
-}\r
-\r
-// find_pos()\r
-\r
-static int find_pos(uint64 key) {\r
-\r
- int left, right, mid;\r
- entry_t entry[1];\r
-\r
- // binary search (finds the leftmost entry)\r
-\r
- left = 0;\r
- right = BookSize-1;\r
-\r
- ASSERT(left<=right);\r
-\r
- while (left < right) {\r
-\r
- mid = (left + right) / 2;\r
- ASSERT(mid>=left&&mid<right);\r
-\r
- read_entry(entry,mid);\r
-\r
- if (key <= entry->key) {\r
- right = mid;\r
- } else {\r
- left = mid+1;\r
- }\r
- }\r
-\r
- ASSERT(left==right);\r
-\r
- read_entry(entry,left);\r
-\r
- return (entry->key == key) ? left : BookSize;\r
-}\r
-\r
-// read_entry()\r
-\r
-static void read_entry(entry_t * entry, int n) {\r
-\r
- ASSERT(entry!=NULL);\r
- ASSERT(n>=0&&n<BookSize);\r
-\r
- if (fseek(BookFile,n*16,SEEK_SET) == -1) {\r
- my_fatal("read_entry(): fseek(): %s\n",strerror(errno));\r
- }\r
-\r
- entry->key = read_integer(BookFile,8);\r
- entry->move = read_integer(BookFile,2);\r
- entry->count = read_integer(BookFile,2);\r
- entry->n = read_integer(BookFile,2);\r
- entry->sum = read_integer(BookFile,2);\r
-}\r
-\r
-// write_entry()\r
-\r
-static void write_entry(const entry_t * entry, int n) {\r
-\r
- ASSERT(entry!=NULL);\r
- ASSERT(n>=0&&n<BookSize);\r
-\r
- if (fseek(BookFile,n*16,SEEK_SET) == -1) {\r
- my_fatal("write_entry(): fseek(): %s\n",strerror(errno));\r
- }\r
-\r
- write_integer(BookFile,8,entry->key);\r
- write_integer(BookFile,2,entry->move);\r
- write_integer(BookFile,2,entry->count);\r
- write_integer(BookFile,2,entry->n);\r
- write_integer(BookFile,2,entry->sum);\r
-}\r
-\r
-// read_integer()\r
-\r
-static uint64 read_integer(FILE * file, int size) {\r
-\r
- uint64 n;\r
- int i;\r
- int b;\r
-\r
- ASSERT(file!=NULL);\r
- ASSERT(size>0&&size<=8);\r
-\r
- n = 0;\r
-\r
- for (i = 0; i < size; i++) {\r
-\r
- b = fgetc(file);\r
-\r
- if (b == EOF) {\r
- if (feof(file)) {\r
- my_fatal("read_integer(): fgetc(): EOF reached\n");\r
- } else { // error\r
- my_fatal("read_integer(): fgetc(): %s\n",strerror(errno));\r
- }\r
- }\r
-\r
- ASSERT(b>=0&&b<256);\r
- n = (n << 8) | b;\r
- }\r
-\r
- return n;\r
-}\r
-\r
-// write_integer()\r
-\r
-static void write_integer(FILE * file, int size, uint64 n) {\r
-\r
- int i;\r
- int b;\r
-\r
- ASSERT(file!=NULL);\r
- ASSERT(size>0&&size<=8);\r
- ASSERT(size==8||n>>(size*8)==0);\r
-\r
- for (i = size-1; i >= 0; i--) {\r
-\r
- b = (n >> (i*8)) & 0xFF;\r
- ASSERT(b>=0&&b<256);\r
-\r
- if (fputc(b,file) == EOF) {\r
- my_fatal("write_integer(): fputc(): %s\n",strerror(errno));\r
- }\r
- }\r
-}\r
-\r
-// end of book.cpp\r
-\r
+
+// book.c
+
+// includes
+
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "board.h"
+#include "book.h"
+#include "move.h"
+#include "move_legal.h"
+#include "san.h"
+#include "util.h"
+#include "option.h"
+
+// types
+
+typedef struct {
+ uint64 key;
+ uint16 move;
+ uint16 count;
+ uint16 n;
+ uint16 sum;
+} entry_t;
+
+// variables
+
+static FILE * BookFile;
+static int BookSize;
+
+// prototypes
+
+static int find_pos (uint64 key);
+
+static void read_entry (entry_t * entry, int n);
+static void write_entry (const entry_t * entry, int n);
+
+static uint64 read_integer (FILE * file, int size);
+static void write_integer (FILE * file, int size, uint64 n);
+
+// functions
+
+// book_clear()
+
+void book_clear() {
+
+ BookFile = NULL;
+ BookSize = 0;
+}
+
+bool book_is_open(){
+ return BookFile!=NULL;
+}
+
+// book_open()
+
+void book_open(const char file_name[]) {
+
+ ASSERT(file_name!=NULL);
+ if(option_get_bool(Option,"BookLearn")){
+ BookFile = fopen(file_name,"rb+");
+ }else{
+ BookFile = fopen(file_name,"rb");
+ }
+
+// if (BookFile == NULL) my_fatal("book_open(): can't open file \"%s\": %s\n",file_name,strerror(errno));
+ if (BookFile == NULL) return;
+
+ if (fseek(BookFile,0,SEEK_END) == -1) {
+ my_fatal("book_open(): fseek(): %s\n",strerror(errno));
+ }
+
+ BookSize = ftell(BookFile) / 16;
+// if (BookSize == 0) my_fatal("book_open(): empty file\n");
+ if (BookSize == 0) {
+ book_close();
+ book_clear();
+ };
+}
+
+// book_close()
+
+void book_close() {
+
+ if(BookFile==NULL) return;
+
+ if (fclose(BookFile) == EOF) {
+ my_fatal("book_close(): fclose(): %s\n",strerror(errno));
+ }
+}
+
+// is_in_book()
+
+bool is_in_book(const board_t * board) {
+
+ int pos;
+ entry_t entry[1];
+
+ if(BookFile==NULL) return FALSE;
+
+ ASSERT(board!=NULL);
+
+ for (pos = find_pos(board->key); pos < BookSize; pos++) {
+ read_entry(entry,pos);
+ if (entry->key == board->key) return TRUE;
+ }
+
+ return FALSE;
+}
+
+// book_move()
+
+int book_move(const board_t * board, bool random) {
+
+ int best_move;
+ int best_score;
+ int pos;
+ entry_t entry[1];
+ int move;
+ int score;
+ list_t list[1];
+ int i;
+
+ if(BookFile==NULL) return MoveNone;
+
+ ASSERT(board!=NULL);
+ ASSERT(random==TRUE||random==FALSE);
+
+ // init
+
+ list_clear(list);
+
+ book_moves(list,board);
+
+ best_move = MoveNone;
+ best_score = 0;
+ for(i=0; i<list_size(list); i++){
+
+ move = list->move[i];
+ score = list->value[i];
+
+ if (move != MoveNone &&
+ move_is_legal(move,board) &&
+ score>10*option_get_int(Option,"BookTreshold")) {
+
+ // pick this move?
+
+ ASSERT(score>0);
+
+ if (random) {
+ best_score += score;
+ if (my_random_int(best_score) < score) best_move = move;
+ } else {
+ if (score > best_score) {
+ best_move = move;
+ best_score = score;
+ }
+ }
+
+ } else {
+
+ ASSERT(FALSE);
+ }
+ }
+
+ return best_move;
+}
+
+// book_moves()
+
+void book_moves(list_t * list, const board_t * board) {
+
+ int first_pos;
+ int sum;
+ int pos;
+ entry_t entry[1];
+ int move;
+ int score;
+ char move_string[256];
+
+ ASSERT(board!=NULL);
+ ASSERT(list!=NULL);
+
+ if(BookFile==NULL) return;
+
+ // init
+
+ list_clear(list);
+
+ first_pos = find_pos(board->key);
+
+ // sum
+
+ sum = 0;
+
+ for (pos = first_pos; pos < BookSize; pos++) {
+
+ read_entry(entry,pos);
+ if (entry->key != board->key) break;
+
+ sum += entry->count;
+ }
+
+ // disp
+
+ for (pos = first_pos; pos < BookSize; pos++) {
+
+ read_entry(entry,pos);
+ if (entry->key != board->key) break;
+
+ move = entry->move;
+ score = (((uint32)entry->count)*((uint32)10000))/sum; // 32 bit safe!
+
+ if (move != MoveNone && move_is_legal(move,board)) {
+ list_add_ex(list,move,score);
+ }
+ }
+
+}
+
+
+// book_disp()
+
+void book_disp(const board_t * board) {
+
+ char move_string[256];
+ list_t list[1];
+ int i;
+ int treshold=option_get_int(Option,"BookTreshold");
+
+ ASSERT(board!=NULL);
+
+ if(BookFile==NULL) return;
+
+ book_moves(list,board);
+
+ for(i=0; i<list_size(list); i++){
+ move_to_san(list->move[i],board,move_string,256);
+ if(list->value[i]>10*treshold){
+ printf(" %6s %5.2f%%\n",move_string,list->value[i]/100.0);
+ }else{
+ printf(" %6s %5.2f%% (below treshold %4.2f%%)\n",
+ move_string,list->value[i]/100.0,treshold/10.0);
+ }
+ }
+ // this is necessary by the xboard protocol
+ printf("\n");
+}
+
+// book_learn_move()
+
+void book_learn_move(const board_t * board, int move, int result) {
+
+ int pos;
+ entry_t entry[1];
+
+ if(BookFile==NULL) return;
+
+ ASSERT(board!=NULL);
+ ASSERT(move_is_ok(move));
+ ASSERT(result>=-1&&result<=+1);
+
+ ASSERT(move_is_legal(move,board));
+
+ for (pos = find_pos(board->key); pos < BookSize; pos++) {
+
+ read_entry(entry,pos);
+ if (entry->key != board->key) break;
+
+ if (entry->move == move) {
+
+ entry->n++;
+ entry->sum += result+1;
+
+ write_entry(entry,pos);
+
+ break;
+ }
+ }
+}
+
+// book_flush()
+
+void book_flush() {
+
+ if(BookFile==NULL) return;
+
+ if (fflush(BookFile) == EOF) {
+ my_fatal("book_flush(): fflush(): %s\n",strerror(errno));
+ }
+}
+
+// find_pos()
+
+static int find_pos(uint64 key) {
+
+ int left, right, mid;
+ entry_t entry[1];
+
+ // binary search (finds the leftmost entry)
+
+ left = 0;
+ right = BookSize-1;
+
+ ASSERT(left<=right);
+
+ while (left < right) {
+
+ mid = (left + right) / 2;
+ ASSERT(mid>=left&&mid<right);
+
+ read_entry(entry,mid);
+
+ if (key <= entry->key) {
+ right = mid;
+ } else {
+ left = mid+1;
+ }
+ }
+
+ ASSERT(left==right);
+
+ read_entry(entry,left);
+
+ return (entry->key == key) ? left : BookSize;
+}
+
+// read_entry()
+
+static void read_entry(entry_t * entry, int n) {
+
+ ASSERT(entry!=NULL);
+ ASSERT(n>=0&&n<BookSize);
+
+ if (fseek(BookFile,n*16,SEEK_SET) == -1) {
+ my_fatal("read_entry(): fseek(): %s\n",strerror(errno));
+ }
+
+ entry->key = read_integer(BookFile,8);
+ entry->move = read_integer(BookFile,2);
+ entry->count = read_integer(BookFile,2);
+ entry->n = read_integer(BookFile,2);
+ entry->sum = read_integer(BookFile,2);
+}
+
+// write_entry()
+
+static void write_entry(const entry_t * entry, int n) {
+
+ ASSERT(entry!=NULL);
+ ASSERT(n>=0&&n<BookSize);
+
+ if (fseek(BookFile,n*16,SEEK_SET) == -1) {
+ my_fatal("write_entry(): fseek(): %s\n",strerror(errno));
+ }
+
+ write_integer(BookFile,8,entry->key);
+ write_integer(BookFile,2,entry->move);
+ write_integer(BookFile,2,entry->count);
+ write_integer(BookFile,2,entry->n);
+ write_integer(BookFile,2,entry->sum);
+}
+
+// read_integer()
+
+static uint64 read_integer(FILE * file, int size) {
+
+ uint64 n;
+ int i;
+ int b;
+
+ ASSERT(file!=NULL);
+ ASSERT(size>0&&size<=8);
+
+ n = 0;
+
+ for (i = 0; i < size; i++) {
+
+ b = fgetc(file);
+
+ if (b == EOF) {
+ if (feof(file)) {
+ my_fatal("read_integer(): fgetc(): EOF reached\n");
+ } else { // error
+ my_fatal("read_integer(): fgetc(): %s\n",strerror(errno));
+ }
+ }
+
+ ASSERT(b>=0&&b<256);
+ n = (n << 8) | b;
+ }
+
+ return n;
+}
+
+// write_integer()
+
+static void write_integer(FILE * file, int size, uint64 n) {
+
+ int i;
+ int b;
+
+ ASSERT(file!=NULL);
+ ASSERT(size>0&&size<=8);
+ ASSERT(size==8||n>>(size*8)==0);
+
+ for (i = size-1; i >= 0; i--) {
+
+ b = (n >> (i*8)) & 0xFF;
+ ASSERT(b>=0&&b<256);
+
+ if (fputc(b,file) == EOF) {
+ my_fatal("write_integer(): fputc(): %s\n",strerror(errno));
+ }
+ }
+}
+
+// end of book.cpp
+
-\r
-// book.h\r
-\r
-#ifndef BOOK_H\r
-#define BOOK_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "util.h"\r
-#include "list.h"\r
-\r
-// functions\r
-\r
-extern void book_clear ();\r
-\r
-extern void book_open (const char file_name[]);\r
-extern bool book_is_open ();\r
-extern void book_close ();\r
-\r
-extern bool is_in_book (const board_t * board);\r
-extern int book_move (const board_t * board, bool random);\r
-extern void book_moves (list_t * list, const board_t * board);\r
-extern void book_disp (const board_t * board);\r
-\r
-extern void book_learn_move (const board_t * board, int move, int result);\r
-extern void book_flush ();\r
-\r
-#endif // !defined BOOK_H\r
-\r
-// end of book.h\r
-\r
+
+// book.h
+
+#ifndef BOOK_H
+#define BOOK_H
+
+// includes
+
+#include "board.h"
+#include "util.h"
+#include "list.h"
+
+// functions
+
+extern void book_clear ();
+
+extern void book_open (const char file_name[]);
+extern bool book_is_open ();
+extern void book_close ();
+
+extern bool is_in_book (const board_t * board);
+extern int book_move (const board_t * board, bool random);
+extern void book_moves (list_t * list, const board_t * board);
+extern void book_disp (const board_t * board);
+
+extern void book_learn_move (const board_t * board, int move, int result);
+extern void book_flush ();
+
+#endif // !defined BOOK_H
+
+// end of book.h
+
-// book_make.c\r
-\r
-// includes\r
-\r
-#include <errno.h>\r
-#include <math.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "board.h"\r
-#include "book_make.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_gen.h"\r
-#include "move_legal.h"\r
-#include "pgn.h"\r
-#include "san.h"\r
-#include "util.h"\r
-\r
-// constants\r
-\r
-#define COUNT_MAX ((int)16384)\r
-#define StringSize ((int)4096)\r
-\r
-static const int NIL = -1;\r
-\r
-// defines\r
-\r
-#define opp_search(s) ((s)==BOOK?ALL:BOOK)\r
-\r
-// types\r
-\r
-typedef struct {\r
- uint64 key;\r
- uint16 move;\r
- uint16 count;\r
-// Unfortunately the minggw32 cross compiler [4.2.1-sjlj (mingw32-2)] \r
-// seems to have a bug with anon structs contained in unions when using -O2.\r
-// See the ASSERT below in "read_entry_file"...\r
-// To be fair this seems to be illegal in C++\r
-// although it is hard to understand why, and the compiler does not complain\r
-// even with -Wall.\r
-// union { \r
-// struct { \r
- uint16 n;\r
- uint16 sum;\r
-// };\r
-// struct {\r
- uint8 height;\r
- int line;\r
-// };\r
-// };\r
- uint8 colour;\r
-} entry_t;\r
-\r
-typedef struct {\r
- int size;\r
- int alloc;\r
- uint32 mask;\r
- entry_t * entry;\r
- sint32 * hash;\r
-} book_t;\r
-\r
-typedef enum {\r
- BOOK,\r
- ALL\r
-} search_t;\r
-\r
-typedef struct {\r
- int height;\r
- int line;\r
- int initial_color;\r
- bool book_trans_only;\r
- bool extended_search;\r
- uint16 moves[1024];\r
- double probs[1024];\r
- uint64 keys[1024];\r
- FILE *output;\r
-} info_t;\r
-\r
-\r
-// variables\r
-\r
-static int MaxPly;\r
-static int MinGame;\r
-static double MinScore;\r
-static bool RemoveWhite, RemoveBlack;\r
-static bool Uniform;\r
-static bool Quiet=FALSE;\r
-\r
-static book_t Book[1];\r
-\r
-// prototypes\r
-\r
-static void book_clear ();\r
-static void book_insert (const char file_name[]);\r
-static void book_filter ();\r
-static void book_sort ();\r
-static void book_save (const char file_name[]);\r
-\r
-static int find_entry (const board_t * board, int move);\r
-static void resize ();\r
-static void halve_stats (uint64 key);\r
-\r
-static bool keep_entry (int pos);\r
-\r
-static int entry_score (const entry_t * entry);\r
-\r
-static int key_compare (const void * p1, const void * p2);\r
-\r
-static void write_integer (FILE * file, int size, uint64 n);\r
-static uint64 read_integer(FILE * file, int size);\r
-\r
-static void read_entry_file(FILE *f, entry_t *entry);\r
-static void write_entry_file(FILE * f, const entry_t * entry);\r
-\r
-// functions\r
-\r
-// book_make()\r
-\r
-void book_make(int argc, char * argv[]) {\r
-\r
- int i;\r
- const char * pgn_file;\r
- const char * bin_file;\r
-\r
- pgn_file = NULL;\r
- my_string_set(&pgn_file,"book.pgn");\r
-\r
- bin_file = NULL;\r
- my_string_set(&bin_file,"book.bin");\r
-\r
- MaxPly = 1024;\r
- MinGame = 3;\r
- MinScore = 0.0;\r
- RemoveWhite = FALSE;\r
- RemoveBlack = FALSE;\r
- Uniform = FALSE;\r
-\r
- for (i = 1; i < argc; i++) {\r
-\r
- if (FALSE) {\r
-\r
- } else if (my_string_equal(argv[i],"make-book")) {\r
-\r
- // skip\r
-\r
- } else if (my_string_equal(argv[i],"-pgn")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");\r
-\r
- my_string_set(&pgn_file,argv[i]);\r
-\r
- } else if (my_string_equal(argv[i],"-bin")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");\r
-\r
- my_string_set(&bin_file,argv[i]);\r
-\r
- } else if (my_string_equal(argv[i],"-max-ply")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");\r
-\r
- MaxPly = atoi(argv[i]);\r
- ASSERT(MaxPly>=0);\r
-\r
- } else if (my_string_equal(argv[i],"-min-game")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");\r
-\r
- MinGame = atoi(argv[i]);\r
- ASSERT(MinGame>0);\r
-\r
- } else if (my_string_equal(argv[i],"-min-score")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");\r
-\r
- MinScore = atof(argv[i]) / 100.0;\r
- ASSERT(MinScore>=0.0&&MinScore<=1.0);\r
-\r
- } else if (my_string_equal(argv[i],"-only-white")) {\r
-\r
- RemoveWhite = FALSE;\r
- RemoveBlack = TRUE;\r
-\r
- } else if (my_string_equal(argv[i],"-only-black")) {\r
-\r
- RemoveWhite = TRUE;\r
- RemoveBlack = FALSE;\r
-\r
- } else if (my_string_equal(argv[i],"-uniform")) {\r
-\r
- Uniform = TRUE;\r
-\r
- } else {\r
-\r
- my_fatal("book_make(): unknown option \"%s\"\n",argv[i]);\r
- }\r
- }\r
-\r
- book_clear();\r
-\r
- printf("inserting games ...\n");\r
- book_insert(pgn_file);\r
-\r
- printf("filtering entries ...\n");\r
- book_filter();\r
-\r
- printf("sorting entries ...\n");\r
- book_sort();\r
-\r
- printf("saving entries ...\n");\r
- book_save(bin_file);\r
-\r
- printf("all done!\n");\r
-}\r
-\r
-// book_clear()\r
-\r
-static void book_clear() {\r
-\r
- int index;\r
-\r
- Book->alloc = 1;\r
- Book->mask = (Book->alloc * 2) - 1;\r
-\r
- Book->entry = (entry_t *) my_malloc(Book->alloc*sizeof(entry_t));\r
- Book->size = 0;\r
-\r
- Book->hash = (sint32 *) my_malloc((Book->alloc*2)*sizeof(sint32));\r
- for (index = 0; index < Book->alloc*2; index++) {\r
- Book->hash[index] = NIL;\r
- }\r
-}\r
-\r
-// book_insert()\r
-\r
-static void book_insert(const char file_name[]) {\r
-\r
- pgn_t pgn[1];\r
- board_t board[1];\r
- int ply;\r
- int result;\r
- char string[256];\r
- int move;\r
- int pos;\r
-\r
- ASSERT(file_name!=NULL);\r
-\r
- // init\r
-\r
- pgn->game_nb=1;\r
- // scan loop\r
-\r
- pgn_open(pgn,file_name);\r
-\r
- while (pgn_next_game(pgn)) {\r
-\r
- board_start(board);\r
- ply = 0;\r
- result = 0;\r
-\r
- if (FALSE) {\r
- } else if (my_string_equal(pgn->result,"1-0")) {\r
- result = +1;\r
- } else if (my_string_equal(pgn->result,"0-1")) {\r
- result = -1;\r
- }\r
-\r
- while (pgn_next_move(pgn,string,256)) {\r
-\r
- if (ply < MaxPly) {\r
-\r
- move = move_from_san(string,board);\r
-\r
- if (move == MoveNone || !move_is_legal(move,board)) {\r
- my_fatal("book_insert(): illegal move \"%s\" at line %d, column %d,game %d\n",string,pgn->move_line,pgn->move_column,pgn->game_nb);\r
- }\r
-\r
- pos = find_entry(board,move);\r
-\r
- Book->entry[pos].n++;\r
- Book->entry[pos].sum += result+1;\r
-\r
- if (Book->entry[pos].n >= COUNT_MAX) {\r
- halve_stats(board->key);\r
- }\r
-\r
- move_do(board,move);\r
- ply++;\r
- result = -result;\r
- }\r
- }\r
- pgn->game_nb++;\r
- if (pgn->game_nb % 10000 == 0) printf("%d games ...\n",pgn->game_nb);\r
- }\r
-\r
- pgn_close(pgn);\r
-\r
- printf("%d game%s.\n",pgn->game_nb,(pgn->game_nb>2)?"s":"");\r
- printf("%d entries.\n",Book->size);\r
-\r
- return;\r
-}\r
-\r
-// book_filter()\r
-\r
-static void book_filter() {\r
-\r
- int src, dst;\r
-\r
- // entry loop\r
-\r
- dst = 0;\r
-\r
- for (src = 0; src < Book->size; src++) {\r
- if (keep_entry(src)) Book->entry[dst++] = Book->entry[src];\r
- }\r
-\r
- ASSERT(dst>=0&&dst<=Book->size);\r
- Book->size = dst;\r
-\r
- printf("%d entries.\n",Book->size);\r
-}\r
-\r
-// book_sort()\r
-\r
-static void book_sort() {\r
-\r
- // sort keys for binary search\r
-\r
- qsort(Book->entry,Book->size,sizeof(entry_t),&key_compare);\r
-}\r
-\r
-// book_save()\r
-\r
-static void book_save(const char file_name[]) {\r
-\r
- FILE * file;\r
- int pos;\r
-\r
- ASSERT(file_name!=NULL);\r
-\r
- file = fopen(file_name,"wb");\r
- if (file == NULL) my_fatal("book_save(): can't open file \"%s\" for writing: %s\n",file_name,strerror(errno));\r
-\r
- // entry loop\r
-\r
- for (pos = 0; pos < Book->size; pos++) {\r
-\r
- ASSERT(keep_entry(pos));\r
-\r
- write_integer(file,8,Book->entry[pos].key);\r
- write_integer(file,2,Book->entry[pos].move);\r
- write_integer(file,2,entry_score(&Book->entry[pos]));\r
- write_integer(file,2,0);\r
- write_integer(file,2,0);\r
- }\r
-\r
- fclose(file);\r
-}\r
-\r
-// find_entry()\r
-\r
-static int find_entry(const board_t * board, int move) {\r
-\r
- uint64 key;\r
- int index;\r
- int pos;\r
-\r
- ASSERT(board!=NULL);\r
- ASSERT(move==MoveNone || move_is_ok(move));\r
-\r
- ASSERT(move==MoveNone || move_is_legal(move,board));\r
-\r
- // init\r
-\r
- key = board->key;\r
-\r
- // search\r
-\r
- for (index = key & (uint64) Book->mask; (pos=Book->hash[index]) != NIL; index = (index+1) & Book->mask) {\r
-\r
- ASSERT(pos>=0&&pos<Book->size);\r
-\r
- if (Book->entry[pos].key == key && Book->entry[pos].move == move) {\r
- return pos; // found\r
- }\r
- }\r
-\r
- // not found\r
-\r
- ASSERT(Book->size<=Book->alloc);\r
-\r
- if (Book->size == Book->alloc) {\r
-\r
- // allocate more memory\r
-\r
- resize();\r
-\r
- for (index = key & (uint64) Book->mask; Book->hash[index] != NIL; index = (index+1) & Book->mask)\r
- ;\r
- }\r
-\r
- // create a new entry\r
-\r
- ASSERT(Book->size<Book->alloc);\r
- pos = Book->size++;\r
-\r
- Book->entry[pos].key = key;\r
- Book->entry[pos].move = move;\r
- Book->entry[pos].n = 0;\r
- Book->entry[pos].sum = 0;\r
- Book->entry[pos].colour = board->turn;\r
-\r
- // insert into the hash table\r
-\r
- ASSERT(index>=0&&index<Book->alloc*2);\r
- ASSERT(Book->hash[index]==NIL);\r
- Book->hash[index] = pos;\r
-\r
- ASSERT(pos>=0&&pos<Book->size);\r
-\r
- return pos;\r
-}\r
-\r
-// rebuild_hash_table\r
-\r
-static void rebuild_hash_table(){\r
- int index,pos;\r
- for (index = 0; index < Book->alloc*2; index++) {\r
- Book->hash[index] = NIL;\r
- }\r
- for (pos = 0; pos < Book->size; pos++) {\r
- for (index = Book->entry[pos].key & (uint64) Book->mask; Book->hash[index] != NIL; index = (index+1) & Book->mask)\r
- ;\r
- ASSERT(index>=0&&index<Book->alloc*2);\r
- Book->hash[index] = pos;\r
- }\r
-}\r
-\r
-static void resize() {\r
-\r
- int size;\r
-\r
- ASSERT(Book->size==Book->alloc);\r
-\r
- Book->alloc *= 2;\r
- Book->mask = (Book->alloc * 2) - 1;\r
-\r
- size = 0;\r
- size += Book->alloc * sizeof(entry_t);\r
- size += (Book->alloc*2) * sizeof(sint32);\r
-\r
- if (size >= 1048576) if(!Quiet){\r
- printf("allocating %gMB ...\n",((double)size)/1048576.0);\r
- }\r
-\r
- // resize arrays\r
-\r
- Book->entry = (entry_t *) my_realloc(Book->entry,Book->alloc*sizeof(entry_t));\r
- Book->hash = (sint32 *) my_realloc(Book->hash,(Book->alloc*2)*sizeof(sint32));\r
-\r
- // rebuild hash table\r
-\r
- rebuild_hash_table();\r
-}\r
-\r
-\r
-// halve_stats()\r
-\r
-static void halve_stats(uint64 key) {\r
-\r
- int index;\r
- int pos;\r
-\r
- // search\r
-\r
- for (index = key & (uint64) Book->mask; (pos=Book->hash[index]) != NIL; index = (index+1) & Book->mask) {\r
-\r
- ASSERT(pos>=0&&pos<Book->size);\r
-\r
- if (Book->entry[pos].key == key) {\r
- Book->entry[pos].n = (Book->entry[pos].n + 1) / 2;\r
- Book->entry[pos].sum = (Book->entry[pos].sum + 1) / 2;\r
- }\r
- }\r
-}\r
-\r
-// keep_entry()\r
-\r
-static bool keep_entry(int pos) {\r
-\r
- const entry_t * entry;\r
- int colour;\r
- double score;\r
-\r
- ASSERT(pos>=0&&pos<Book->size);\r
-\r
- entry = &Book->entry[pos];\r
-\r
- // if (entry->n == 0) return FALSE;\r
- if (entry->n < MinGame) return FALSE;\r
-\r
- if (entry->sum == 0) return FALSE;\r
-\r
- score = (((double)entry->sum) / ((double)entry->n)) / 2.0;\r
- ASSERT(score>=0.0&&score<=1.0);\r
-\r
- if (score < MinScore) return FALSE;\r
-\r
- colour = entry->colour;\r
-\r
- if ((RemoveWhite && colour_is_white(colour))\r
- || (RemoveBlack && colour_is_black(colour))) {\r
- return FALSE;\r
- }\r
-\r
- if (entry_score(entry) == 0) return FALSE; // REMOVE ME?\r
-\r
- return TRUE;\r
-}\r
-\r
-// entry_score()\r
-\r
-static int entry_score(const entry_t * entry) {\r
-\r
- int score;\r
-\r
- ASSERT(entry!=NULL);\r
-\r
- // score = entry->n; // popularity\r
- score = entry->sum; // "expectancy"\r
-\r
- if (Uniform) score = 1;\r
-\r
- ASSERT(score>=0);\r
-\r
- return score;\r
-}\r
-\r
-// key_compare()\r
-\r
-static int key_compare(const void * p1, const void * p2) {\r
-\r
- const entry_t * entry_1, * entry_2;\r
-\r
- ASSERT(p1!=NULL);\r
- ASSERT(p2!=NULL);\r
-\r
- entry_1 = (const entry_t *) p1;\r
- entry_2 = (const entry_t *) p2;\r
-\r
- if (entry_1->key > entry_2->key) {\r
- return +1;\r
- } else if (entry_1->key < entry_2->key) {\r
- return -1;\r
- } else {\r
- return entry_score(entry_2) - entry_score(entry_1); // highest score first\r
- }\r
-}\r
-\r
-// write_integer()\r
-\r
-static void write_integer(FILE * file, int size, uint64 n) {\r
-\r
- int i;\r
- int b;\r
-\r
- ASSERT(file!=NULL);\r
- ASSERT(size>0&&size<=8);\r
- ASSERT(size==8||n>>(size*8)==0);\r
-\r
- for (i = size-1; i >= 0; i--) {\r
- b = (n >> (i*8)) & 0xFF;\r
- ASSERT(b>=0&&b<256);\r
- fputc(b,file);\r
- }\r
-}\r
-\r
-// read_integer()\r
-\r
-static uint64 read_integer(FILE * file, int size) {\r
- uint64 n;\r
- int i;\r
- int b;\r
- ASSERT(file!=NULL);\r
- ASSERT(size>0&&size<=8);\r
- n = 0;\r
- for (i = 0; i < size; i++) {\r
- b = fgetc(file);\r
- if (b == EOF) {\r
- if (feof(file)) {\r
- my_fatal("read_integer(): fgetc(): EOF reached\n");\r
- } else { // error\r
- my_fatal("read_integer(): fgetc(): %s\n",strerror(errno));\r
- }\r
- }\r
- ASSERT(b>=0&&b<256);\r
- n = (n << 8) | b;\r
- }\r
- return n;\r
-}\r
-\r
-// read_entry_file\r
-\r
-static void read_entry_file(FILE *f, entry_t *entry){\r
- uint64 n;\r
- ASSERT(entry!=NULL);\r
- n = entry->key = read_integer(f,8);\r
- entry->move = read_integer(f,2);\r
- entry->count = read_integer(f,2);\r
- entry->n = read_integer(f,2);\r
- entry->sum = read_integer(f,2);\r
- ASSERT(n==entry->key); // test for mingw compiler bug with anon structs\r
-}\r
-\r
-// write_entry_file\r
-\r
-static void write_entry_file(FILE * f, const entry_t * entry) {\r
- ASSERT(entry!=NULL);\r
- write_integer(f,8,entry->key);\r
- write_integer(f,2,entry->move);\r
- write_integer(f,2,entry->count);\r
- write_integer(f,2,entry->n);\r
- write_integer(f,2,entry->sum);\r
-}\r
-\r
-static void print_list(const board_t *board, list_t *list){\r
- int i;\r
- uint16 move;\r
- char move_string[256];\r
- for (i = 0; i < list_size(list); i++) {\r
- move = list_move(list,i);\r
- move_to_san(move,board,move_string,256);\r
- printf("%s",move_string);\r
- }\r
- printf("\n");\r
-}\r
-\r
-// book_load()\r
-// loads a polyglot book\r
-\r
-static void book_load(const char filename[]){\r
- FILE* f;\r
- entry_t entry[1];\r
- int size;\r
- int i;\r
- int pos;\r
- int index;\r
- ASSERT(filename!=NULL);\r
- if(!(f=fopen(filename,"rb"))){\r
- my_fatal("book_load() : can't open file \"%s\" for reading: %s\n",filename,strerror(errno));\r
- }\r
- fseek(f,0L,SEEK_END); // superportable way to get size of book!\r
- size=ftell(f)/16;\r
- fseek(f,0,SEEK_SET);\r
- for(i=0L;i<size;i++){\r
- read_entry_file(f,entry);\r
- ASSERT(Book->size<=Book->alloc);\r
- if (Book->size == Book->alloc) {\r
- // allocate more memoryx\r
- resize();\r
- }\r
- // insert into the book\r
- pos = Book->size++;\r
- Book->entry[pos].key = entry->key;\r
- ASSERT(entry->move!=MoveNone);\r
- Book->entry[pos].move = entry->move;\r
- Book->entry[pos].count = entry->count;\r
- Book->entry[pos].n = entry->n;\r
- Book->entry[pos].sum = entry->sum;\r
- Book->entry[pos].colour = ColourNone;\r
- // find free hash table spot\r
- for (index = entry->key & (uint64) Book->mask;\r
- Book->hash[index] != NIL;\r
- index = (index+1) & Book->mask);\r
- // insert into the hash table\r
- ASSERT(index>=0&&index<Book->alloc*2);\r
- ASSERT(Book->hash[index]==NIL);\r
- Book->hash[index] = pos;\r
- ASSERT(pos>=0&&pos<Book->size);\r
- }\r
- fclose(f);\r
-}\r
-\r
-// gen_book_moves()\r
-// similar signature as gen_legal_moves\r
-static int gen_book_moves(list_t * list, const board_t * board){\r
- int first_pos, pos, index;\r
- entry_t entry[1];\r
- bool found;\r
- list_clear(list);\r
- found=FALSE;\r
- for (index = board->key & (uint64) Book->mask; (first_pos=Book->hash[index]) != NIL; index = (index+1) & Book->mask) {\r
- ASSERT(first_pos>=0&&first_pos<Book->size);\r
- if (Book->entry[first_pos].key == board->key) {\r
- found=TRUE;\r
- break; // found\r
- }\r
- }\r
- if(!found) return -1;\r
- if(Book->entry[first_pos].move==MoveNone) return -1;\r
- for (pos = first_pos; pos < Book->size; pos++) {\r
- *entry=Book->entry[pos];\r
- if (entry->key != board->key) break;\r
- if (entry->count > 0 &&\r
- entry->move != MoveNone &&\r
- move_is_legal(entry->move,board)) {\r
- list_add_ex(list,entry->move,entry->count);\r
- }\r
- }\r
- return first_pos;\r
-}\r
-\r
-// gen_opp_book_moves()\r
-// moves to which opponent has a reply in book\r
-// similar signature as gen_legal_moves\r
-static void gen_opp_book_moves(list_t * list, const board_t * board){\r
- int move;\r
- list_t new_list[1], legal_moves[1];\r
- board_t new_board[1];\r
- int i;\r
- list_clear(list);\r
- gen_legal_moves(legal_moves,board);\r
- for (i = 0; i < list_size(legal_moves); i++) {\r
- move = list_move(legal_moves,i);\r
- // scratch_board\r
- memcpy(new_board, board, sizeof(board_t));\r
- move_do(new_board,move);\r
- gen_book_moves(new_list,new_board); // wasteful in time but tested!\r
- if(list_size(new_list)!=0){\r
- list_add(list,move);\r
- }\r
- }\r
-}\r
-\r
-static void print_moves(info_t *info){\r
- board_t board[1];\r
- char move_string[256];\r
- int i;\r
- int color=White;\r
- if(!info->output){\r
- return;\r
- }\r
- board_start(board);\r
- for(i=0;i<info->height;i++){\r
- if(color==White){\r
- fprintf(info->output,"%d. ",i/2+1);\r
- color=Black;\r
- }else{\r
- color=White;\r
- }\r
- move_to_san(info->moves[i],board,move_string,256);\r
- fprintf(info->output,"%s", move_string);\r
- if(color==colour_opp(info->initial_color)){\r
- fprintf(info->output,"{%.0f%%} ",100*info->probs[i]);\r
- }else{\r
- fprintf(info->output," ");\r
- }\r
- move_do(board,info->moves[i]);\r
- }\r
-}\r
-\r
-static int search_book(board_t *board, info_t *info, search_t search){\r
- list_t list[1];\r
- board_t new_board[1];\r
- uint16 move;\r
- int count;\r
- int ret;\r
- int i;\r
- int offset;\r
- int pos;\r
- int size;\r
- int prob_sum;\r
- double probs[256];\r
- for(i=0;i<256;i++){\r
- probs[i]=0.0; // kill compiler warnings\r
- }\r
- for(i=0;i<info->height;i++){\r
- if(board->key==info->keys[i]){\r
- if(info->output){\r
- fprintf(info->output,"%d: ",info->line);\r
- print_moves(info);\r
- fprintf(info->output,"{cycle: ply=%d}\n",i);\r
- }\r
- info->line++;\r
- return 1; // end of line because of cycle\r
- }\r
- }\r
- if(!info->book_trans_only || (info->book_trans_only && search==BOOK)){\r
- info->keys[info->height]=board->key;\r
- size=Book->size; // hack\r
- pos=find_entry(board,MoveNone);\r
- if(size==Book->size){\r
- if(info->output){\r
- fprintf(info->output,"%d: ",info->line);\r
- print_moves(info);\r
- fprintf(info->output,"{trans: line=%d, ply=%d}\n",\r
- Book->entry[pos].line,\r
- Book->entry[pos].height);\r
- }\r
- info->line++;\r
- return 1; // end of line because of transposition\r
- }else{\r
- Book->entry[pos].height=info->height;\r
- Book->entry[pos].line=info->line;\r
- }\r
- }\r
- count=0;\r
- if(search==BOOK){\r
- offset=gen_book_moves(list,board);\r
- if(info->extended_search){\r
- gen_legal_moves(list,board);\r
- }\r
-// ASSERT(offset!=-1);\r
- if(offset!=-1){ // only FALSE in starting position for black book\r
- Book->entry[offset].colour=board->turn;\r
- prob_sum=0;\r
- if(!info->extended_search){\r
- for(i=0;i<list_size(list);i++){\r
- prob_sum+=((uint16)list_value(list,i));\r
- }\r
- for(i=0;i<list_size(list);i++){\r
- probs[i]=((double)((uint16)list_value(list,i)))/((double)prob_sum);\r
- }\r
- }\r
- }\r
- }else{\r
- gen_opp_book_moves(list,board);\r
- }\r
- for (i = 0; i < list_size(list); i++) {\r
- move = list_move(list,i);\r
- memcpy(new_board, board, sizeof(board_t));\r
- ASSERT(move_is_legal(move,new_board));\r
- move_do(new_board,move);\r
- ASSERT(search!=opp_search(search));\r
- info->moves[info->height++]=move;\r
- if(search==BOOK){\r
- info->probs[info->height-1]=probs[i];\r
- }\r
- ret=search_book(new_board, info, opp_search(search));\r
- if(ret==0 && search==BOOK){\r
- if(info->output){\r
- fprintf(info->output,"%d: ",info->line);\r
- print_moves(info);\r
- fprintf(info->output,"\n");\r
- }\r
- info->line++;\r
- ret=1; // end of line book move counts for 1\r
- }\r
- info->height--;\r
- ASSERT(info->height>=0);\r
- count+=ret;\r
- }\r
- return count;\r
-}\r
-\r
-void init_info(info_t *info){\r
- info->line=1;\r
- info->height=0;\r
- info->output=NULL;\r
- info->initial_color=White;\r
- info->book_trans_only=FALSE;\r
-}\r
-\r
-// book_clean()\r
-// remove MoveNone entries from book and rebuild hash table\r
-void book_clean(){\r
- int read_ptr,write_ptr;\r
- write_ptr=0;\r
- for(read_ptr=0;read_ptr<Book->size;read_ptr++){\r
- if(Book->entry[read_ptr].move!=MoveNone){\r
- Book->entry[write_ptr++]=Book->entry[read_ptr];\r
- }\r
- }\r
- Book->size=write_ptr;\r
- rebuild_hash_table();\r
-}\r
-\r
-// book_dump()\r
-\r
-void book_dump(int argc, char * argv[]) {\r
- const char * bin_file=NULL;\r
- const char * txt_file=NULL;\r
- char string[StringSize];\r
- int color=ColourNone;\r
- board_t board[1];\r
- info_t info[1];\r
- int i;\r
- FILE *f;\r
- my_string_set(&bin_file,"book.bin");\r
- for (i = 1; i < argc; i++) {\r
- if (FALSE) {\r
- } else if (my_string_equal(argv[i],"dump-book")) {\r
- // skip\r
- } else if (my_string_equal(argv[i],"-bin")) {\r
- i++;\r
- if (i==argc) my_fatal("book_dump(): missing argument\n");\r
- my_string_set(&bin_file,argv[i]);\r
- } else if (my_string_equal(argv[i],"-out")) {\r
- i++;\r
- if (i==argc) my_fatal("book_dump(): missing argument\n");\r
- my_string_set(&txt_file,argv[i]);\r
- } else if (my_string_equal(argv[i],"-color") || my_string_equal(argv[i],"-colour")) {\r
- i++;\r
- if (i == argc) my_fatal("book_dump(): missing argument\n");\r
- if(my_string_equal(argv[i],"white")){\r
- color=White;\r
- }else if (my_string_equal(argv[i],"black")){\r
- color=Black;\r
- }else{\r
- my_fatal("book_dump(): unknown color \"%s\"\n",argv[i]);\r
- }\r
- } else {\r
- my_fatal("book_dump(): unknown option \"%s\"\n",argv[i]);\r
- }\r
- }\r
- if(color==ColourNone){\r
- my_fatal("book_dump(): you must specify a color\n");\r
- }\r
- if(txt_file==NULL){\r
- snprintf(string,StringSize,"book_%s.txt",color?"white":"black");\r
- my_string_set(&txt_file,string);\r
- }\r
-\r
- book_clear();\r
- if(!Quiet){printf("loading book ...\n");}\r
- book_load(bin_file);\r
- board_start(board);\r
- init_info(info);\r
- info->initial_color=color;\r
- if(!(f=fopen(txt_file,"w"))){\r
- my_fatal("book_dump(): can't open file \"%s\" for writing: %s",\r
- txt_file,strerror(errno));\r
- }\r
- info->output=f;\r
- fprintf(info->output,"Dump of \"%s\" for %s.\n",\r
- bin_file,color==White?"white":"black");\r
- if(color==White){\r
- if(!Quiet){printf("generating lines for white...\n");}\r
- search_book(board,info, BOOK);\r
- }else{\r
- if(!Quiet){printf("generating lines for black...\n");}\r
- search_book(board,info, ALL);\r
- }\r
-}\r
-\r
-// book_info()\r
-\r
-void book_info(int argc,char* argv[]){\r
- const char *bin_file=NULL;\r
- board_t board[1];\r
- info_t info[1];\r
- uint64 last_key;\r
- int pos;\r
- int white_pos,black_pos,total_pos,white_pos_extended,\r
- black_pos_extended,white_pos_extended_diff,black_pos_extended_diff;\r
- int s;\r
- bool extended_search=FALSE;\r
- int i;\r
- Quiet=TRUE;\r
- my_string_set(&bin_file,"book.bin");\r
-\r
- for (i = 1; i < argc; i++) {\r
- if (FALSE) {\r
- } else if (my_string_equal(argv[i],"info-book")) {\r
- // skip\r
- } else if (my_string_equal(argv[i],"-bin")) {\r
- i++;\r
- if (i==argc) my_fatal("book_info(): missing argument\n");\r
- my_string_set(&bin_file,argv[i]);\r
- } else if (my_string_equal(argv[i],"-exact")) {\r
- extended_search=TRUE;\r
- } else {\r
- my_fatal("book_info(): unknown option \"%s\"\n",argv[i]);\r
- }\r
- }\r
- book_clear();\r
- if(!Quiet){printf("loading book ...\n");}\r
- book_load(bin_file);\r
- s=Book->size;\r
-\r
- board_start(board);\r
- init_info(info);\r
- info->book_trans_only=FALSE;\r
- info->initial_color=White;\r
- info->extended_search=FALSE;\r
- search_book(board,info, BOOK);\r
- printf("Lines for white : %8d\n",info->line-1);\r
-\r
-\r
- info->line=1;\r
- info->height=0;\r
- info->initial_color=Black;\r
- book_clean();\r
- ASSERT(Book->size==s);\r
- board_start(board);\r
- search_book(board,info, ALL);\r
- printf("Lines for black : %8d\n",info->line-1);\r
-\r
- book_clean();\r
- ASSERT(Book->size==s);\r
- white_pos=0;\r
- black_pos=0;\r
- total_pos=0;\r
- last_key=0;\r
- for(pos=0;pos<Book->size;pos++){\r
- if(Book->entry[pos].key==last_key){\r
- ASSERT(Book->entry[pos].colour==ColourNone);\r
- continue;\r
- }\r
- last_key=Book->entry[pos].key;\r
- total_pos++;\r
- if(Book->entry[pos].colour==White){\r
- white_pos++;\r
- }else if(Book->entry[pos].colour==Black){\r
- black_pos++;\r
- }\r
- }\r
- printf("Positions on lines for white : %8d\n",white_pos);\r
- printf("Positions on lines for black : %8d\n",black_pos);\r
-\r
- \r
- if(extended_search){\r
- init_info(info);\r
- info->book_trans_only=TRUE;\r
- info->initial_color=White;\r
- info->extended_search=TRUE;\r
- book_clean();\r
- board_start(board);\r
- search_book(board,info, BOOK);\r
-\r
- init_info(info);\r
- info->book_trans_only=TRUE;\r
- info->initial_color=Black;\r
- info->extended_search=TRUE;\r
- book_clean();\r
- board_start(board);\r
- search_book(board,info, ALL);\r
- book_clean();\r
- ASSERT(Book->size==s);\r
- white_pos_extended=0;\r
- black_pos_extended=0;\r
- last_key=0;\r
- for(pos=0;pos<Book->size;pos++){\r
- if(Book->entry[pos].key==last_key){\r
- ASSERT(Book->entry[pos].colour==ColourNone);\r
- continue;\r
- }\r
- last_key=Book->entry[pos].key;\r
- if(Book->entry[pos].colour==White){\r
- white_pos_extended++;\r
- }else if(Book->entry[pos].colour==Black){\r
- black_pos_extended++;\r
- }\r
- }\r
- white_pos_extended_diff=white_pos_extended-white_pos;\r
- black_pos_extended_diff=black_pos_extended-black_pos;\r
- printf("Unreachable white positions(?) : %8d\n",\r
- white_pos_extended_diff);\r
- printf("Unreachable black positions(?) : %8d\n",\r
- black_pos_extended_diff);\r
-\r
- }\r
- if(extended_search){\r
- printf("Isolated positions : %8d\n",\r
- total_pos-white_pos_extended-black_pos_extended);\r
- }else{\r
- printf("Isolated positions : %8d\n",\r
- total_pos-white_pos-black_pos);\r
- }\r
-}\r
-\r
-\r
-\r
-// end of book_make.cpp\r
-\r
+// book_make.c
+
+// includes
+
+#include <errno.h>
+#include <math.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "board.h"
+#include "book_make.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_gen.h"
+#include "move_legal.h"
+#include "pgn.h"
+#include "san.h"
+#include "util.h"
+
+// constants
+
+#define COUNT_MAX ((int)16384)
+
+static const int NIL = -1;
+
+// defines
+
+#define opp_search(s) ((s)==BOOK?ALL:BOOK)
+
+// types
+
+typedef struct {
+ uint64 key;
+ uint16 move;
+ uint16 count;
+// Unfortunately the minggw32 cross compiler [4.2.1-sjlj (mingw32-2)]
+// seems to have a bug with anon structs contained in unions when using -O2.
+// See the ASSERT below in "read_entry_file"...
+// To be fair this seems to be illegal in C++
+// although it is hard to understand why, and the compiler does not complain
+// even with -Wall.
+// union {
+// struct {
+ uint16 n;
+ uint16 sum;
+// };
+// struct {
+ uint8 height;
+ int line;
+// };
+// };
+ uint8 colour;
+} entry_t;
+
+typedef struct {
+ int size;
+ int alloc;
+ uint32 mask;
+ entry_t * entry;
+ sint32 * hash;
+} book_t;
+
+typedef enum {
+ BOOK,
+ ALL
+} search_t;
+
+typedef struct {
+ int height;
+ int line;
+ int initial_color;
+ bool book_trans_only;
+ bool extended_search;
+ uint16 moves[1024];
+ double probs[1024];
+ uint64 keys[1024];
+ FILE *output;
+} info_t;
+
+
+// variables
+
+static int MaxPly;
+static int MinGame;
+static double MinScore;
+static bool RemoveWhite, RemoveBlack;
+static bool Uniform;
+static bool Quiet=FALSE;
+
+static book_t Book[1];
+
+// prototypes
+
+static void book_clear ();
+static void book_insert (const char file_name[]);
+static void book_filter ();
+static void book_sort ();
+static void book_save (const char file_name[]);
+
+static int find_entry (const board_t * board, int move);
+static void resize ();
+static void halve_stats (uint64 key);
+
+static bool keep_entry (int pos);
+
+static int entry_score (const entry_t * entry);
+
+static int key_compare (const void * p1, const void * p2);
+
+static void write_integer (FILE * file, int size, uint64 n);
+static uint64 read_integer(FILE * file, int size);
+
+static void read_entry_file(FILE *f, entry_t *entry);
+static void write_entry_file(FILE * f, const entry_t * entry);
+
+// functions
+
+// book_make()
+
+void book_make(int argc, char * argv[]) {
+
+ int i;
+ const char * pgn_file;
+ const char * bin_file;
+
+ pgn_file = NULL;
+ my_string_set(&pgn_file,"book.pgn");
+
+ bin_file = NULL;
+ my_string_set(&bin_file,"book.bin");
+
+ MaxPly = 1024;
+ MinGame = 3;
+ MinScore = 0.0;
+ RemoveWhite = FALSE;
+ RemoveBlack = FALSE;
+ Uniform = FALSE;
+
+ for (i = 1; i < argc; i++) {
+
+ if (FALSE) {
+
+ } else if (my_string_equal(argv[i],"make-book")) {
+
+ // skip
+
+ } else if (my_string_equal(argv[i],"-pgn")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");
+
+ my_string_set(&pgn_file,argv[i]);
+
+ } else if (my_string_equal(argv[i],"-bin")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");
+
+ my_string_set(&bin_file,argv[i]);
+
+ } else if (my_string_equal(argv[i],"-max-ply")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");
+
+ MaxPly = atoi(argv[i]);
+ ASSERT(MaxPly>=0);
+
+ } else if (my_string_equal(argv[i],"-min-game")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");
+
+ MinGame = atoi(argv[i]);
+ ASSERT(MinGame>0);
+
+ } else if (my_string_equal(argv[i],"-min-score")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("book_make(): missing argument\n");
+
+ MinScore = atof(argv[i]) / 100.0;
+ ASSERT(MinScore>=0.0&&MinScore<=1.0);
+
+ } else if (my_string_equal(argv[i],"-only-white")) {
+
+ RemoveWhite = FALSE;
+ RemoveBlack = TRUE;
+
+ } else if (my_string_equal(argv[i],"-only-black")) {
+
+ RemoveWhite = TRUE;
+ RemoveBlack = FALSE;
+
+ } else if (my_string_equal(argv[i],"-uniform")) {
+
+ Uniform = TRUE;
+
+ } else {
+
+ my_fatal("book_make(): unknown option \"%s\"\n",argv[i]);
+ }
+ }
+
+ book_clear();
+
+ printf("inserting games ...\n");
+ book_insert(pgn_file);
+
+ printf("filtering entries ...\n");
+ book_filter();
+
+ printf("sorting entries ...\n");
+ book_sort();
+
+ printf("saving entries ...\n");
+ book_save(bin_file);
+
+ printf("all done!\n");
+}
+
+// book_clear()
+
+static void book_clear() {
+
+ int index;
+
+ Book->alloc = 1;
+ Book->mask = (Book->alloc * 2) - 1;
+
+ Book->entry = (entry_t *) my_malloc(Book->alloc*sizeof(entry_t));
+ Book->size = 0;
+
+ Book->hash = (sint32 *) my_malloc((Book->alloc*2)*sizeof(sint32));
+ for (index = 0; index < Book->alloc*2; index++) {
+ Book->hash[index] = NIL;
+ }
+}
+
+// book_insert()
+
+static void book_insert(const char file_name[]) {
+
+ pgn_t pgn[1];
+ board_t board[1];
+ int ply;
+ int result;
+ char string[256];
+ int move;
+ int pos;
+
+ ASSERT(file_name!=NULL);
+
+ // init
+
+ pgn->game_nb=1;
+ // scan loop
+
+ pgn_open(pgn,file_name);
+
+ while (pgn_next_game(pgn)) {
+
+ board_start(board);
+ ply = 0;
+ result = 0;
+
+ if (FALSE) {
+ } else if (my_string_equal(pgn->result,"1-0")) {
+ result = +1;
+ } else if (my_string_equal(pgn->result,"0-1")) {
+ result = -1;
+ }
+
+ while (pgn_next_move(pgn,string,256)) {
+
+ if (ply < MaxPly) {
+
+ move = move_from_san(string,board);
+
+ if (move == MoveNone || !move_is_legal(move,board)) {
+ my_fatal("book_insert(): illegal move \"%s\" at line %d, column %d,game %d\n",string,pgn->move_line,pgn->move_column,pgn->game_nb);
+ }
+
+ pos = find_entry(board,move);
+
+ Book->entry[pos].n++;
+ Book->entry[pos].sum += result+1;
+
+ if (Book->entry[pos].n >= COUNT_MAX) {
+ halve_stats(board->key);
+ }
+
+ move_do(board,move);
+ ply++;
+ result = -result;
+ }
+ }
+ pgn->game_nb++;
+ if (pgn->game_nb % 10000 == 0) printf("%d games ...\n",pgn->game_nb);
+ }
+
+ pgn_close(pgn);
+
+ printf("%d game%s.\n",pgn->game_nb,(pgn->game_nb>2)?"s":"");
+ printf("%d entries.\n",Book->size);
+
+ return;
+}
+
+// book_filter()
+
+static void book_filter() {
+
+ int src, dst;
+
+ // entry loop
+
+ dst = 0;
+
+ for (src = 0; src < Book->size; src++) {
+ if (keep_entry(src)) Book->entry[dst++] = Book->entry[src];
+ }
+
+ ASSERT(dst>=0&&dst<=Book->size);
+ Book->size = dst;
+
+ printf("%d entries.\n",Book->size);
+}
+
+// book_sort()
+
+static void book_sort() {
+
+ // sort keys for binary search
+
+ qsort(Book->entry,Book->size,sizeof(entry_t),&key_compare);
+}
+
+// book_save()
+
+static void book_save(const char file_name[]) {
+
+ FILE * file;
+ int pos;
+
+ ASSERT(file_name!=NULL);
+
+ file = fopen(file_name,"wb");
+ if (file == NULL) my_fatal("book_save(): can't open file \"%s\" for writing: %s\n",file_name,strerror(errno));
+
+ // entry loop
+
+ for (pos = 0; pos < Book->size; pos++) {
+
+ ASSERT(keep_entry(pos));
+
+ write_integer(file,8,Book->entry[pos].key);
+ write_integer(file,2,Book->entry[pos].move);
+ write_integer(file,2,entry_score(&Book->entry[pos]));
+ write_integer(file,2,0);
+ write_integer(file,2,0);
+ }
+
+ fclose(file);
+}
+
+// find_entry()
+
+static int find_entry(const board_t * board, int move) {
+
+ uint64 key;
+ int index;
+ int pos;
+
+ ASSERT(board!=NULL);
+ ASSERT(move==MoveNone || move_is_ok(move));
+
+ ASSERT(move==MoveNone || move_is_legal(move,board));
+
+ // init
+
+ key = board->key;
+
+ // search
+
+ for (index = key & (uint64) Book->mask; (pos=Book->hash[index]) != NIL; index = (index+1) & Book->mask) {
+
+ ASSERT(pos>=0&&pos<Book->size);
+
+ if (Book->entry[pos].key == key && Book->entry[pos].move == move) {
+ return pos; // found
+ }
+ }
+
+ // not found
+
+ ASSERT(Book->size<=Book->alloc);
+
+ if (Book->size == Book->alloc) {
+
+ // allocate more memory
+
+ resize();
+
+ for (index = key & (uint64) Book->mask; Book->hash[index] != NIL; index = (index+1) & Book->mask)
+ ;
+ }
+
+ // create a new entry
+
+ ASSERT(Book->size<Book->alloc);
+ pos = Book->size++;
+
+ Book->entry[pos].key = key;
+ Book->entry[pos].move = move;
+ Book->entry[pos].n = 0;
+ Book->entry[pos].sum = 0;
+ Book->entry[pos].colour = board->turn;
+
+ // insert into the hash table
+
+ ASSERT(index>=0&&index<Book->alloc*2);
+ ASSERT(Book->hash[index]==NIL);
+ Book->hash[index] = pos;
+
+ ASSERT(pos>=0&&pos<Book->size);
+
+ return pos;
+}
+
+// rebuild_hash_table
+
+static void rebuild_hash_table(){
+ int index,pos;
+ for (index = 0; index < Book->alloc*2; index++) {
+ Book->hash[index] = NIL;
+ }
+ for (pos = 0; pos < Book->size; pos++) {
+ for (index = Book->entry[pos].key & (uint64) Book->mask; Book->hash[index] != NIL; index = (index+1) & Book->mask)
+ ;
+ ASSERT(index>=0&&index<Book->alloc*2);
+ Book->hash[index] = pos;
+ }
+}
+
+static void resize() {
+
+ int size;
+
+ ASSERT(Book->size==Book->alloc);
+
+ Book->alloc *= 2;
+ Book->mask = (Book->alloc * 2) - 1;
+
+ size = 0;
+ size += Book->alloc * sizeof(entry_t);
+ size += (Book->alloc*2) * sizeof(sint32);
+
+ if (size >= 1048576) if(!Quiet){
+ printf("allocating %gMB ...\n",((double)size)/1048576.0);
+ }
+
+ // resize arrays
+
+ Book->entry = (entry_t *) my_realloc(Book->entry,Book->alloc*sizeof(entry_t));
+ Book->hash = (sint32 *) my_realloc(Book->hash,(Book->alloc*2)*sizeof(sint32));
+
+ // rebuild hash table
+
+ rebuild_hash_table();
+}
+
+
+// halve_stats()
+
+static void halve_stats(uint64 key) {
+
+ int index;
+ int pos;
+
+ // search
+
+ for (index = key & (uint64) Book->mask; (pos=Book->hash[index]) != NIL; index = (index+1) & Book->mask) {
+
+ ASSERT(pos>=0&&pos<Book->size);
+
+ if (Book->entry[pos].key == key) {
+ Book->entry[pos].n = (Book->entry[pos].n + 1) / 2;
+ Book->entry[pos].sum = (Book->entry[pos].sum + 1) / 2;
+ }
+ }
+}
+
+// keep_entry()
+
+static bool keep_entry(int pos) {
+
+ const entry_t * entry;
+ int colour;
+ double score;
+
+ ASSERT(pos>=0&&pos<Book->size);
+
+ entry = &Book->entry[pos];
+
+ // if (entry->n == 0) return FALSE;
+ if (entry->n < MinGame) return FALSE;
+
+ if (entry->sum == 0) return FALSE;
+
+ score = (((double)entry->sum) / ((double)entry->n)) / 2.0;
+ ASSERT(score>=0.0&&score<=1.0);
+
+ if (score < MinScore) return FALSE;
+
+ colour = entry->colour;
+
+ if ((RemoveWhite && colour_is_white(colour))
+ || (RemoveBlack && colour_is_black(colour))) {
+ return FALSE;
+ }
+
+ if (entry_score(entry) == 0) return FALSE; // REMOVE ME?
+
+ return TRUE;
+}
+
+// entry_score()
+
+static int entry_score(const entry_t * entry) {
+
+ int score;
+
+ ASSERT(entry!=NULL);
+
+ // score = entry->n; // popularity
+ score = entry->sum; // "expectancy"
+
+ if (Uniform) score = 1;
+
+ ASSERT(score>=0);
+
+ return score;
+}
+
+// key_compare()
+
+static int key_compare(const void * p1, const void * p2) {
+
+ const entry_t * entry_1, * entry_2;
+
+ ASSERT(p1!=NULL);
+ ASSERT(p2!=NULL);
+
+ entry_1 = (const entry_t *) p1;
+ entry_2 = (const entry_t *) p2;
+
+ if (entry_1->key > entry_2->key) {
+ return +1;
+ } else if (entry_1->key < entry_2->key) {
+ return -1;
+ } else {
+ return entry_score(entry_2) - entry_score(entry_1); // highest score first
+ }
+}
+
+// write_integer()
+
+static void write_integer(FILE * file, int size, uint64 n) {
+
+ int i;
+ int b;
+
+ ASSERT(file!=NULL);
+ ASSERT(size>0&&size<=8);
+ ASSERT(size==8||n>>(size*8)==0);
+
+ for (i = size-1; i >= 0; i--) {
+ b = (n >> (i*8)) & 0xFF;
+ ASSERT(b>=0&&b<256);
+ fputc(b,file);
+ }
+}
+
+// read_integer()
+
+static uint64 read_integer(FILE * file, int size) {
+ uint64 n;
+ int i;
+ int b;
+ ASSERT(file!=NULL);
+ ASSERT(size>0&&size<=8);
+ n = 0;
+ for (i = 0; i < size; i++) {
+ b = fgetc(file);
+ if (b == EOF) {
+ if (feof(file)) {
+ my_fatal("read_integer(): fgetc(): EOF reached\n");
+ } else { // error
+ my_fatal("read_integer(): fgetc(): %s\n",strerror(errno));
+ }
+ }
+ ASSERT(b>=0&&b<256);
+ n = (n << 8) | b;
+ }
+ return n;
+}
+
+// read_entry_file
+
+static void read_entry_file(FILE *f, entry_t *entry){
+ uint64 n;
+ ASSERT(entry!=NULL);
+ n = entry->key = read_integer(f,8);
+ entry->move = read_integer(f,2);
+ entry->count = read_integer(f,2);
+ entry->n = read_integer(f,2);
+ entry->sum = read_integer(f,2);
+ ASSERT(n==entry->key); // test for mingw compiler bug with anon structs
+}
+
+// write_entry_file
+
+static void write_entry_file(FILE * f, const entry_t * entry) {
+ ASSERT(entry!=NULL);
+ write_integer(f,8,entry->key);
+ write_integer(f,2,entry->move);
+ write_integer(f,2,entry->count);
+ write_integer(f,2,entry->n);
+ write_integer(f,2,entry->sum);
+}
+
+static void print_list(const board_t *board, list_t *list){
+ int i;
+ uint16 move;
+ char move_string[256];
+ for (i = 0; i < list_size(list); i++) {
+ move = list_move(list,i);
+ move_to_san(move,board,move_string,256);
+ printf("%s",move_string);
+ }
+ printf("\n");
+}
+
+// book_load()
+// loads a polyglot book
+
+static void book_load(const char filename[]){
+ FILE* f;
+ entry_t entry[1];
+ int size;
+ int i;
+ int pos;
+ int index;
+ ASSERT(filename!=NULL);
+ if(!(f=fopen(filename,"rb"))){
+ my_fatal("book_load() : can't open file \"%s\" for reading: %s\n",filename,strerror(errno));
+ }
+ fseek(f,0L,SEEK_END); // superportable way to get size of book!
+ size=ftell(f)/16;
+ fseek(f,0,SEEK_SET);
+ for(i=0L;i<size;i++){
+ read_entry_file(f,entry);
+ ASSERT(Book->size<=Book->alloc);
+ if (Book->size == Book->alloc) {
+ // allocate more memoryx
+ resize();
+ }
+ // insert into the book
+ pos = Book->size++;
+ Book->entry[pos].key = entry->key;
+ ASSERT(entry->move!=MoveNone);
+ Book->entry[pos].move = entry->move;
+ Book->entry[pos].count = entry->count;
+ Book->entry[pos].n = entry->n;
+ Book->entry[pos].sum = entry->sum;
+ Book->entry[pos].colour = ColourNone;
+ // find free hash table spot
+ for (index = entry->key & (uint64) Book->mask;
+ Book->hash[index] != NIL;
+ index = (index+1) & Book->mask);
+ // insert into the hash table
+ ASSERT(index>=0&&index<Book->alloc*2);
+ ASSERT(Book->hash[index]==NIL);
+ Book->hash[index] = pos;
+ ASSERT(pos>=0&&pos<Book->size);
+ }
+ fclose(f);
+}
+
+// gen_book_moves()
+// similar signature as gen_legal_moves
+static int gen_book_moves(list_t * list, const board_t * board){
+ int first_pos, pos, index;
+ entry_t entry[1];
+ bool found;
+ list_clear(list);
+ found=FALSE;
+ for (index = board->key & (uint64) Book->mask; (first_pos=Book->hash[index]) != NIL; index = (index+1) & Book->mask) {
+ ASSERT(first_pos>=0&&first_pos<Book->size);
+ if (Book->entry[first_pos].key == board->key) {
+ found=TRUE;
+ break; // found
+ }
+ }
+ if(!found) return -1;
+ if(Book->entry[first_pos].move==MoveNone) return -1;
+ for (pos = first_pos; pos < Book->size; pos++) {
+ *entry=Book->entry[pos];
+ if (entry->key != board->key) break;
+ if (entry->count > 0 &&
+ entry->move != MoveNone &&
+ move_is_legal(entry->move,board)) {
+ list_add_ex(list,entry->move,entry->count);
+ }
+ }
+ return first_pos;
+}
+
+// gen_opp_book_moves()
+// moves to which opponent has a reply in book
+// similar signature as gen_legal_moves
+static void gen_opp_book_moves(list_t * list, const board_t * board){
+ int move;
+ list_t new_list[1], legal_moves[1];
+ board_t new_board[1];
+ int i;
+ list_clear(list);
+ gen_legal_moves(legal_moves,board);
+ for (i = 0; i < list_size(legal_moves); i++) {
+ move = list_move(legal_moves,i);
+ // scratch_board
+ memcpy(new_board, board, sizeof(board_t));
+ move_do(new_board,move);
+ gen_book_moves(new_list,new_board); // wasteful in time but tested!
+ if(list_size(new_list)!=0){
+ list_add(list,move);
+ }
+ }
+}
+
+static void print_moves(info_t *info){
+ board_t board[1];
+ char move_string[256];
+ int i;
+ int color=White;
+ if(!info->output){
+ return;
+ }
+ board_start(board);
+ for(i=0;i<info->height;i++){
+ if(color==White){
+ fprintf(info->output,"%d. ",i/2+1);
+ color=Black;
+ }else{
+ color=White;
+ }
+ move_to_san(info->moves[i],board,move_string,256);
+ fprintf(info->output,"%s", move_string);
+ if(color==colour_opp(info->initial_color)){
+ fprintf(info->output,"{%.0f%%} ",100*info->probs[i]);
+ }else{
+ fprintf(info->output," ");
+ }
+ move_do(board,info->moves[i]);
+ }
+}
+
+static int search_book(board_t *board, info_t *info, search_t search){
+ list_t list[1];
+ board_t new_board[1];
+ uint16 move;
+ int count;
+ int ret;
+ int i;
+ int offset;
+ int pos;
+ int size;
+ int prob_sum;
+ double probs[256];
+ for(i=0;i<256;i++){
+ probs[i]=0.0; // kill compiler warnings
+ }
+ for(i=0;i<info->height;i++){
+ if(board->key==info->keys[i]){
+ if(info->output){
+ fprintf(info->output,"%d: ",info->line);
+ print_moves(info);
+ fprintf(info->output,"{cycle: ply=%d}\n",i);
+ }
+ info->line++;
+ return 1; // end of line because of cycle
+ }
+ }
+ if(!info->book_trans_only || (info->book_trans_only && search==BOOK)){
+ info->keys[info->height]=board->key;
+ size=Book->size; // hack
+ pos=find_entry(board,MoveNone);
+ if(size==Book->size){
+ if(info->output){
+ fprintf(info->output,"%d: ",info->line);
+ print_moves(info);
+ fprintf(info->output,"{trans: line=%d, ply=%d}\n",
+ Book->entry[pos].line,
+ Book->entry[pos].height);
+ }
+ info->line++;
+ return 1; // end of line because of transposition
+ }else{
+ Book->entry[pos].height=info->height;
+ Book->entry[pos].line=info->line;
+ }
+ }
+ count=0;
+ if(search==BOOK){
+ offset=gen_book_moves(list,board);
+ if(info->extended_search){
+ gen_legal_moves(list,board);
+ }
+// ASSERT(offset!=-1);
+ if(offset!=-1){ // only FALSE in starting position for black book
+ Book->entry[offset].colour=board->turn;
+ prob_sum=0;
+ if(!info->extended_search){
+ for(i=0;i<list_size(list);i++){
+ prob_sum+=((uint16)list_value(list,i));
+ }
+ for(i=0;i<list_size(list);i++){
+ probs[i]=((double)((uint16)list_value(list,i)))/((double)prob_sum);
+ }
+ }
+ }
+ }else{
+ gen_opp_book_moves(list,board);
+ }
+ for (i = 0; i < list_size(list); i++) {
+ move = list_move(list,i);
+ memcpy(new_board, board, sizeof(board_t));
+ ASSERT(move_is_legal(move,new_board));
+ move_do(new_board,move);
+ ASSERT(search!=opp_search(search));
+ info->moves[info->height++]=move;
+ if(search==BOOK){
+ info->probs[info->height-1]=probs[i];
+ }
+ ret=search_book(new_board, info, opp_search(search));
+ if(ret==0 && search==BOOK){
+ if(info->output){
+ fprintf(info->output,"%d: ",info->line);
+ print_moves(info);
+ fprintf(info->output,"\n");
+ }
+ info->line++;
+ ret=1; // end of line book move counts for 1
+ }
+ info->height--;
+ ASSERT(info->height>=0);
+ count+=ret;
+ }
+ return count;
+}
+
+void init_info(info_t *info){
+ info->line=1;
+ info->height=0;
+ info->output=NULL;
+ info->initial_color=White;
+ info->book_trans_only=FALSE;
+}
+
+// book_clean()
+// remove MoveNone entries from book and rebuild hash table
+void book_clean(){
+ int read_ptr,write_ptr;
+ write_ptr=0;
+ for(read_ptr=0;read_ptr<Book->size;read_ptr++){
+ if(Book->entry[read_ptr].move!=MoveNone){
+ Book->entry[write_ptr++]=Book->entry[read_ptr];
+ }
+ }
+ Book->size=write_ptr;
+ rebuild_hash_table();
+}
+
+// book_dump()
+
+void book_dump(int argc, char * argv[]) {
+ const char * bin_file=NULL;
+ const char * txt_file=NULL;
+ char string[StringSize];
+ int color=ColourNone;
+ board_t board[1];
+ info_t info[1];
+ int i;
+ FILE *f;
+ my_string_set(&bin_file,"book.bin");
+ for (i = 1; i < argc; i++) {
+ if (FALSE) {
+ } else if (my_string_equal(argv[i],"dump-book")) {
+ // skip
+ } else if (my_string_equal(argv[i],"-bin")) {
+ i++;
+ if (i==argc) my_fatal("book_dump(): missing argument\n");
+ my_string_set(&bin_file,argv[i]);
+ } else if (my_string_equal(argv[i],"-out")) {
+ i++;
+ if (i==argc) my_fatal("book_dump(): missing argument\n");
+ my_string_set(&txt_file,argv[i]);
+ } else if (my_string_equal(argv[i],"-color") || my_string_equal(argv[i],"-colour")) {
+ i++;
+ if (i == argc) my_fatal("book_dump(): missing argument\n");
+ if(my_string_equal(argv[i],"white")){
+ color=White;
+ }else if (my_string_equal(argv[i],"black")){
+ color=Black;
+ }else{
+ my_fatal("book_dump(): unknown color \"%s\"\n",argv[i]);
+ }
+ } else {
+ my_fatal("book_dump(): unknown option \"%s\"\n",argv[i]);
+ }
+ }
+ if(color==ColourNone){
+ my_fatal("book_dump(): you must specify a color\n");
+ }
+ if(txt_file==NULL){
+ snprintf(string,StringSize,"book_%s.txt",color?"white":"black");
+ my_string_set(&txt_file,string);
+ }
+
+ book_clear();
+ if(!Quiet){printf("loading book ...\n");}
+ book_load(bin_file);
+ board_start(board);
+ init_info(info);
+ info->initial_color=color;
+ if(!(f=fopen(txt_file,"w"))){
+ my_fatal("book_dump(): can't open file \"%s\" for writing: %s",
+ txt_file,strerror(errno));
+ }
+ info->output=f;
+ fprintf(info->output,"Dump of \"%s\" for %s.\n",
+ bin_file,color==White?"white":"black");
+ if(color==White){
+ if(!Quiet){printf("generating lines for white...\n");}
+ search_book(board,info, BOOK);
+ }else{
+ if(!Quiet){printf("generating lines for black...\n");}
+ search_book(board,info, ALL);
+ }
+}
+
+// book_info()
+
+void book_info(int argc,char* argv[]){
+ const char *bin_file=NULL;
+ board_t board[1];
+ info_t info[1];
+ uint64 last_key;
+ int pos;
+ int white_pos,black_pos,total_pos,white_pos_extended,
+ black_pos_extended,white_pos_extended_diff,black_pos_extended_diff;
+ int s;
+ bool extended_search=FALSE;
+ int i;
+ Quiet=TRUE;
+ my_string_set(&bin_file,"book.bin");
+
+ for (i = 1; i < argc; i++) {
+ if (FALSE) {
+ } else if (my_string_equal(argv[i],"info-book")) {
+ // skip
+ } else if (my_string_equal(argv[i],"-bin")) {
+ i++;
+ if (i==argc) my_fatal("book_info(): missing argument\n");
+ my_string_set(&bin_file,argv[i]);
+ } else if (my_string_equal(argv[i],"-exact")) {
+ extended_search=TRUE;
+ } else {
+ my_fatal("book_info(): unknown option \"%s\"\n",argv[i]);
+ }
+ }
+ book_clear();
+ if(!Quiet){printf("loading book ...\n");}
+ book_load(bin_file);
+ s=Book->size;
+
+ board_start(board);
+ init_info(info);
+ info->book_trans_only=FALSE;
+ info->initial_color=White;
+ info->extended_search=FALSE;
+ search_book(board,info, BOOK);
+ printf("Lines for white : %8d\n",info->line-1);
+
+
+ info->line=1;
+ info->height=0;
+ info->initial_color=Black;
+ book_clean();
+ ASSERT(Book->size==s);
+ board_start(board);
+ search_book(board,info, ALL);
+ printf("Lines for black : %8d\n",info->line-1);
+
+ book_clean();
+ ASSERT(Book->size==s);
+ white_pos=0;
+ black_pos=0;
+ total_pos=0;
+ last_key=0;
+ for(pos=0;pos<Book->size;pos++){
+ if(Book->entry[pos].key==last_key){
+ ASSERT(Book->entry[pos].colour==ColourNone);
+ continue;
+ }
+ last_key=Book->entry[pos].key;
+ total_pos++;
+ if(Book->entry[pos].colour==White){
+ white_pos++;
+ }else if(Book->entry[pos].colour==Black){
+ black_pos++;
+ }
+ }
+ printf("Positions on lines for white : %8d\n",white_pos);
+ printf("Positions on lines for black : %8d\n",black_pos);
+
+
+ if(extended_search){
+ init_info(info);
+ info->book_trans_only=TRUE;
+ info->initial_color=White;
+ info->extended_search=TRUE;
+ book_clean();
+ board_start(board);
+ search_book(board,info, BOOK);
+
+ init_info(info);
+ info->book_trans_only=TRUE;
+ info->initial_color=Black;
+ info->extended_search=TRUE;
+ book_clean();
+ board_start(board);
+ search_book(board,info, ALL);
+ book_clean();
+ ASSERT(Book->size==s);
+ white_pos_extended=0;
+ black_pos_extended=0;
+ last_key=0;
+ for(pos=0;pos<Book->size;pos++){
+ if(Book->entry[pos].key==last_key){
+ ASSERT(Book->entry[pos].colour==ColourNone);
+ continue;
+ }
+ last_key=Book->entry[pos].key;
+ if(Book->entry[pos].colour==White){
+ white_pos_extended++;
+ }else if(Book->entry[pos].colour==Black){
+ black_pos_extended++;
+ }
+ }
+ white_pos_extended_diff=white_pos_extended-white_pos;
+ black_pos_extended_diff=black_pos_extended-black_pos;
+ printf("Unreachable white positions(?) : %8d\n",
+ white_pos_extended_diff);
+ printf("Unreachable black positions(?) : %8d\n",
+ black_pos_extended_diff);
+
+ }
+ if(extended_search){
+ printf("Isolated positions : %8d\n",
+ total_pos-white_pos_extended-black_pos_extended);
+ }else{
+ printf("Isolated positions : %8d\n",
+ total_pos-white_pos-black_pos);
+ }
+}
+
+
+
+// end of book_make.cpp
+
-\r
-// book_make.h\r
-\r
-#ifndef BOOK_MAKE_H\r
-#define BOOK_MAKE_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-extern void book_make (int argc, char * argv[]);\r
-extern void book_dump (int argc, char * argv[]);\r
-extern void book_info (int argc, char * argv[]);\r
-\r
-#endif // !defined BOOK_MAKE_H\r
-\r
-// end of book_make.h\r
-\r
+
+// book_make.h
+
+#ifndef BOOK_MAKE_H
+#define BOOK_MAKE_H
+
+// includes
+
+#include "util.h"
+
+// functions
+
+extern void book_make (int argc, char * argv[]);
+extern void book_dump (int argc, char * argv[]);
+extern void book_info (int argc, char * argv[]);
+
+#endif // !defined BOOK_MAKE_H
+
+// end of book_make.h
+
-\r
-// book_merge.c\r
-\r
-// includes\r
-\r
-#include <errno.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "book_merge.h"\r
-#include "util.h"\r
-\r
-// types\r
-\r
-typedef struct {\r
- FILE * file;\r
- int size;\r
-} book_t;\r
-\r
-typedef struct {\r
- uint64 key;\r
- uint16 move;\r
- uint16 count;\r
- uint16 n;\r
- uint16 sum;\r
-} entry_t;\r
-\r
-// variables\r
-\r
-static book_t In1[1];\r
-static book_t In2[1];\r
-static book_t Out[1];\r
-\r
-// prototypes\r
-\r
-static void book_clear (book_t * book);\r
-\r
-static void book_open (book_t * book, const char file_name[], const char mode[]);\r
-static void book_close (book_t * book);\r
-\r
-static bool read_entry (book_t * book, entry_t * entry, int n);\r
-static void write_entry (book_t * book, const entry_t * entry);\r
-\r
-static uint64 read_integer (FILE * file, int size);\r
-static void write_integer (FILE * file, int size, uint64 n);\r
-\r
-// functions\r
-\r
-// book_merge()\r
-\r
-void book_merge(int argc, char * argv[]) {\r
-\r
- int i;\r
- const char * in_file_1;\r
- const char * in_file_2;\r
- const char * out_file;\r
- int i1, i2;\r
- bool b1, b2;\r
- entry_t e1[1], e2[1];\r
- int skip;\r
-\r
- in_file_1 = NULL;\r
- my_string_clear(&in_file_1);\r
-\r
- in_file_2 = NULL;\r
- my_string_clear(&in_file_2);\r
-\r
- out_file = NULL;\r
- my_string_set(&out_file,"out.bin");\r
-\r
- for (i = 1; i < argc; i++) {\r
-\r
- if (FALSE) {\r
-\r
- } else if (my_string_equal(argv[i],"merge-book")) {\r
-\r
- // skip\r
-\r
- } else if (my_string_equal(argv[i],"-in1")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("book_merge(): missing argument\n");\r
-\r
- my_string_set(&in_file_1,argv[i]);\r
-\r
- } else if (my_string_equal(argv[i],"-in2")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("book_merge(): missing argument\n");\r
-\r
- my_string_set(&in_file_2,argv[i]);\r
-\r
- } else if (my_string_equal(argv[i],"-out")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("book_merge(): missing argument\n");\r
-\r
- my_string_set(&out_file,argv[i]);\r
-\r
- } else {\r
-\r
- my_fatal("book_merge(): unknown option \"%s\"\n",argv[i]);\r
- }\r
- }\r
-\r
- book_clear(In1);\r
- book_clear(In2);\r
- book_clear(Out);\r
-\r
- book_open(In1,in_file_1,"rb");\r
- book_open(In2,in_file_2,"rb");\r
- book_open(Out,out_file,"wb");\r
-\r
- skip = 0;\r
-\r
- i1 = 0;\r
- i2 = 0;\r
-\r
- while (TRUE) {\r
-\r
- b1 = read_entry(In1,e1,i1);\r
- b2 = read_entry(In2,e2,i2);\r
-\r
- if (FALSE) {\r
-\r
- } else if (!b1 && !b2) {\r
-\r
- break;\r
-\r
- } else if (b1 && !b2) {\r
-\r
- write_entry(Out,e1);\r
- i1++;\r
-\r
- } else if (b2 && !b1) {\r
-\r
- write_entry(Out,e2);\r
- i2++;\r
-\r
- } else {\r
-\r
- ASSERT(b1);\r
- ASSERT(b2);\r
-\r
- if (FALSE) {\r
- } else if (e1->key < e2->key) {\r
- write_entry(Out,e1);\r
- i1++;\r
- } else if (e1->key > e2->key) {\r
- write_entry(Out,e2);\r
- i2++;\r
- } else {\r
- ASSERT(e1->key==e2->key);\r
- skip++;\r
- i2++;\r
- }\r
- }\r
- }\r
-\r
- book_close(In1);\r
- book_close(In2);\r
- book_close(Out);\r
-\r
- if (skip != 0) {\r
- printf("skipped %d entr%s.\n",skip,(skip>1)?"ies":"y");\r
- }\r
-\r
- printf("done!\n");\r
-}\r
-\r
-// book_clear()\r
-\r
-static void book_clear(book_t * book) {\r
-\r
- ASSERT(book!=NULL);\r
-\r
- book->file = NULL;\r
- book->size = 0;\r
-}\r
-\r
-// book_open()\r
-\r
-static void book_open(book_t * book, const char file_name[], const char mode[]) {\r
-\r
- ASSERT(book!=NULL);\r
- ASSERT(file_name!=NULL);\r
- ASSERT(mode!=NULL);\r
-\r
- book->file = fopen(file_name,mode);\r
- if (book->file == NULL) my_fatal("book_open(): can't open file \"%s\": %s\n",file_name,strerror(errno));\r
-\r
- if (fseek(book->file,0,SEEK_END) == -1) {\r
- my_fatal("book_open(): fseek(): %s\n",strerror(errno));\r
- }\r
-\r
- book->size = ftell(book->file) / 16;\r
-}\r
-\r
-// book_close()\r
-\r
-static void book_close(book_t * book) {\r
-\r
- ASSERT(book!=NULL);\r
-\r
- if (fclose(book->file) == EOF) {\r
- my_fatal("book_close(): fclose(): %s\n",strerror(errno));\r
- }\r
-}\r
-\r
-// read_entry()\r
-\r
-static bool read_entry(book_t * book, entry_t * entry, int n) {\r
-\r
- ASSERT(book!=NULL);\r
- ASSERT(entry!=NULL);\r
-\r
- if (n < 0 || n >= book->size) return FALSE;\r
-\r
- ASSERT(n>=0&&n<book->size);\r
-\r
- if (fseek(book->file,n*16,SEEK_SET) == -1) {\r
- my_fatal("read_entry(): fseek(): %s\n",strerror(errno));\r
- }\r
-\r
- entry->key = read_integer(book->file,8);\r
- entry->move = read_integer(book->file,2);\r
- entry->count = read_integer(book->file,2);\r
- entry->n = read_integer(book->file,2);\r
- entry->sum = read_integer(book->file,2);\r
-\r
- return TRUE;\r
-}\r
-\r
-// write_entry()\r
-\r
-static void write_entry(book_t * book, const entry_t * entry) {\r
-\r
- ASSERT(book!=NULL);\r
- ASSERT(entry!=NULL);\r
-\r
- write_integer(book->file,8,entry->key);\r
- write_integer(book->file,2,entry->move);\r
- write_integer(book->file,2,entry->count);\r
- write_integer(book->file,2,entry->n);\r
- write_integer(book->file,2,entry->sum);\r
-}\r
-\r
-// read_integer()\r
-\r
-static uint64 read_integer(FILE * file, int size) {\r
-\r
- uint64 n;\r
- int i;\r
- int b;\r
-\r
- ASSERT(file!=NULL);\r
- ASSERT(size>0&&size<=8);\r
-\r
- n = 0;\r
-\r
- for (i = 0; i < size; i++) {\r
-\r
- b = fgetc(file);\r
-\r
- if (b == EOF) {\r
- if (feof(file)) {\r
- my_fatal("read_integer(): fgetc(): EOF reached\n");\r
- } else { // error\r
- my_fatal("read_integer(): fgetc(): %s\n",strerror(errno));\r
- }\r
- }\r
-\r
- ASSERT(b>=0&&b<256);\r
- n = (n << 8) | b;\r
- }\r
-\r
- return n;\r
-}\r
-\r
-// write_integer()\r
-\r
-static void write_integer(FILE * file, int size, uint64 n) {\r
-\r
- int i;\r
- int b;\r
-\r
- ASSERT(file!=NULL);\r
- ASSERT(size>0&&size<=8);\r
- ASSERT(size==8||n>>(size*8)==0);\r
-\r
- for (i = size-1; i >= 0; i--) {\r
-\r
- b = (n >> (i*8)) & 0xFF;\r
- ASSERT(b>=0&&b<256);\r
-\r
- if (fputc(b,file) == EOF) {\r
- my_fatal("write_integer(): fputc(): %s\n",strerror(errno));\r
- }\r
- }\r
-}\r
-\r
-// end of book_merge.cpp\r
-\r
+
+// book_merge.c
+
+// includes
+
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "book_merge.h"
+#include "util.h"
+
+// types
+
+typedef struct {
+ FILE * file;
+ int size;
+} book_t;
+
+typedef struct {
+ uint64 key;
+ uint16 move;
+ uint16 count;
+ uint16 n;
+ uint16 sum;
+} entry_t;
+
+// variables
+
+static book_t In1[1];
+static book_t In2[1];
+static book_t Out[1];
+
+// prototypes
+
+static void book_clear (book_t * book);
+
+static void book_open (book_t * book, const char file_name[], const char mode[]);
+static void book_close (book_t * book);
+
+static bool read_entry (book_t * book, entry_t * entry, int n);
+static void write_entry (book_t * book, const entry_t * entry);
+
+static uint64 read_integer (FILE * file, int size);
+static void write_integer (FILE * file, int size, uint64 n);
+
+// functions
+
+// book_merge()
+
+void book_merge(int argc, char * argv[]) {
+
+ int i;
+ const char * in_file_1;
+ const char * in_file_2;
+ const char * out_file;
+ int i1, i2;
+ bool b1, b2;
+ entry_t e1[1], e2[1];
+ int skip;
+
+ in_file_1 = NULL;
+ my_string_clear(&in_file_1);
+
+ in_file_2 = NULL;
+ my_string_clear(&in_file_2);
+
+ out_file = NULL;
+ my_string_set(&out_file,"out.bin");
+
+ for (i = 1; i < argc; i++) {
+
+ if (FALSE) {
+
+ } else if (my_string_equal(argv[i],"merge-book")) {
+
+ // skip
+
+ } else if (my_string_equal(argv[i],"-in1")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("book_merge(): missing argument\n");
+
+ my_string_set(&in_file_1,argv[i]);
+
+ } else if (my_string_equal(argv[i],"-in2")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("book_merge(): missing argument\n");
+
+ my_string_set(&in_file_2,argv[i]);
+
+ } else if (my_string_equal(argv[i],"-out")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("book_merge(): missing argument\n");
+
+ my_string_set(&out_file,argv[i]);
+
+ } else {
+
+ my_fatal("book_merge(): unknown option \"%s\"\n",argv[i]);
+ }
+ }
+
+ book_clear(In1);
+ book_clear(In2);
+ book_clear(Out);
+
+ book_open(In1,in_file_1,"rb");
+ book_open(In2,in_file_2,"rb");
+ book_open(Out,out_file,"wb");
+
+ skip = 0;
+
+ i1 = 0;
+ i2 = 0;
+
+ while (TRUE) {
+
+ b1 = read_entry(In1,e1,i1);
+ b2 = read_entry(In2,e2,i2);
+
+ if (FALSE) {
+
+ } else if (!b1 && !b2) {
+
+ break;
+
+ } else if (b1 && !b2) {
+
+ write_entry(Out,e1);
+ i1++;
+
+ } else if (b2 && !b1) {
+
+ write_entry(Out,e2);
+ i2++;
+
+ } else {
+
+ ASSERT(b1);
+ ASSERT(b2);
+
+ if (FALSE) {
+ } else if (e1->key < e2->key) {
+ write_entry(Out,e1);
+ i1++;
+ } else if (e1->key > e2->key) {
+ write_entry(Out,e2);
+ i2++;
+ } else {
+ ASSERT(e1->key==e2->key);
+ skip++;
+ i2++;
+ }
+ }
+ }
+
+ book_close(In1);
+ book_close(In2);
+ book_close(Out);
+
+ if (skip != 0) {
+ printf("skipped %d entr%s.\n",skip,(skip>1)?"ies":"y");
+ }
+
+ printf("done!\n");
+}
+
+// book_clear()
+
+static void book_clear(book_t * book) {
+
+ ASSERT(book!=NULL);
+
+ book->file = NULL;
+ book->size = 0;
+}
+
+// book_open()
+
+static void book_open(book_t * book, const char file_name[], const char mode[]) {
+
+ ASSERT(book!=NULL);
+ ASSERT(file_name!=NULL);
+ ASSERT(mode!=NULL);
+
+ book->file = fopen(file_name,mode);
+ if (book->file == NULL) my_fatal("book_open(): can't open file \"%s\": %s\n",file_name,strerror(errno));
+
+ if (fseek(book->file,0,SEEK_END) == -1) {
+ my_fatal("book_open(): fseek(): %s\n",strerror(errno));
+ }
+
+ book->size = ftell(book->file) / 16;
+}
+
+// book_close()
+
+static void book_close(book_t * book) {
+
+ ASSERT(book!=NULL);
+
+ if (fclose(book->file) == EOF) {
+ my_fatal("book_close(): fclose(): %s\n",strerror(errno));
+ }
+}
+
+// read_entry()
+
+static bool read_entry(book_t * book, entry_t * entry, int n) {
+
+ ASSERT(book!=NULL);
+ ASSERT(entry!=NULL);
+
+ if (n < 0 || n >= book->size) return FALSE;
+
+ ASSERT(n>=0&&n<book->size);
+
+ if (fseek(book->file,n*16,SEEK_SET) == -1) {
+ my_fatal("read_entry(): fseek(): %s\n",strerror(errno));
+ }
+
+ entry->key = read_integer(book->file,8);
+ entry->move = read_integer(book->file,2);
+ entry->count = read_integer(book->file,2);
+ entry->n = read_integer(book->file,2);
+ entry->sum = read_integer(book->file,2);
+
+ return TRUE;
+}
+
+// write_entry()
+
+static void write_entry(book_t * book, const entry_t * entry) {
+
+ ASSERT(book!=NULL);
+ ASSERT(entry!=NULL);
+
+ write_integer(book->file,8,entry->key);
+ write_integer(book->file,2,entry->move);
+ write_integer(book->file,2,entry->count);
+ write_integer(book->file,2,entry->n);
+ write_integer(book->file,2,entry->sum);
+}
+
+// read_integer()
+
+static uint64 read_integer(FILE * file, int size) {
+
+ uint64 n;
+ int i;
+ int b;
+
+ ASSERT(file!=NULL);
+ ASSERT(size>0&&size<=8);
+
+ n = 0;
+
+ for (i = 0; i < size; i++) {
+
+ b = fgetc(file);
+
+ if (b == EOF) {
+ if (feof(file)) {
+ my_fatal("read_integer(): fgetc(): EOF reached\n");
+ } else { // error
+ my_fatal("read_integer(): fgetc(): %s\n",strerror(errno));
+ }
+ }
+
+ ASSERT(b>=0&&b<256);
+ n = (n << 8) | b;
+ }
+
+ return n;
+}
+
+// write_integer()
+
+static void write_integer(FILE * file, int size, uint64 n) {
+
+ int i;
+ int b;
+
+ ASSERT(file!=NULL);
+ ASSERT(size>0&&size<=8);
+ ASSERT(size==8||n>>(size*8)==0);
+
+ for (i = size-1; i >= 0; i--) {
+
+ b = (n >> (i*8)) & 0xFF;
+ ASSERT(b>=0&&b<256);
+
+ if (fputc(b,file) == EOF) {
+ my_fatal("write_integer(): fputc(): %s\n",strerror(errno));
+ }
+ }
+}
+
+// end of book_merge.cpp
+
-\r
-// book_merge.h\r
-\r
-#ifndef BOOK_MERGE_H\r
-#define BOOK_MERGE_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-extern void book_merge (int argc, char * argv[]);\r
-\r
-#endif // !defined BOOK_MERGE_H\r
-\r
-// end of book_merge.h\r
-\r
+
+// book_merge.h
+
+#ifndef BOOK_MERGE_H
+#define BOOK_MERGE_H
+
+// includes
+
+#include "util.h"
+
+// functions
+
+extern void book_merge (int argc, char * argv[]);
+
+#endif // !defined BOOK_MERGE_H
+
+// end of book_merge.h
+
-\r
-// colour.c\r
-\r
-// includes\r
-\r
-#include "colour.h"\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-// colour_is_ok()\r
-\r
-bool colour_is_ok(int colour) {\r
-\r
- return colour == Black || colour == White;\r
-}\r
-\r
-// colour_is_white()\r
-\r
-bool colour_is_white(int colour) {\r
-\r
- ASSERT(colour_is_ok(colour));\r
-\r
- return colour == White;\r
-}\r
-\r
-// colour_is_black()\r
-\r
-bool colour_is_black(int colour) {\r
-\r
- ASSERT(colour_is_ok(colour));\r
-\r
- return colour == Black;\r
-}\r
-\r
-// colour_equal()\r
-\r
-bool colour_equal(int colour_1, int colour_2) {\r
-\r
- ASSERT(colour_is_ok(colour_2));\r
-\r
- return (colour_1 & colour_2) != 0;\r
-}\r
-\r
-// colour_opp()\r
-\r
-int colour_opp(int colour) {\r
-\r
- ASSERT(colour_is_ok(colour));\r
-\r
- return colour ^ (BlackFlag^WhiteFlag);\r
-}\r
-\r
-// end of colour.cpp\r
-\r
+
+// colour.c
+
+// includes
+
+#include "colour.h"
+#include "util.h"
+
+// functions
+
+// colour_is_ok()
+
+bool colour_is_ok(int colour) {
+
+ return colour == Black || colour == White;
+}
+
+// colour_is_white()
+
+bool colour_is_white(int colour) {
+
+ ASSERT(colour_is_ok(colour));
+
+ return colour == White;
+}
+
+// colour_is_black()
+
+bool colour_is_black(int colour) {
+
+ ASSERT(colour_is_ok(colour));
+
+ return colour == Black;
+}
+
+// colour_equal()
+
+bool colour_equal(int colour_1, int colour_2) {
+
+ ASSERT(colour_is_ok(colour_2));
+
+ return (colour_1 & colour_2) != 0;
+}
+
+// colour_opp()
+
+int colour_opp(int colour) {
+
+ ASSERT(colour_is_ok(colour));
+
+ return colour ^ (BlackFlag^WhiteFlag);
+}
+
+// end of colour.cpp
+
-\r
-// colour.h\r
-\r
-#ifndef COLOUR_H\r
-#define COLOUR_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define BlackFlag (1 << 0)\r
-#define WhiteFlag (1 << 1)\r
-#define ColourNone 0\r
-#define Black BlackFlag\r
-#define White WhiteFlag\r
-#define ColourNb 3\r
-\r
-// functions\r
-\r
-extern bool colour_is_ok (int colour);\r
-\r
-extern bool colour_is_white (int colour);\r
-extern bool colour_is_black (int colour);\r
-extern bool colour_equal (int colour_1, int colour_2);\r
-\r
-extern int colour_opp (int colour);\r
-\r
-#endif // !defined COLOUR_H\r
-\r
-// end of colour.h\r
-\r
+
+// colour.h
+
+#ifndef COLOUR_H
+#define COLOUR_H
+
+// includes
+
+#include "util.h"
+
+// defines
+
+#define BlackFlag (1 << 0)
+#define WhiteFlag (1 << 1)
+#define ColourNone 0
+#define Black BlackFlag
+#define White WhiteFlag
+#define ColourNb 3
+
+// functions
+
+extern bool colour_is_ok (int colour);
+
+extern bool colour_is_white (int colour);
+extern bool colour_is_black (int colour);
+extern bool colour_equal (int colour_1, int colour_2);
+
+extern int colour_opp (int colour);
+
+#endif // !defined COLOUR_H
+
+// end of colour.h
+
#define PACKAGE_NAME "polyglot"
/* Define to the full name and version of this package. */
-#define PACKAGE_STRING "polyglot 1.4.61b"
+#define PACKAGE_STRING "polyglot 1.4.63b"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "polyglot"
#define PACKAGE_URL ""
/* Define to the version of this package. */
-#define PACKAGE_VERSION "1.4.61b"
+#define PACKAGE_VERSION "1.4.63b"
/* Define as the return type of signal handlers (`int' or `void'). */
#define RETSIGTYPE void
#define TIME_WITH_SYS_TIME 1
/* Version number of package */
-#define VERSION "1.4.61b"
+#define VERSION "1.4.63b"
/* Define to empty if `const' does not conform to ANSI C. */
/* #undef const */
#! /bin/sh
# Guess values for system-dependent variables and create Makefiles.
-# Generated by GNU Autoconf 2.64 for polyglot 1.4.61b.
+# Generated by GNU Autoconf 2.64 for polyglot 1.4.63b.
#
# Report bugs to <michel.vandenbergh@uhasselt.be>.
#
# Identity of this package.
PACKAGE_NAME='polyglot'
PACKAGE_TARNAME='polyglot'
-PACKAGE_VERSION='1.4.61b'
-PACKAGE_STRING='polyglot 1.4.61b'
+PACKAGE_VERSION='1.4.63b'
+PACKAGE_STRING='polyglot 1.4.63b'
PACKAGE_BUGREPORT='michel.vandenbergh@uhasselt.be'
PACKAGE_URL=''
# Omit some internal or obsolete options to make the list less imposing.
# This message is too long to be a string in the A/UX 3.1 sh.
cat <<_ACEOF
-\`configure' configures polyglot 1.4.61b to adapt to many kinds of systems.
+\`configure' configures polyglot 1.4.63b to adapt to many kinds of systems.
Usage: $0 [OPTION]... [VAR=VALUE]...
if test -n "$ac_init_help"; then
case $ac_init_help in
- short | recursive ) echo "Configuration of polyglot 1.4.61b:";;
+ short | recursive ) echo "Configuration of polyglot 1.4.63b:";;
esac
cat <<\_ACEOF
test -n "$ac_init_help" && exit $ac_status
if $ac_init_version; then
cat <<\_ACEOF
-polyglot configure 1.4.61b
+polyglot configure 1.4.63b
generated by GNU Autoconf 2.64
Copyright (C) 2009 Free Software Foundation, Inc.
This file contains any messages produced by compilers while
running configure, to aid debugging if configure makes a mistake.
-It was created by polyglot $as_me 1.4.61b, which was
+It was created by polyglot $as_me 1.4.63b, which was
generated by GNU Autoconf 2.64. Invocation command line was
$ $0 $@
# Define the identity of the package.
PACKAGE='polyglot'
- VERSION='1.4.61b'
+ VERSION='1.4.63b'
cat >>confdefs.h <<_ACEOF
# report actual input values of CONFIG_FILES etc. instead of their
# values after options handling.
ac_log="
-This file was extended by polyglot $as_me 1.4.61b, which was
+This file was extended by polyglot $as_me 1.4.63b, which was
generated by GNU Autoconf 2.64. Invocation command line was
CONFIG_FILES = $CONFIG_FILES
_ACEOF
cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
ac_cs_version="\\
-polyglot config.status 1.4.61b
+polyglot config.status 1.4.63b
configured by $0, generated by GNU Autoconf 2.64,
with options \\"`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`\\"
# Process this file with autoconf to produce a configure script.
AC_PREREQ(2.61)
-AC_INIT([polyglot], [1.4.61b], [michel.vandenbergh@uhasselt.be])
+AC_INIT([polyglot], [1.4.63b], [michel.vandenbergh@uhasselt.be])
AM_INIT_AUTOMAKE
AC_CONFIG_SRCDIR([mainloop.c])
AC_CONFIG_HEADER([config.h])
-// engine.c\r
-\r
-// includes\r
-\r
-#include <stdlib.h>\r
-#include <stdarg.h>\r
-#include <string.h>\r
-#include <errno.h>\r
-\r
-#include "engine.h"\r
-#include "option.h"\r
-#include "pipex.h"\r
-#include "util.h"\r
-\r
-// variables\r
-\r
-engine_t Engine[1];\r
-#define StringSize ((int)4096)\r
-\r
-// functions\r
-\r
-// set_affinity()\r
-\r
-void set_affinity(engine_t *engine, int value){\r
- pipex_set_affinity(engine->pipex,value);\r
-}\r
-\r
-// engine_set_nice_value()\r
-\r
-void engine_set_nice_value(engine_t *engine, int value){\r
- pipex_set_priority(engine->pipex,value);\r
-}\r
-\r
-// engine_send_queue()\r
-\r
-void engine_send_queue(engine_t * engine, const char *format, ...) {\r
- char buf[FormatBufferSize];\r
- CONSTRUCT_ARG_STRING(format,buf);\r
- pipex_write(engine->pipex,buf);\r
-}\r
-\r
-// engine_send()\r
-\r
-void engine_send(engine_t * engine, const char *format, ...) {\r
- char buf[FormatBufferSize];\r
- CONSTRUCT_ARG_STRING(format,buf);\r
- pipex_writeln(engine->pipex,buf);\r
-}\r
-\r
-// engine_close()\r
-\r
-void engine_close(engine_t * engine){\r
- char string[StringSize];\r
- int elapsed_time;\r
- int ret;\r
- int close_timeout=500;\r
- my_log("POLYGLOT Closing engine.\n");\r
- pipex_send_eof(engine->pipex);\r
- // TODO: Timeout\r
-\r
- elapsed_time=0;\r
- while (!engine_eof(engine) && (elapsed_time<close_timeout)) { \r
- ret=engine_get_non_blocking(engine,string);\r
- if(!ret && !engine_eof(engine)){\r
- my_log("POLYGLOT Engine does not reply. Sleeping %dms.\n", WAIT_GRANULARITY);\r
- my_sleep(WAIT_GRANULARITY);\r
- elapsed_time+=WAIT_GRANULARITY;\r
- }\r
- }\r
- if(elapsed_time>=close_timeout){\r
- my_log("POLYGLOT Waited more than %dms. Moving on.\n",close_timeout); \r
- }\r
- pipex_exit(engine->pipex,200);\r
-}\r
-\r
-// engine_open()\r
-\r
-void engine_open(engine_t * engine){\r
- int affinity;\r
- pipex_open(engine->pipex,\r
- "Engine",\r
- option_get_string(Option,"EngineDir"),\r
- option_get_string(Option,"EngineCommand"));\r
- if(pipex_active(engine->pipex)){\r
- //play with affinity (bad idea)\r
- affinity=option_get_int(Option,"Affinity");\r
- if(affinity!=-1) set_affinity(engine,affinity); //AAA\r
- // set a low priority\r
- if (option_get_bool(Option,"UseNice")){\r
- my_log("POLYGLOT Adjust Engine Piority\n");\r
- engine_set_nice_value(engine, option_get_int(Option,"NiceValue"));\r
- }\r
- }\r
- \r
-}\r
-\r
-bool engine_active(engine_t *engine){\r
- return pipex_active(engine->pipex);\r
-}\r
-\r
-bool engine_eof(engine_t *engine){\r
- return pipex_eof(engine->pipex);\r
-}\r
-\r
-bool engine_get_non_blocking(engine_t * engine, char *string){\r
- return pipex_readln_nb(engine->pipex,string);\r
- }\r
-\r
-void engine_get(engine_t * engine, char *string){\r
- pipex_readln(engine->pipex,string);\r
-}\r
-\r
-\r
+// engine.c
+
+// includes
+
+#include <stdlib.h>
+#include <stdarg.h>
+#include <string.h>
+#include <errno.h>
+
+#include "engine.h"
+#include "option.h"
+#include "pipex.h"
+#include "util.h"
+
+// variables
+
+engine_t Engine[1];
+
+// functions
+
+// set_affinity()
+
+void set_affinity(engine_t *engine, int value){
+ pipex_set_affinity(engine->pipex,value);
+}
+
+// engine_set_nice_value()
+
+void engine_set_nice_value(engine_t *engine, int value){
+ pipex_set_priority(engine->pipex,value);
+}
+
+// engine_send_queue()
+
+void engine_send_queue(engine_t * engine, const char *format, ...) {
+ char buf[FormatBufferSize];
+ CONSTRUCT_ARG_STRING(format,buf);
+ pipex_write(engine->pipex,buf);
+}
+
+// engine_send()
+
+void engine_send(engine_t * engine, const char *format, ...) {
+ char buf[FormatBufferSize];
+ CONSTRUCT_ARG_STRING(format,buf);
+ pipex_writeln(engine->pipex,buf);
+}
+
+// engine_close()
+
+void engine_close(engine_t * engine){
+ char string[StringSize];
+ int elapsed_time;
+ int ret;
+ int close_timeout=500;
+ my_log("POLYGLOT Closing engine.\n");
+ pipex_send_eof(engine->pipex);
+ // TODO: Timeout
+
+ elapsed_time=0;
+ while (!engine_eof(engine) && (elapsed_time<close_timeout)) {
+ ret=engine_get_non_blocking(engine,string);
+ if(!ret && !engine_eof(engine)){
+ my_log("POLYGLOT Engine does not reply. Sleeping %dms.\n", WAIT_GRANULARITY);
+ my_sleep(WAIT_GRANULARITY);
+ elapsed_time+=WAIT_GRANULARITY;
+ }
+ }
+ if(elapsed_time>=close_timeout){
+ my_log("POLYGLOT Waited more than %dms. Moving on.\n",close_timeout);
+ }
+ pipex_exit(engine->pipex,200);
+}
+
+// engine_open()
+
+void engine_open(engine_t * engine){
+ int affinity;
+ pipex_open(engine->pipex,
+ "Engine",
+ option_get_string(Option,"EngineDir"),
+ option_get_string(Option,"EngineCommand"));
+ if(pipex_active(engine->pipex)){
+ //play with affinity (bad idea)
+ affinity=option_get_int(Option,"Affinity");
+ if(affinity!=-1) set_affinity(engine,affinity); //AAA
+ // set a low priority
+ if (option_get_bool(Option,"UseNice")){
+ my_log("POLYGLOT Adjust Engine Piority\n");
+ engine_set_nice_value(engine, option_get_int(Option,"NiceValue"));
+ }
+ }
+
+}
+
+bool engine_active(engine_t *engine){
+ return pipex_active(engine->pipex);
+}
+
+bool engine_eof(engine_t *engine){
+ return pipex_eof(engine->pipex);
+}
+
+bool engine_get_non_blocking(engine_t * engine, char *string){
+ return pipex_readln_nb(engine->pipex,string);
+ }
+
+void engine_get(engine_t * engine, char *string){
+ pipex_readln(engine->pipex,string);
+}
+
+
-// engine.h\r
-\r
-#ifndef ENGINE_H\r
-#define ENGINE_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-#include "pipex.h"\r
-\r
-// types\r
-\r
-typedef struct {\r
- pipex_t pipex[1];\r
-} engine_t;\r
-\r
-\r
-\r
-// variables\r
-\r
-extern engine_t Engine[1];\r
-\r
-// functions\r
-\r
-extern bool engine_is_ok (const engine_t * engine);\r
-extern void engine_open (engine_t * engine);\r
-extern void engine_close (engine_t * engine);\r
-extern bool engine_active (engine_t * engine);\r
-extern bool engine_eof (engine_t * engine);\r
-extern void engine_send (engine_t * engine, const char format[], ...);\r
-extern void engine_send_queue (engine_t * engine, const char format[], ...);\r
-extern bool engine_get_non_blocking(engine_t * engine, char string[]);\r
-extern void engine_get (engine_t * engine, char string[]);\r
-extern void engine_set_nice_value(engine_t * engine, int value);\r
-\r
-#endif // !defined ENGINE_H\r
+// engine.h
+
+#ifndef ENGINE_H
+#define ENGINE_H
+
+// includes
+
+#include "util.h"
+#include "pipex.h"
+
+// types
+
+typedef struct {
+ pipex_t pipex[1];
+} engine_t;
+
+
+
+// variables
+
+extern engine_t Engine[1];
+
+// functions
+
+extern bool engine_is_ok (const engine_t * engine);
+extern void engine_open (engine_t * engine);
+extern void engine_close (engine_t * engine);
+extern bool engine_active (engine_t * engine);
+extern bool engine_eof (engine_t * engine);
+extern void engine_send (engine_t * engine, const char format[], ...);
+extern void engine_send_queue (engine_t * engine, const char format[], ...);
+extern bool engine_get_non_blocking(engine_t * engine, char string[]);
+extern void engine_get (engine_t * engine, char string[]);
+extern void engine_set_nice_value(engine_t * engine, int value);
+
+#endif // !defined ENGINE_H
-\r
-// epd.c\r
-\r
-// includes\r
-\r
-#include <errno.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "board.h"\r
-#include "engine.h"\r
-#include "epd.h"\r
-#include "fen.h"\r
-#include "line.h"\r
-#include "main.h"\r
-#include "move.h"\r
-#include "move_legal.h"\r
-#include "option.h"\r
-#include "parse.h"\r
-#include "san.h"\r
-#include "uci.h"\r
-#include "util.h"\r
-\r
-\r
-// macros\r
-\r
-#define StringSize 4096\r
-\r
-// constants\r
-\r
-static const bool UseDebug = FALSE;\r
-static const bool UseTrace = FALSE;\r
-\r
-// variables\r
-\r
-static int MinDepth;\r
-static int MaxDepth;\r
-\r
-static double MaxTime;\r
-static double MinTime;\r
-\r
-static int DepthDelta;\r
-\r
-static int FirstMove;\r
-static int FirstDepth;\r
-static int FirstSelDepth;\r
-static int FirstScore;\r
-static double FirstTime;\r
-static uint64 FirstNodeNb;\r
-static move_t FirstPV[LineSize];\r
-\r
-static int LastMove;\r
-static int LastDepth;\r
-static int LastSelDepth;\r
-static int LastScore;\r
-static double LastTime;\r
-static uint64 LastNodeNb;\r
-static move_t LastPV[LineSize];\r
-\r
-static my_timer_t Timer[1];\r
-\r
-// prototypes\r
-\r
-static void epd_test_file (const char file_name[]);\r
-\r
-static bool is_solution (int move, const board_t * board, const char bm[], const char am[]);\r
-static bool string_contain (const char string[], const char substring[]);\r
-\r
-static bool engine_step ();\r
-\r
-// functions\r
-\r
-// epd_test()\r
-\r
-void epd_test(int argc, char * argv[]) {\r
-\r
- int i;\r
- const char * epd_file;\r
-\r
- epd_file = NULL;\r
- my_string_set(&epd_file,"wac.epd");\r
-\r
- MinDepth = 8;\r
- MaxDepth = 63;\r
-\r
- MinTime = 1.0;\r
- MaxTime = 5.0;\r
-\r
- DepthDelta = 3;\r
-\r
- for (i = 1; i < argc; i++) {\r
-\r
- if (FALSE) {\r
-\r
- } else if (my_string_equal(argv[i],"epd-test")) {\r
-\r
- // skip\r
-\r
- } else if (my_string_equal(argv[i],"-epd")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");\r
-\r
- my_string_set(&epd_file,argv[i]);\r
-\r
- } else if (my_string_equal(argv[i],"-min-depth")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");\r
-\r
- MinDepth = atoi(argv[i]);\r
-\r
- } else if (my_string_equal(argv[i],"-max-depth")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");\r
-\r
- MaxDepth = atoi(argv[i]);\r
-\r
- } else if (my_string_equal(argv[i],"-min-time")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");\r
-\r
- MinTime = atof(argv[i]);\r
-\r
- } else if (my_string_equal(argv[i],"-max-time")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");\r
-\r
- MaxTime = atof(argv[i]);\r
-\r
- } else if (my_string_equal(argv[i],"-depth-delta")) {\r
-\r
- i++;\r
- if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");\r
-\r
- DepthDelta = atoi(argv[i]);\r
-\r
- } else {\r
-\r
- my_fatal("epd_test(): unknown option \"%s\"\n",argv[i]);\r
- }\r
- }\r
-\r
- if(MinTime>MaxTime){\r
- MaxTime=MinTime;\r
- }\r
- \r
- epd_test_file(epd_file);\r
-}\r
-\r
-// epd_test_file()\r
-\r
-static void epd_test_file(const char file_name[]) {\r
-\r
- FILE * file;\r
- int hit, tot;\r
- char epd[StringSize];\r
- char am[StringSize], bm[StringSize], id[StringSize];\r
- board_t board[1];\r
- char string[StringSize];\r
- int move;\r
- char pv_string[StringSize];\r
- bool correct;\r
- double depth_tot, time_tot, node_tot;\r
- int line=0;\r
-\r
- ASSERT(file_name!=NULL);\r
-\r
- // init\r
-\r
- file = fopen(file_name,"r");\r
- if (file == NULL) my_fatal("epd_test_file(): can't open file \"%s\": %s\n",file_name,strerror(errno));\r
-\r
- hit = 0;\r
- tot = 0;\r
-\r
- depth_tot = 0.0;\r
- time_tot = 0.0;\r
- node_tot = 0.0;\r
-\r
- printf("\nEngineName=%s\n",option_get_string(Option,"EngineName"));\r
-\r
- printf("\n[Search parameters: MaxDepth=%d MaxTime=%.1f DepthDelta=%d MinDepth=%d MinTime=%.1f]\n\n",MaxDepth,MaxTime,DepthDelta,MinDepth,MinTime);\r
-\r
- // loop\r
-\r
- while (my_file_read_line(file,epd,StringSize)) {\r
- line++;\r
- if(my_string_whitespace(epd)) continue;\r
- if (UseTrace) printf("%s\n",epd);\r
-\r
- if (!epd_get_op(epd,"am",am,StringSize)) strcpy(am,"");\r
- if (!epd_get_op(epd,"bm",bm,StringSize)) strcpy(bm,"");\r
- if (!epd_get_op(epd,"id",id,StringSize)) strcpy(id,"");\r
-\r
- if (my_string_empty(am) && my_string_empty(bm)) {\r
- my_fatal("epd_test(): no am or bm field at line %d\n",line);\r
- }\r
-\r
- // init\r
-\r
- uci_send_ucinewgame(Uci);\r
- uci_send_isready_sync(Uci);\r
-\r
- ASSERT(!Uci->searching);\r
-\r
- // position\r
- if (!board_from_fen(board,epd)) ASSERT(FALSE);\r
- if (!board_to_fen(board,string,StringSize)) ASSERT(FALSE);\r
-\r
- engine_send(Engine,"position fen %s",string);\r
-\r
- // search\r
-\r
- my_timer_start(Timer); // also resets\r
- \r
- // which ones of the next two alternatives is best?\r
- engine_send(Engine,"go movetime %.0f depth %d",MaxTime*1000.0,MaxDepth);\r
- //engine_send(Engine,"go infinite");\r
-\r
- // engine data\r
-\r
- board_copy(Uci->board,board);\r
-\r
- uci_clear(Uci);\r
- Uci->searching = TRUE;\r
- Uci->pending_nb++;\r
-\r
- FirstMove = MoveNone;\r
- FirstDepth = 0;\r
- FirstSelDepth = 0;\r
- FirstScore = 0;\r
- FirstTime = 0.0;\r
- FirstNodeNb = 0;\r
- line_clear(FirstPV);\r
-\r
- LastMove = MoveNone;\r
- LastDepth = 0;\r
- LastSelDepth = 0;\r
- LastScore = 0;\r
- LastTime = 0.0;\r
- LastNodeNb = 0;\r
- line_clear(LastPV);\r
-\r
- // parse engine output\r
-\r
- while (!engine_eof(Engine) && engine_step()) {\r
- bool stop=FALSE;\r
-\r
- // stop search?\r
-// printf("Uci->time=%.2f time=%.2f\n",Uci->time,my_timer_elapsed_real(Timer));\r
- if (Uci->depth > MaxDepth){\r
- my_log("POLYGLOT Maximum depth %d reached\n",MaxDepth);\r
- stop=TRUE;\r
- }else if(my_timer_elapsed_real(Timer) >= MaxTime){\r
- my_log("POLYGLOT Maximum search time %.2fs reached\n",MaxTime);\r
- stop=TRUE;\r
- }else if(Uci->depth - FirstDepth >= DepthDelta){\r
- if(Uci->depth > MinDepth){\r
- if(Uci->time >= MinTime){\r
- if(is_solution(FirstMove,board,bm,am)){\r
- my_log("POLYGLOT Solution found\n",MaxTime);\r
- stop=TRUE;\r
- }\r
- }\r
- }\r
- }\r
- if(stop){\r
- my_log("POLYGLOT Stopping engine\n");\r
- engine_send(Engine,"stop");\r
- break;\r
- }\r
- }\r
- \r
- move = FirstMove;\r
- correct = is_solution(move,board,bm,am);\r
-\r
- if (correct) hit++;\r
- tot++;\r
-\r
- if (correct) {\r
- depth_tot += ((double)FirstDepth);\r
- time_tot += FirstTime;\r
- node_tot += ((double)((sint64)FirstNodeNb));\r
- }\r
-\r
- printf("%2d: %-15s %s %4d",tot,id,correct?"OK":"--",hit);\r
-\r
- if (!line_to_san(LastPV,Uci->board,pv_string,StringSize)) ASSERT(FALSE);\r
- printf(" score=%+6.2f pv [D=%2d, T=%7.2fs, N=%6dk] =%s\n",((double)LastScore)/100.0,FirstDepth,FirstTime,(int)FirstNodeNb/1000,pv_string);\r
- }\r
-\r
- printf("\nscore=%d/%d",hit,tot);\r
-\r
- if (hit != 0) {\r
-\r
- depth_tot /= ((double)hit);\r
- time_tot /= ((double)hit);\r
- node_tot /= ((double)hit);\r
-\r
- printf(" [averages on correct positions: depth=%.1f time=%.2f nodes=%.0f]",depth_tot,time_tot,node_tot);\r
- }\r
-\r
- printf("\n");\r
-\r
- fclose(file);\r
- quit();\r
-}\r
-\r
-// is_solution()\r
-\r
-static bool is_solution(int move, const board_t * board, const char bm[], const char am[]) {\r
-\r
- char move_string[256];\r
- bool correct;\r
-\r
- ASSERT(move!=MoveNone);\r
- ASSERT(bm!=NULL);\r
- ASSERT(am!=NULL);\r
-\r
- if (!move_is_legal(move,board)) {\r
- board_disp(board);\r
- move_disp(move,board);\r
- printf("\n\n");\r
- }\r
-\r
- ASSERT(move_is_legal(move,board));\r
-\r
- if (!move_to_san(move,board,move_string,256)) ASSERT(FALSE);\r
-\r
- correct = FALSE;\r
- if (!my_string_empty(bm)) {\r
- correct = string_contain(bm,move_string);\r
- } else if (!my_string_empty(am)) {\r
- correct = !string_contain(am,move_string);\r
- } else {\r
- ASSERT(FALSE);\r
- }\r
-\r
- return correct;\r
-}\r
-\r
-// epd_get_op()\r
-\r
-bool epd_get_op(const char record[], const char opcode[], char string[], int size) {\r
-\r
- char op[256];\r
- int len;\r
- const char *p_start, *p_end;\r
-\r
- ASSERT(record!=NULL);\r
- ASSERT(opcode!=NULL);\r
- ASSERT(string!=NULL);\r
- ASSERT(size>0);\r
-\r
- // find the opcode\r
-\r
- sprintf(op," %s ",opcode); \r
-\r
- p_start = strstr(record,op);\r
- if (p_start == NULL){\r
- sprintf(op,";%s ",opcode); \r
- p_start = strstr(record,op);\r
- if (p_start == NULL){\r
- return FALSE;\r
- }\r
- }\r
-\r
- // skip the opcode\r
-\r
- p_start += strlen(op);\r
-\r
- // find the end\r
- p_end = strchr(p_start,';');\r
- if (p_end == NULL) return FALSE;\r
-\r
- // calculate the length\r
-\r
- len = p_end - p_start;\r
- if (size < len+1) my_fatal("epd_get_op(): size < len+1\n");\r
-\r
- strncpy(string,p_start,len);\r
- string[len] = '\0';\r
-\r
- return TRUE;\r
-}\r
-\r
-// string_contain()\r
-\r
-static bool string_contain(const char string[], const char substring[]) {\r
-\r
- char new_string[StringSize], *p;\r
-\r
- strcpy(new_string,string); // HACK\r
-\r
- for (p = strtok(new_string," "); p != NULL; p = strtok(NULL," ")) {\r
- if (my_string_equal(p,substring)) return TRUE;\r
- }\r
-\r
- return FALSE;\r
-}\r
-\r
-// engine_step()\r
-\r
-static bool engine_step() {\r
-\r
- char string[StringSize];\r
- int event;\r
-\r
- engine_get(Engine,string);\r
- event = uci_parse(Uci,string);\r
-\r
- if ((event & EVENT_MOVE) != 0) {\r
-\r
- return FALSE;\r
- }\r
-\r
- if ((event & EVENT_PV) != 0) {\r
-\r
- LastMove = Uci->best_pv[0];\r
- LastDepth = Uci->best_depth;\r
- LastSelDepth = Uci->best_sel_depth;\r
- LastScore = Uci->best_score;\r
- LastTime = Uci->time;\r
- LastNodeNb = Uci->node_nb;\r
- line_copy(LastPV,Uci->best_pv);\r
-\r
- if (LastMove != FirstMove) {\r
- FirstMove = LastMove;\r
- FirstDepth = LastDepth;\r
- FirstSelDepth = LastSelDepth;\r
- FirstScore = LastScore;\r
- FirstTime = LastTime;\r
- FirstNodeNb = LastNodeNb;\r
- line_copy(FirstPV,LastPV);\r
- }\r
- }\r
-\r
- return TRUE;\r
-}\r
-\r
-// end of epd.cpp\r
-\r
+
+// epd.c
+
+// includes
+
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "board.h"
+#include "engine.h"
+#include "epd.h"
+#include "fen.h"
+#include "line.h"
+#include "main.h"
+#include "move.h"
+#include "move_legal.h"
+#include "option.h"
+#include "parse.h"
+#include "san.h"
+#include "uci.h"
+#include "util.h"
+
+
+// macros
+
+#define StringSize 4096
+
+// constants
+
+static const bool UseDebug = FALSE;
+static const bool UseTrace = FALSE;
+
+// variables
+
+static int MinDepth;
+static int MaxDepth;
+
+static double MaxTime;
+static double MinTime;
+
+static int DepthDelta;
+
+static int FirstMove;
+static int FirstDepth;
+static int FirstSelDepth;
+static int FirstScore;
+static double FirstTime;
+static uint64 FirstNodeNb;
+static move_t FirstPV[LineSize];
+
+static int LastMove;
+static int LastDepth;
+static int LastSelDepth;
+static int LastScore;
+static double LastTime;
+static uint64 LastNodeNb;
+static move_t LastPV[LineSize];
+
+static my_timer_t Timer[1];
+
+// prototypes
+
+static void epd_test_file (const char file_name[]);
+
+static bool is_solution (int move, const board_t * board, const char bm[], const char am[]);
+static bool string_contain (const char string[], const char substring[]);
+
+static bool engine_step ();
+
+// functions
+
+// epd_test()
+
+void epd_test(int argc, char * argv[]) {
+
+ int i;
+ const char * epd_file;
+
+ epd_file = NULL;
+ my_string_set(&epd_file,"wac.epd");
+
+ MinDepth = 8;
+ MaxDepth = 63;
+
+ MinTime = 1.0;
+ MaxTime = 5.0;
+
+ DepthDelta = 3;
+
+ for (i = 1; i < argc; i++) {
+
+ if (FALSE) {
+
+ } else if (my_string_equal(argv[i],"epd-test")) {
+
+ // skip
+
+ } else if (my_string_equal(argv[i],"-epd")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");
+
+ my_string_set(&epd_file,argv[i]);
+
+ } else if (my_string_equal(argv[i],"-min-depth")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");
+
+ MinDepth = atoi(argv[i]);
+
+ } else if (my_string_equal(argv[i],"-max-depth")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");
+
+ MaxDepth = atoi(argv[i]);
+
+ } else if (my_string_equal(argv[i],"-min-time")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");
+
+ MinTime = atof(argv[i]);
+
+ } else if (my_string_equal(argv[i],"-max-time")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");
+
+ MaxTime = atof(argv[i]);
+
+ } else if (my_string_equal(argv[i],"-depth-delta")) {
+
+ i++;
+ if (argv[i] == NULL) my_fatal("epd_test(): missing argument\n");
+
+ DepthDelta = atoi(argv[i]);
+
+ } else {
+
+ my_fatal("epd_test(): unknown option \"%s\"\n",argv[i]);
+ }
+ }
+
+ if(MinTime>MaxTime){
+ MaxTime=MinTime;
+ }
+
+ epd_test_file(epd_file);
+}
+
+// epd_test_file()
+
+static void epd_test_file(const char file_name[]) {
+
+ FILE * file;
+ int hit, tot;
+ char epd[StringSize];
+ char am[StringSize], bm[StringSize], id[StringSize];
+ board_t board[1];
+ char string[StringSize];
+ int move;
+ char pv_string[StringSize];
+ bool correct;
+ double depth_tot, time_tot, node_tot;
+ int line=0;
+
+ ASSERT(file_name!=NULL);
+
+ // init
+
+ file = fopen(file_name,"r");
+ if (file == NULL) my_fatal("epd_test_file(): can't open file \"%s\": %s\n",file_name,strerror(errno));
+
+ hit = 0;
+ tot = 0;
+
+ depth_tot = 0.0;
+ time_tot = 0.0;
+ node_tot = 0.0;
+
+ printf("\nEngineName=%s\n",option_get_string(Option,"EngineName"));
+
+ printf("\n[Search parameters: MaxDepth=%d MaxTime=%.1f DepthDelta=%d MinDepth=%d MinTime=%.1f]\n\n",MaxDepth,MaxTime,DepthDelta,MinDepth,MinTime);
+
+ // loop
+
+ while (my_file_read_line(file,epd,StringSize)) {
+ line++;
+ if(my_string_whitespace(epd)) continue;
+ if (UseTrace) printf("%s\n",epd);
+
+ if (!epd_get_op(epd,"am",am,StringSize)) strcpy(am,"");
+ if (!epd_get_op(epd,"bm",bm,StringSize)) strcpy(bm,"");
+ if (!epd_get_op(epd,"id",id,StringSize)) strcpy(id,"");
+
+ if (my_string_empty(am) && my_string_empty(bm)) {
+ my_fatal("epd_test(): no am or bm field at line %d\n",line);
+ }
+
+ // init
+
+ uci_send_ucinewgame(Uci);
+ uci_send_isready_sync(Uci);
+
+ ASSERT(!Uci->searching);
+
+ // position
+ if (!board_from_fen(board,epd)) ASSERT(FALSE);
+ if (!board_to_fen(board,string,StringSize)) ASSERT(FALSE);
+
+ engine_send(Engine,"position fen %s",string);
+
+ // search
+
+ my_timer_start(Timer); // also resets
+
+ // which ones of the next two alternatives is best?
+ engine_send(Engine,"go movetime %.0f depth %d",MaxTime*1000.0,MaxDepth);
+ //engine_send(Engine,"go infinite");
+
+ // engine data
+
+ board_copy(Uci->board,board);
+
+ uci_clear(Uci);
+ Uci->searching = TRUE;
+ Uci->pending_nb++;
+
+ FirstMove = MoveNone;
+ FirstDepth = 0;
+ FirstSelDepth = 0;
+ FirstScore = 0;
+ FirstTime = 0.0;
+ FirstNodeNb = 0;
+ line_clear(FirstPV);
+
+ LastMove = MoveNone;
+ LastDepth = 0;
+ LastSelDepth = 0;
+ LastScore = 0;
+ LastTime = 0.0;
+ LastNodeNb = 0;
+ line_clear(LastPV);
+
+ // parse engine output
+
+ while (!engine_eof(Engine) && engine_step()) {
+ bool stop=FALSE;
+
+ // stop search?
+// printf("Uci->time=%.2f time=%.2f\n",Uci->time,my_timer_elapsed_real(Timer));
+ if (Uci->depth > MaxDepth){
+ my_log("POLYGLOT Maximum depth %d reached\n",MaxDepth);
+ stop=TRUE;
+ }else if(my_timer_elapsed_real(Timer) >= MaxTime){
+ my_log("POLYGLOT Maximum search time %.2fs reached\n",MaxTime);
+ stop=TRUE;
+ }else if(Uci->depth - FirstDepth >= DepthDelta){
+ if(Uci->depth > MinDepth){
+ if(Uci->time >= MinTime){
+ if(is_solution(FirstMove,board,bm,am)){
+ my_log("POLYGLOT Solution found\n",MaxTime);
+ stop=TRUE;
+ }
+ }
+ }
+ }
+ if(stop){
+ my_log("POLYGLOT Stopping engine\n");
+ engine_send(Engine,"stop");
+ break;
+ }
+ }
+
+ move = FirstMove;
+ correct = is_solution(move,board,bm,am);
+
+ if (correct) hit++;
+ tot++;
+
+ if (correct) {
+ depth_tot += ((double)FirstDepth);
+ time_tot += FirstTime;
+ node_tot += ((double)((sint64)FirstNodeNb));
+ }
+
+ printf("%2d: %-15s %s %4d",tot,id,correct?"OK":"--",hit);
+
+ if (!line_to_san(LastPV,Uci->board,pv_string,StringSize)) ASSERT(FALSE);
+ printf(" score=%+6.2f pv [D=%2d, T=%7.2fs, N=%6dk] =%s\n",((double)LastScore)/100.0,FirstDepth,FirstTime,(int)FirstNodeNb/1000,pv_string);
+ }
+
+ printf("\nscore=%d/%d",hit,tot);
+
+ if (hit != 0) {
+
+ depth_tot /= ((double)hit);
+ time_tot /= ((double)hit);
+ node_tot /= ((double)hit);
+
+ printf(" [averages on correct positions: depth=%.1f time=%.2f nodes=%.0f]",depth_tot,time_tot,node_tot);
+ }
+
+ printf("\n");
+
+ fclose(file);
+ quit();
+}
+
+// is_solution()
+
+static bool is_solution(int move, const board_t * board, const char bm[], const char am[]) {
+
+ char move_string[256];
+ bool correct;
+
+ ASSERT(move!=MoveNone);
+ ASSERT(bm!=NULL);
+ ASSERT(am!=NULL);
+
+ if (!move_is_legal(move,board)) {
+ board_disp(board);
+ move_disp(move,board);
+ printf("\n\n");
+ }
+
+ ASSERT(move_is_legal(move,board));
+
+ if (!move_to_san(move,board,move_string,256)) ASSERT(FALSE);
+
+ correct = FALSE;
+ if (!my_string_empty(bm)) {
+ correct = string_contain(bm,move_string);
+ } else if (!my_string_empty(am)) {
+ correct = !string_contain(am,move_string);
+ } else {
+ ASSERT(FALSE);
+ }
+
+ return correct;
+}
+
+// epd_get_op()
+
+bool epd_get_op(const char record[], const char opcode[], char string[], int size) {
+
+ char op[256];
+ int len;
+ const char *p_start, *p_end;
+
+ ASSERT(record!=NULL);
+ ASSERT(opcode!=NULL);
+ ASSERT(string!=NULL);
+ ASSERT(size>0);
+
+ // find the opcode
+
+ sprintf(op," %s ",opcode);
+
+ p_start = strstr(record,op);
+ if (p_start == NULL){
+ sprintf(op,";%s ",opcode);
+ p_start = strstr(record,op);
+ if (p_start == NULL){
+ return FALSE;
+ }
+ }
+
+ // skip the opcode
+
+ p_start += strlen(op);
+
+ // find the end
+ p_end = strchr(p_start,';');
+ if (p_end == NULL) return FALSE;
+
+ // calculate the length
+
+ len = p_end - p_start;
+ if (size < len+1) my_fatal("epd_get_op(): size < len+1\n");
+
+ strncpy(string,p_start,len);
+ string[len] = '\0';
+
+ return TRUE;
+}
+
+// string_contain()
+
+static bool string_contain(const char string[], const char substring[]) {
+
+ char new_string[StringSize], *p;
+
+ strcpy(new_string,string); // HACK
+
+ for (p = strtok(new_string," "); p != NULL; p = strtok(NULL," ")) {
+ if (my_string_equal(p,substring)) return TRUE;
+ }
+
+ return FALSE;
+}
+
+// engine_step()
+
+static bool engine_step() {
+
+ char string[StringSize];
+ int event;
+
+ engine_get(Engine,string);
+ event = uci_parse(Uci,string);
+
+ if ((event & EVENT_MOVE) != 0) {
+
+ return FALSE;
+ }
+
+ if ((event & EVENT_PV) != 0) {
+
+ LastMove = Uci->best_pv[0];
+ LastDepth = Uci->best_depth;
+ LastSelDepth = Uci->best_sel_depth;
+ LastScore = Uci->best_score;
+ LastTime = Uci->time;
+ LastNodeNb = Uci->node_nb;
+ line_copy(LastPV,Uci->best_pv);
+
+ if (LastMove != FirstMove) {
+ FirstMove = LastMove;
+ FirstDepth = LastDepth;
+ FirstSelDepth = LastSelDepth;
+ FirstScore = LastScore;
+ FirstTime = LastTime;
+ FirstNodeNb = LastNodeNb;
+ line_copy(FirstPV,LastPV);
+ }
+ }
+
+ return TRUE;
+}
+
+// end of epd.cpp
+
-\r
-// epd.h\r
-\r
-#ifndef EPD_H\r
-#define EPD_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-extern void epd_test (int argc, char * argv[]);\r
-\r
-extern bool epd_get_op (const char record[], const char opcode[], char string[], int size);\r
-\r
-#endif // !defined EPD_H\r
-\r
-// end of epd.h\r
-\r
+
+// epd.h
+
+#ifndef EPD_H
+#define EPD_H
+
+// includes
+
+#include "util.h"
+
+// functions
+
+extern void epd_test (int argc, char * argv[]);
+
+extern bool epd_get_op (const char record[], const char opcode[], char string[], int size);
+
+#endif // !defined EPD_H
+
+// end of epd.h
+
-\r
-// fen.c\r
-\r
-// includes\r
-\r
-#include <ctype.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-\r
-#include "board.h"\r
-#include "colour.h"\r
-#include "fen.h"\r
-#include "option.h"\r
-#include "piece.h"\r
-#include "square.h"\r
-#include "util.h"\r
-\r
-// "constants"\r
-\r
-// const char * StartFen = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w HAha - 0 1";\r
-const char * StartFen = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";\r
-\r
-// variables\r
-\r
-static const bool Strict = FALSE;\r
-\r
-// macros\r
-\r
-#define skip_white_space() \\r
- c=string[pos];\\r
- if (c != ' ' && c!='\t') my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos); \\r
- while(c==' ' || c=='\t') c=string[++pos];\r
-\r
-\r
-// functions\r
-\r
-// board_from_fen()\r
-\r
-bool board_from_fen(board_t * board, const char string[]) {\r
-\r
- int pos;\r
- int file, rank, sq;\r
- int c;\r
- int i, len;\r
- int piece;\r
- int king_pos[ColourNb];\r
-\r
- ASSERT(board!=NULL);\r
- ASSERT(string!=NULL);\r
-\r
- board_clear(board);\r
-\r
- king_pos[White] = SquareNone;\r
- king_pos[Black] = SquareNone;\r
-\r
- pos = 0;\r
- c = string[pos];\r
-\r
- // piece placement\r
-\r
- for (rank = 7; rank >= 0; rank--) {\r
-\r
- for (file = 0; file < 8;) {\r
-\r
- sq = square_make(file,rank);\r
-\r
- if (c >= '1' && c <= '8') { // empty square(s)\r
-\r
- len = c - '0';\r
- if (file + len > 8) my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
-\r
- for (i = 0; i < len; i++) {\r
- board->square[sq++] = Empty;\r
- file++;\r
- }\r
-\r
- } else { // piece\r
-\r
- piece = piece_from_char(c);\r
- if (piece == PieceNone256) my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
-\r
- if (piece_is_king(piece)) king_pos[piece_colour(piece)] = sq;\r
-\r
- board->square[sq++] = piece;\r
- file++;\r
- }\r
-\r
- c = string[++pos];\r
- }\r
-\r
- if (rank > 0) {\r
- if (c != '/') my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
- c = string[++pos];\r
- }\r
- }\r
-\r
- // active colour\r
-\r
- skip_white_space();\r
-\r
- switch (c) {\r
- case 'w':\r
- board->turn = White;\r
- break;\r
- case 'b':\r
- board->turn = Black;\r
- break;\r
- default:\r
- my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
- break;\r
- }\r
-\r
- c = string[++pos];\r
-\r
- // castling\r
-\r
- skip_white_space();\r
-\r
- board->castle[White][SideH] = SquareNone;\r
- board->castle[White][SideA] = SquareNone;\r
- board->castle[Black][SideH] = SquareNone;\r
- board->castle[Black][SideA] = SquareNone;\r
-\r
- if (c == '-') { // no castling rights\r
-\r
- c = string[++pos];\r
-\r
- } else {\r
-\r
- // TODO: filter out illegal rights\r
-\r
- do {\r
-\r
- if (FALSE) {\r
-\r
- } else if (c == 'K') {\r
-\r
- for (sq = H1; sq > king_pos[White]; sq--) {\r
- if (board->square[sq] == WhiteRook256) {\r
- board->castle[White][SideH] = sq;\r
- break;\r
- }\r
- }\r
-\r
- } else if (c == 'Q') {\r
-\r
- for (sq = A1; sq < king_pos[White]; sq++) {\r
- if (board->square[sq] == WhiteRook256) {\r
- board->castle[White][SideA] = sq;\r
- break;\r
- }\r
- }\r
-\r
- } else if (c == 'k') {\r
-\r
- for (sq = H8; sq > king_pos[Black]; sq--) {\r
- if (board->square[sq] == BlackRook256) {\r
- board->castle[Black][SideH] = sq;\r
- break;\r
- }\r
- }\r
-\r
- } else if (c == 'q') {\r
-\r
- for (sq = A8; sq < king_pos[Black]; sq++) {\r
- if (board->square[sq] == BlackRook256) {\r
- board->castle[Black][SideA] = sq;\r
- break;\r
- }\r
- }\r
-\r
- } else if (c >= 'A' && c <= 'H') {\r
-\r
- // white castling right\r
-\r
- sq = square_make(file_from_char(tolower(c)),Rank1);\r
-\r
- if (sq > king_pos[White]) { // h side\r
- board->castle[White][SideH] = sq;\r
- } else { // a side\r
- board->castle[White][SideA] = sq;\r
- }\r
-\r
- } else if (c >= 'a' && c <= 'h') {\r
-\r
- // black castling right\r
-\r
- sq = square_make(file_from_char(tolower(c)),Rank8);\r
-\r
- if (sq > king_pos[Black]) { // h side\r
- board->castle[Black][SideH] = sq;\r
- } else { // a side\r
- board->castle[Black][SideA] = sq;\r
- }\r
-\r
- } else {\r
-\r
- my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
- }\r
-\r
- c = string[++pos];\r
-\r
- } while (c != ' ');\r
- }\r
-\r
- // en-passant\r
-\r
- skip_white_space();\r
-\r
- if (c == '-') { // no en-passant\r
-\r
- sq = SquareNone;\r
- c = string[++pos];\r
-\r
- } else {\r
-\r
- if (c < 'a' || c > 'h') my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
- file = file_from_char(c);\r
- c = string[++pos];\r
-\r
- if (c < '1' || c > '8') my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
- rank = rank_from_char(c);\r
- c = string[++pos];\r
-\r
- sq = square_make(file,rank);\r
- }\r
-\r
- board->ep_square = sq;\r
-\r
- // halfmove clock\r
-\r
- board->ply_nb = 0;\r
- board->move_nb = 0; // HACK, in case of broken syntax\r
-\r
- if (c != ' ') {\r
- if (!Strict) goto update;\r
- my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
- }\r
- c = string[++pos];\r
-\r
- if (!isdigit(c)) {\r
- if (!Strict) goto update;\r
- my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
- }\r
-\r
- board->ply_nb = atoi(&string[pos]);\r
- do c = string[++pos]; while (isdigit(c));\r
-\r
- // fullmove number\r
-\r
- board->move_nb = 0;\r
-\r
- if (c != ' ') {\r
- if (!Strict) goto update;\r
- my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
- }\r
- c = string[++pos];\r
-\r
- if (!isdigit(c)) {\r
- if (!Strict) goto update;\r
- my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);\r
- }\r
-\r
- board->move_nb = atoi(&string[pos]) - 1;\r
- do c = string[++pos]; while (isdigit(c));\r
-\r
- // board update\r
-\r
-update:\r
- board_init_list(board);\r
-\r
- return TRUE;\r
-}\r
-\r
-// board_to_fen()\r
-\r
-bool board_to_fen(const board_t * board, char string[], int size) {\r
-\r
- int pos;\r
- int file, rank;\r
- int sq, piece;\r
- int c;\r
- int len;\r
- int old_pos;\r
-\r
- ASSERT(board_is_ok(board));\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=92);\r
-\r
- // init\r
-\r
- if (size < 92) return FALSE;\r
-\r
- pos = 0;\r
-\r
- // piece placement\r
-\r
- for (rank = 7; rank >= 0; rank--) {\r
-\r
- for (file = 0; file < 8;) {\r
-\r
- sq = square_make(file,rank);\r
- piece = board->square[sq];\r
- ASSERT(piece==Empty||piece_is_ok(piece));\r
-\r
- if (piece == Empty) {\r
-\r
- len = 0;\r
- for (; file < 8 && board->square[square_make(file,rank)] == Empty; file++) {\r
- len++;\r
- }\r
-\r
- ASSERT(len>=1&&len<=8);\r
- c = '0' + len;\r
-\r
- } else {\r
-\r
- c = piece_to_char(piece);\r
- file++;\r
- }\r
-\r
- string[pos++] = c;\r
- }\r
-\r
- string[pos++] = '/';\r
- }\r
-\r
- string[pos-1] = ' '; // HACK: remove the last '/'\r
-\r
- // active colour\r
-\r
- string[pos++] = (colour_is_white(board->turn)) ? 'w' : 'b';\r
- string[pos++] = ' ';\r
-\r
- // castling\r
-\r
- old_pos = pos;\r
-\r
- if (option_get_bool(Option,"Chess960")) {\r
-\r
- // FEN-960\r
-\r
- if (board->castle[White][SideH] != SquareNone) {\r
- string[pos++] = toupper(file_to_char(square_file(board->castle[White][SideH])));\r
- }\r
-\r
- if (board->castle[White][SideA] != SquareNone) {\r
- string[pos++] = toupper(file_to_char(square_file(board->castle[White][SideA])));\r
- }\r
-\r
- if (board->castle[Black][SideH] != SquareNone) {\r
- string[pos++] = tolower(file_to_char(square_file(board->castle[Black][SideH])));\r
- }\r
-\r
- if (board->castle[Black][SideA] != SquareNone) {\r
- string[pos++] = tolower(file_to_char(square_file(board->castle[Black][SideA])));\r
- }\r
-\r
- } else {\r
-\r
- // FEN\r
-\r
- if (board->castle[White][SideH] != SquareNone) string[pos++] = 'K';\r
- if (board->castle[White][SideA] != SquareNone) string[pos++] = 'Q';\r
- if (board->castle[Black][SideH] != SquareNone) string[pos++] = 'k';\r
- if (board->castle[Black][SideA] != SquareNone) string[pos++] = 'q';\r
- }\r
-\r
- if (pos == old_pos) string[pos++] = '-';\r
-\r
- string[pos++] = ' ';\r
-\r
- // en-passant\r
-\r
- if (board->ep_square == SquareNone) {\r
- string[pos++] = '-';\r
- } else {\r
- if (!square_to_string(board->ep_square,&string[pos],3)) return FALSE;\r
- pos += 2;\r
- }\r
-\r
- string[pos++] = ' ';\r
-\r
- // halfmove clock and fullmove number\r
-\r
- sprintf(&string[pos],"%d %d",board->ply_nb,board->move_nb+1);\r
-\r
- return TRUE;\r
-}\r
-\r
-// end of fen.cpp\r
-\r
+
+// fen.c
+
+// includes
+
+#include <ctype.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "board.h"
+#include "colour.h"
+#include "fen.h"
+#include "option.h"
+#include "piece.h"
+#include "square.h"
+#include "util.h"
+
+// "constants"
+
+// const char * StartFen = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w HAha - 0 1";
+const char * StartFen = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
+
+// variables
+
+static const bool Strict = FALSE;
+
+// macros
+
+#define skip_white_space() \
+ c=string[pos];\
+ if (c != ' ' && c!='\t') my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos); \
+ while(c==' ' || c=='\t') c=string[++pos];
+
+
+// functions
+
+// board_from_fen()
+
+bool board_from_fen(board_t * board, const char string[]) {
+
+ int pos;
+ int file, rank, sq;
+ int c;
+ int i, len;
+ int piece;
+ int king_pos[ColourNb];
+
+ ASSERT(board!=NULL);
+ ASSERT(string!=NULL);
+
+ board_clear(board);
+
+ king_pos[White] = SquareNone;
+ king_pos[Black] = SquareNone;
+
+ pos = 0;
+ c = string[pos];
+
+ // piece placement
+
+ for (rank = 7; rank >= 0; rank--) {
+
+ for (file = 0; file < 8;) {
+
+ sq = square_make(file,rank);
+
+ if (c >= '1' && c <= '8') { // empty square(s)
+
+ len = c - '0';
+ if (file + len > 8) my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+
+ for (i = 0; i < len; i++) {
+ board->square[sq++] = Empty;
+ file++;
+ }
+
+ } else { // piece
+
+ piece = piece_from_char(c);
+ if (piece == PieceNone256) my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+
+ if (piece_is_king(piece)) king_pos[piece_colour(piece)] = sq;
+
+ board->square[sq++] = piece;
+ file++;
+ }
+
+ c = string[++pos];
+ }
+
+ if (rank > 0) {
+ if (c != '/') my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+ c = string[++pos];
+ }
+ }
+
+ // active colour
+
+ skip_white_space();
+
+ switch (c) {
+ case 'w':
+ board->turn = White;
+ break;
+ case 'b':
+ board->turn = Black;
+ break;
+ default:
+ my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+ break;
+ }
+
+ c = string[++pos];
+
+ // castling
+
+ skip_white_space();
+
+ board->castle[White][SideH] = SquareNone;
+ board->castle[White][SideA] = SquareNone;
+ board->castle[Black][SideH] = SquareNone;
+ board->castle[Black][SideA] = SquareNone;
+
+ if (c == '-') { // no castling rights
+
+ c = string[++pos];
+
+ } else {
+
+ // TODO: filter out illegal rights
+
+ do {
+
+ if (FALSE) {
+
+ } else if (c == 'K') {
+
+ for (sq = H1; sq > king_pos[White]; sq--) {
+ if (board->square[sq] == WhiteRook256) {
+ board->castle[White][SideH] = sq;
+ break;
+ }
+ }
+
+ } else if (c == 'Q') {
+
+ for (sq = A1; sq < king_pos[White]; sq++) {
+ if (board->square[sq] == WhiteRook256) {
+ board->castle[White][SideA] = sq;
+ break;
+ }
+ }
+
+ } else if (c == 'k') {
+
+ for (sq = H8; sq > king_pos[Black]; sq--) {
+ if (board->square[sq] == BlackRook256) {
+ board->castle[Black][SideH] = sq;
+ break;
+ }
+ }
+
+ } else if (c == 'q') {
+
+ for (sq = A8; sq < king_pos[Black]; sq++) {
+ if (board->square[sq] == BlackRook256) {
+ board->castle[Black][SideA] = sq;
+ break;
+ }
+ }
+
+ } else if (c >= 'A' && c <= 'H') {
+
+ // white castling right
+
+ sq = square_make(file_from_char(tolower(c)),Rank1);
+
+ if (sq > king_pos[White]) { // h side
+ board->castle[White][SideH] = sq;
+ } else { // a side
+ board->castle[White][SideA] = sq;
+ }
+
+ } else if (c >= 'a' && c <= 'h') {
+
+ // black castling right
+
+ sq = square_make(file_from_char(tolower(c)),Rank8);
+
+ if (sq > king_pos[Black]) { // h side
+ board->castle[Black][SideH] = sq;
+ } else { // a side
+ board->castle[Black][SideA] = sq;
+ }
+
+ } else {
+
+ my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+ }
+
+ c = string[++pos];
+
+ } while (c != ' ');
+ }
+
+ // en-passant
+
+ skip_white_space();
+
+ if (c == '-') { // no en-passant
+
+ sq = SquareNone;
+ c = string[++pos];
+
+ } else {
+
+ if (c < 'a' || c > 'h') my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+ file = file_from_char(c);
+ c = string[++pos];
+
+ if (c < '1' || c > '8') my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+ rank = rank_from_char(c);
+ c = string[++pos];
+
+ sq = square_make(file,rank);
+ }
+
+ board->ep_square = sq;
+
+ // halfmove clock
+
+ board->ply_nb = 0;
+ board->move_nb = 0; // HACK, in case of broken syntax
+
+ if (c != ' ') {
+ if (!Strict) goto update;
+ my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+ }
+ c = string[++pos];
+
+ if (!isdigit(c)) {
+ if (!Strict) goto update;
+ my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+ }
+
+ board->ply_nb = atoi(&string[pos]);
+ do c = string[++pos]; while (isdigit(c));
+
+ // fullmove number
+
+ board->move_nb = 0;
+
+ if (c != ' ') {
+ if (!Strict) goto update;
+ my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+ }
+ c = string[++pos];
+
+ if (!isdigit(c)) {
+ if (!Strict) goto update;
+ my_fatal("board_from_fen(): bad FEN (pos=%d)\n",pos);
+ }
+
+ board->move_nb = atoi(&string[pos]) - 1;
+ do c = string[++pos]; while (isdigit(c));
+
+ // board update
+
+update:
+ board_init_list(board);
+
+ return TRUE;
+}
+
+// board_to_fen()
+
+bool board_to_fen(const board_t * board, char string[], int size) {
+
+ int pos;
+ int file, rank;
+ int sq, piece;
+ int c;
+ int len;
+ int old_pos;
+
+ ASSERT(board_is_ok(board));
+ ASSERT(string!=NULL);
+ ASSERT(size>=92);
+
+ // init
+
+ if (size < 92) return FALSE;
+
+ pos = 0;
+
+ // piece placement
+
+ for (rank = 7; rank >= 0; rank--) {
+
+ for (file = 0; file < 8;) {
+
+ sq = square_make(file,rank);
+ piece = board->square[sq];
+ ASSERT(piece==Empty||piece_is_ok(piece));
+
+ if (piece == Empty) {
+
+ len = 0;
+ for (; file < 8 && board->square[square_make(file,rank)] == Empty; file++) {
+ len++;
+ }
+
+ ASSERT(len>=1&&len<=8);
+ c = '0' + len;
+
+ } else {
+
+ c = piece_to_char(piece);
+ file++;
+ }
+
+ string[pos++] = c;
+ }
+
+ string[pos++] = '/';
+ }
+
+ string[pos-1] = ' '; // HACK: remove the last '/'
+
+ // active colour
+
+ string[pos++] = (colour_is_white(board->turn)) ? 'w' : 'b';
+ string[pos++] = ' ';
+
+ // castling
+
+ old_pos = pos;
+
+ if (option_get_bool(Option,"Chess960")) {
+
+ // FEN-960
+
+ if (board->castle[White][SideH] != SquareNone) {
+ string[pos++] = toupper(file_to_char(square_file(board->castle[White][SideH])));
+ }
+
+ if (board->castle[White][SideA] != SquareNone) {
+ string[pos++] = toupper(file_to_char(square_file(board->castle[White][SideA])));
+ }
+
+ if (board->castle[Black][SideH] != SquareNone) {
+ string[pos++] = tolower(file_to_char(square_file(board->castle[Black][SideH])));
+ }
+
+ if (board->castle[Black][SideA] != SquareNone) {
+ string[pos++] = tolower(file_to_char(square_file(board->castle[Black][SideA])));
+ }
+
+ } else {
+
+ // FEN
+
+ if (board->castle[White][SideH] != SquareNone) string[pos++] = 'K';
+ if (board->castle[White][SideA] != SquareNone) string[pos++] = 'Q';
+ if (board->castle[Black][SideH] != SquareNone) string[pos++] = 'k';
+ if (board->castle[Black][SideA] != SquareNone) string[pos++] = 'q';
+ }
+
+ if (pos == old_pos) string[pos++] = '-';
+
+ string[pos++] = ' ';
+
+ // en-passant
+
+ if (board->ep_square == SquareNone) {
+ string[pos++] = '-';
+ } else {
+ if (!square_to_string(board->ep_square,&string[pos],3)) return FALSE;
+ pos += 2;
+ }
+
+ string[pos++] = ' ';
+
+ // halfmove clock and fullmove number
+
+ sprintf(&string[pos],"%d %d",board->ply_nb,board->move_nb+1);
+
+ return TRUE;
+}
+
+// end of fen.cpp
+
-\r
-// fen.h\r
-\r
-#ifndef FEN_H\r
-#define FEN_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "util.h"\r
-\r
-// "constants"\r
-\r
-extern const char * StartFen;\r
-\r
-// functions\r
-\r
-extern bool board_from_fen (board_t * board, const char string[]);\r
-extern bool board_to_fen (const board_t * board, char string[], int size);\r
-\r
-#endif // !defined FEN_H\r
-\r
-// end of fen.h\r
-\r
+
+// fen.h
+
+#ifndef FEN_H
+#define FEN_H
+
+// includes
+
+#include "board.h"
+#include "util.h"
+
+// "constants"
+
+extern const char * StartFen;
+
+// functions
+
+extern bool board_from_fen (board_t * board, const char string[]);
+extern bool board_to_fen (const board_t * board, char string[], int size);
+
+#endif // !defined FEN_H
+
+// end of fen.h
+
-\r
-// game.c\r
-\r
-// includes\r
-\r
-#include "attack.h"\r
-#include "board.h"\r
-#include "fen.h"\r
-#include "game.h"\r
-#include "list.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_legal.h"\r
-#include "piece.h"\r
-#include "square.h"\r
-#include "util.h"\r
-\r
-// constants\r
-\r
-static const bool UseSlowDebug = FALSE;\r
-\r
-// variables\r
-\r
-game_t Game[1];\r
-\r
-// prototypes\r
-\r
-static void game_update (game_t * game);\r
-static int game_comp_status (const game_t * game);\r
-\r
-// functions\r
-\r
-// game_is_ok()\r
-\r
-bool game_is_ok(const game_t * game) {\r
-\r
- board_t board[1];\r
- int pos, move;\r
-\r
- if (game == NULL) return FALSE;\r
-\r
- if (game->size < 0 || game->size > GameSize) return FALSE;\r
- if (game->pos < 0 || game->pos > game->size) return FALSE;\r
-\r
- // optional heavy DEBUG mode\r
-\r
- if (!UseSlowDebug) return TRUE;\r
-\r
- if (!board_is_ok(game->start_board)) return FALSE;\r
-\r
- board_copy(board,game->start_board);\r
-\r
- for (pos = 0; pos <= game->size; pos++) {\r
-\r
- if (pos == game->pos) {\r
- if (!board_equal(game->board,board)) return FALSE;\r
- }\r
-\r
- if (pos >= game->size) break;\r
-\r
- if (game->key[pos] != board->key) return FALSE;\r
-\r
- move = game->move[pos];\r
- //if (!move_is_legal(move,board)); //huh??\r
- if (!move_is_legal(move,board)) return FALSE; \r
-\r
- move_do(board,move);\r
- }\r
-\r
- if (game->status != game_comp_status(game)) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// game_clear()\r
-\r
-void game_clear(game_t * game) {\r
-\r
- ASSERT(game!=NULL);\r
-\r
- game_init(game,StartFen);\r
-}\r
-\r
-// game_init()\r
-\r
-bool game_init(game_t * game, const char fen[]) {\r
-\r
- ASSERT(game!=NULL);\r
- ASSERT(fen!=NULL);\r
-\r
- if (!board_from_fen(game->start_board,fen)) return FALSE;\r
-\r
- game->size = 0;\r
-\r
- board_copy(game->board,game->start_board);\r
- game->pos = 0;\r
-\r
- game_update(game);\r
-\r
- return TRUE;\r
-}\r
-\r
-// game_status()\r
-\r
-int game_status(const game_t * game) {\r
-\r
- ASSERT(game!=NULL);\r
-\r
- return game->status;\r
-}\r
-\r
-// game_size()\r
-\r
-int game_size(const game_t * game) {\r
-\r
- ASSERT(game!=NULL);\r
-\r
- return game->size;\r
-}\r
-\r
-// game_pos()\r
-\r
-int game_pos(const game_t * game) {\r
-\r
- ASSERT(game!=NULL);\r
-\r
- return game->pos;\r
-}\r
-\r
-// game_move()\r
-\r
-int game_move(const game_t * game, int pos) {\r
-\r
- ASSERT(game!=NULL);\r
- ASSERT(pos>=0&&pos<game->pos);\r
-\r
- return game->move[pos];\r
-}\r
-\r
-// game_get_board()\r
-\r
-void game_get_board(const game_t * game, board_t * board) {\r
- game_get_board_ex(game, board, -1);\r
-}\r
-\r
-// game_get_board_ex()\r
-\r
-void game_get_board_ex(const game_t * game, board_t * board, int pos) {\r
-\r
- int start;\r
- int i;\r
-\r
- ASSERT(game!=NULL);\r
- ASSERT(board!=NULL);\r
- ASSERT(pos==-1||(pos>=0&&pos<=game->size)); // HACK\r
-\r
- if (pos < 0) pos = game->pos;\r
-\r
- if (pos >= game->pos) { // forward from current position\r
- start = game->pos;\r
- board_copy(board,game->board);\r
- } else { // backward => replay the whole game\r
- start = 0;\r
- board_copy(board,game->start_board);\r
- }\r
-\r
- for (i = start; i < pos; i++) move_do(board,game->move[i]);\r
-}\r
-\r
-// game_turn()\r
-\r
-int game_turn(const game_t * game) {\r
-\r
- ASSERT(game!=NULL);\r
-\r
- return game->board->turn;\r
-}\r
-\r
-// game_move_nb()\r
-\r
-int game_move_nb(const game_t * game) {\r
-\r
- ASSERT(game!=NULL);\r
-\r
- return game->board->move_nb;\r
-}\r
-\r
-// game_add_move()\r
-\r
-void game_add_move(game_t * game, int move) {\r
-\r
- ASSERT(game!=NULL);\r
- ASSERT(move_is_ok(move));\r
-\r
- ASSERT(move_is_legal(move,game->board));\r
-\r
- if (game->pos >= GameSize) my_fatal("game_add_move(): game overflow\n");\r
-\r
- game->move[game->pos] = move;\r
- game->key[game->pos] = game->board->key;\r
-\r
- move_do(game->board,move);\r
- game->pos++;\r
-\r
- game->size = game->pos; // truncate game, HACK: before calling game_is_ok() in game_update()\r
-\r
- game_update(game);\r
-}\r
-\r
-// game_rem_move()\r
-\r
-void game_rem_move(game_t * game) {\r
-\r
- ASSERT(game!=NULL);\r
-\r
- game_goto(game,game->pos-1);\r
-\r
- game->size = game->pos; // truncate game\r
-}\r
-\r
-// game_goto()\r
-\r
-void game_goto(game_t * game, int pos) {\r
-\r
- int i;\r
-\r
- ASSERT(game!=NULL);\r
- ASSERT(pos>=0&&pos<=game->size);\r
-\r
- if (pos < game->pos) { // going backward => replay the whole game\r
- board_copy(game->board,game->start_board);\r
- game->pos = 0;\r
- }\r
-\r
- for (i = game->pos; i < pos; i++) move_do(game->board,game->move[i]);\r
- ASSERT(i==pos);\r
-\r
- game->pos = pos;\r
-\r
- game_update(game);\r
-}\r
-\r
-// game_disp()\r
-\r
-void game_disp(const game_t * game) {\r
-\r
- board_t board[1];\r
- int i, move;\r
-\r
- ASSERT(game_is_ok(game));\r
-\r
- board_copy(board,game->start_board);\r
-\r
- board_disp(board);\r
-\r
- for (i = 0; i < game->pos; i++) {\r
-\r
- move = game->move[i];\r
- move_disp(move,board);\r
-\r
- move_do(board,move);\r
- }\r
-\r
- my_log("POLYGLOT\n");\r
-\r
- board_disp(board);\r
-}\r
-\r
-// game_update()\r
-\r
-static void game_update(game_t * game) {\r
-\r
- ASSERT(game!=NULL);\r
-\r
- game->status = game_comp_status(game);\r
-\r
- ASSERT(game_is_ok(game));\r
-}\r
-\r
-// game_comp_status()\r
-\r
-static int game_comp_status(const game_t * game) {\r
-\r
- int i, n;\r
- int wb, bb;\r
- const board_t * board;\r
- uint64 key;\r
- int start;\r
-\r
- ASSERT(game!=NULL);\r
-\r
- // init\r
-\r
- board = game->board;\r
-\r
- // mate and stalemate\r
-\r
- if (!board_can_play(board)) {\r
- if (FALSE) {\r
- } else if (is_in_check(board,Black)) { // HACK\r
- return WHITE_MATES;\r
- } else if (is_in_check(board,White)) { // HACK\r
- return BLACK_MATES;\r
- } else {\r
- return STALEMATE;\r
- }\r
- }\r
-\r
- // insufficient material\r
-\r
- if (board->number[WhitePawn12] == 0\r
- && board->number[BlackPawn12] == 0\r
- && board->number[WhiteQueen12] == 0\r
- && board->number[BlackQueen12] == 0\r
- && board->number[WhiteRook12] == 0\r
- && board->number[BlackRook12] == 0) {\r
-\r
- if (board->number[WhiteBishop12]\r
- + board->number[BlackBishop12]\r
- + board->number[WhiteKnight12]\r
- + board->number[BlackKnight12] <= 1) { // KK, KBK and KNK\r
-\r
- return DRAW_MATERIAL;\r
-\r
- } else if (board->number[WhiteBishop12] == 1\r
- && board->number[BlackBishop12] == 1\r
- && board->number[WhiteKnight12] == 0\r
- && board->number[BlackKnight12] == 0) {\r
-\r
- wb = board->list[White][1]; // HACK\r
- bb = board->list[Black][1]; // HACK\r
-\r
- if (square_colour(wb) == square_colour(bb)) { // KBKB\r
- return DRAW_MATERIAL;\r
- }\r
- }\r
- }\r
-\r
- // 50-move rule\r
-\r
- if (board->ply_nb >= 100) return DRAW_FIFTY;\r
-\r
- // position repetition\r
-\r
- key = board->key;\r
- n = 0;\r
-\r
- start = game->pos - board->ply_nb;\r
- if (start < 0) start = 0;\r
-\r
- for (i = game->pos-4; i >= start; i -= 2) {\r
- if (game->key[i] == key) {\r
- if (++n == 2) return DRAW_REPETITION;\r
- }\r
- }\r
-\r
- return PLAYING;\r
-}\r
-\r
-// end of game.cpp\r
-\r
+
+// game.c
+
+// includes
+
+#include "attack.h"
+#include "board.h"
+#include "fen.h"
+#include "game.h"
+#include "list.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_legal.h"
+#include "piece.h"
+#include "square.h"
+#include "util.h"
+
+// constants
+
+static const bool UseSlowDebug = FALSE;
+
+// variables
+
+game_t Game[1];
+
+// prototypes
+
+static void game_update (game_t * game);
+static int game_comp_status (const game_t * game);
+
+// functions
+
+// game_is_ok()
+
+bool game_is_ok(const game_t * game) {
+
+ board_t board[1];
+ int pos, move;
+
+ if (game == NULL) return FALSE;
+
+ if (game->size < 0 || game->size > GameSize) return FALSE;
+ if (game->pos < 0 || game->pos > game->size) return FALSE;
+
+ // optional heavy DEBUG mode
+
+ if (!UseSlowDebug) return TRUE;
+
+ if (!board_is_ok(game->start_board)) return FALSE;
+
+ board_copy(board,game->start_board);
+
+ for (pos = 0; pos <= game->size; pos++) {
+
+ if (pos == game->pos) {
+ if (!board_equal(game->board,board)) return FALSE;
+ }
+
+ if (pos >= game->size) break;
+
+ if (game->key[pos] != board->key) return FALSE;
+
+ move = game->move[pos];
+ //if (!move_is_legal(move,board)); //huh??
+ if (!move_is_legal(move,board)) return FALSE;
+
+ move_do(board,move);
+ }
+
+ if (game->status != game_comp_status(game)) return FALSE;
+
+ return TRUE;
+}
+
+// game_clear()
+
+void game_clear(game_t * game) {
+
+ ASSERT(game!=NULL);
+
+ game_init(game,StartFen);
+}
+
+// game_init()
+
+bool game_init(game_t * game, const char fen[]) {
+
+ ASSERT(game!=NULL);
+ ASSERT(fen!=NULL);
+
+ if (!board_from_fen(game->start_board,fen)) return FALSE;
+
+ game->size = 0;
+
+ board_copy(game->board,game->start_board);
+ game->pos = 0;
+
+ game_update(game);
+
+ return TRUE;
+}
+
+// game_status()
+
+int game_status(const game_t * game) {
+
+ ASSERT(game!=NULL);
+
+ return game->status;
+}
+
+// game_size()
+
+int game_size(const game_t * game) {
+
+ ASSERT(game!=NULL);
+
+ return game->size;
+}
+
+// game_pos()
+
+int game_pos(const game_t * game) {
+
+ ASSERT(game!=NULL);
+
+ return game->pos;
+}
+
+// game_move()
+
+int game_move(const game_t * game, int pos) {
+
+ ASSERT(game!=NULL);
+ ASSERT(pos>=0&&pos<game->pos);
+
+ return game->move[pos];
+}
+
+// game_get_board()
+
+void game_get_board(const game_t * game, board_t * board) {
+ game_get_board_ex(game, board, -1);
+}
+
+// game_get_board_ex()
+
+void game_get_board_ex(const game_t * game, board_t * board, int pos) {
+
+ int start;
+ int i;
+
+ ASSERT(game!=NULL);
+ ASSERT(board!=NULL);
+ ASSERT(pos==-1||(pos>=0&&pos<=game->size)); // HACK
+
+ if (pos < 0) pos = game->pos;
+
+ if (pos >= game->pos) { // forward from current position
+ start = game->pos;
+ board_copy(board,game->board);
+ } else { // backward => replay the whole game
+ start = 0;
+ board_copy(board,game->start_board);
+ }
+
+ for (i = start; i < pos; i++) move_do(board,game->move[i]);
+}
+
+// game_turn()
+
+int game_turn(const game_t * game) {
+
+ ASSERT(game!=NULL);
+
+ return game->board->turn;
+}
+
+// game_move_nb()
+
+int game_move_nb(const game_t * game) {
+
+ ASSERT(game!=NULL);
+
+ return game->board->move_nb;
+}
+
+// game_add_move()
+
+void game_add_move(game_t * game, int move) {
+
+ ASSERT(game!=NULL);
+ ASSERT(move_is_ok(move));
+
+ ASSERT(move_is_legal(move,game->board));
+
+ if (game->pos >= GameSize) my_fatal("game_add_move(): game overflow\n");
+
+ game->move[game->pos] = move;
+ game->key[game->pos] = game->board->key;
+
+ move_do(game->board,move);
+ game->pos++;
+
+ game->size = game->pos; // truncate game, HACK: before calling game_is_ok() in game_update()
+
+ game_update(game);
+}
+
+// game_rem_move()
+
+void game_rem_move(game_t * game) {
+
+ ASSERT(game!=NULL);
+
+ game_goto(game,game->pos-1);
+
+ game->size = game->pos; // truncate game
+}
+
+// game_goto()
+
+void game_goto(game_t * game, int pos) {
+
+ int i;
+
+ ASSERT(game!=NULL);
+ ASSERT(pos>=0&&pos<=game->size);
+
+ if (pos < game->pos) { // going backward => replay the whole game
+ board_copy(game->board,game->start_board);
+ game->pos = 0;
+ }
+
+ for (i = game->pos; i < pos; i++) move_do(game->board,game->move[i]);
+ ASSERT(i==pos);
+
+ game->pos = pos;
+
+ game_update(game);
+}
+
+// game_disp()
+
+void game_disp(const game_t * game) {
+
+ board_t board[1];
+ int i, move;
+
+ ASSERT(game_is_ok(game));
+
+ board_copy(board,game->start_board);
+
+ board_disp(board);
+
+ for (i = 0; i < game->pos; i++) {
+
+ move = game->move[i];
+ move_disp(move,board);
+
+ move_do(board,move);
+ }
+
+ my_log("POLYGLOT\n");
+
+ board_disp(board);
+}
+
+// game_update()
+
+static void game_update(game_t * game) {
+
+ ASSERT(game!=NULL);
+
+ game->status = game_comp_status(game);
+
+ ASSERT(game_is_ok(game));
+}
+
+// game_comp_status()
+
+static int game_comp_status(const game_t * game) {
+
+ int i, n;
+ int wb, bb;
+ const board_t * board;
+ uint64 key;
+ int start;
+
+ ASSERT(game!=NULL);
+
+ // init
+
+ board = game->board;
+
+ // mate and stalemate
+
+ if (!board_can_play(board)) {
+ if (FALSE) {
+ } else if (is_in_check(board,Black)) { // HACK
+ return WHITE_MATES;
+ } else if (is_in_check(board,White)) { // HACK
+ return BLACK_MATES;
+ } else {
+ return STALEMATE;
+ }
+ }
+
+ // insufficient material
+
+ if (board->number[WhitePawn12] == 0
+ && board->number[BlackPawn12] == 0
+ && board->number[WhiteQueen12] == 0
+ && board->number[BlackQueen12] == 0
+ && board->number[WhiteRook12] == 0
+ && board->number[BlackRook12] == 0) {
+
+ if (board->number[WhiteBishop12]
+ + board->number[BlackBishop12]
+ + board->number[WhiteKnight12]
+ + board->number[BlackKnight12] <= 1) { // KK, KBK and KNK
+
+ return DRAW_MATERIAL;
+
+ } else if (board->number[WhiteBishop12] == 1
+ && board->number[BlackBishop12] == 1
+ && board->number[WhiteKnight12] == 0
+ && board->number[BlackKnight12] == 0) {
+
+ wb = board->list[White][1]; // HACK
+ bb = board->list[Black][1]; // HACK
+
+ if (square_colour(wb) == square_colour(bb)) { // KBKB
+ return DRAW_MATERIAL;
+ }
+ }
+ }
+
+ // 50-move rule
+
+ if (board->ply_nb >= 100) return DRAW_FIFTY;
+
+ // position repetition
+
+ key = board->key;
+ n = 0;
+
+ start = game->pos - board->ply_nb;
+ if (start < 0) start = 0;
+
+ for (i = game->pos-4; i >= start; i -= 2) {
+ if (game->key[i] == key) {
+ if (++n == 2) return DRAW_REPETITION;
+ }
+ }
+
+ return PLAYING;
+}
+
+// end of game.cpp
+
-\r
-// game.h\r
-\r
-#ifndef GAME_H\r
-#define GAME_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "move.h"\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define GameSize 4096\r
-\r
-// types\r
-\r
-typedef enum {\r
- PLAYING,\r
- WHITE_MATES,\r
- BLACK_MATES,\r
- STALEMATE,\r
- DRAW_MATERIAL,\r
- DRAW_FIFTY,\r
- DRAW_REPETITION\r
-} status_t;\r
-\r
-// types\r
-\r
-typedef struct {\r
- board_t start_board[1];\r
- board_t board[1];\r
- sint16 size;\r
- sint16 pos;\r
- sint8 status;\r
- move_t move[GameSize];\r
- uint64 key[GameSize];\r
-} game_t;\r
-\r
-// variables\r
-\r
-extern game_t Game[1];\r
-\r
-// functions\r
-\r
-extern bool game_is_ok (const game_t * game);\r
-\r
-extern void game_clear (game_t * game);\r
-extern bool game_init (game_t * game, const char fen[]);\r
-\r
-extern int game_status (const game_t * game);\r
-\r
-extern int game_size (const game_t * game);\r
-extern int game_pos (const game_t * game);\r
-extern int game_move (const game_t * game, int pos);\r
-\r
-extern void game_get_board (const game_t * game, board_t * board);\r
-extern void game_get_board_ex (const game_t * game, board_t * board, int pos);\r
-extern int game_turn (const game_t * game);\r
-extern int game_move_nb (const game_t * game);\r
-\r
-extern void game_add_move (game_t * game, int move);\r
-extern void game_rem_move (game_t * game);\r
-\r
-extern void game_goto (game_t * game, int pos);\r
-\r
-extern void game_disp (const game_t * game);\r
-\r
-#endif // !defined GAME_H\r
-\r
-// end of game.h\r
-\r
+
+// game.h
+
+#ifndef GAME_H
+#define GAME_H
+
+// includes
+
+#include "board.h"
+#include "move.h"
+#include "util.h"
+
+// defines
+
+#define GameSize 4096
+
+// types
+
+typedef enum {
+ PLAYING,
+ WHITE_MATES,
+ BLACK_MATES,
+ STALEMATE,
+ DRAW_MATERIAL,
+ DRAW_FIFTY,
+ DRAW_REPETITION
+} status_t;
+
+// types
+
+typedef struct {
+ board_t start_board[1];
+ board_t board[1];
+ sint16 size;
+ sint16 pos;
+ sint8 status;
+ move_t move[GameSize];
+ uint64 key[GameSize];
+} game_t;
+
+// variables
+
+extern game_t Game[1];
+
+// functions
+
+extern bool game_is_ok (const game_t * game);
+
+extern void game_clear (game_t * game);
+extern bool game_init (game_t * game, const char fen[]);
+
+extern int game_status (const game_t * game);
+
+extern int game_size (const game_t * game);
+extern int game_pos (const game_t * game);
+extern int game_move (const game_t * game, int pos);
+
+extern void game_get_board (const game_t * game, board_t * board);
+extern void game_get_board_ex (const game_t * game, board_t * board, int pos);
+extern int game_turn (const game_t * game);
+extern int game_move_nb (const game_t * game);
+
+extern void game_add_move (game_t * game, int move);
+extern void game_rem_move (game_t * game);
+
+extern void game_goto (game_t * game, int pos);
+
+extern void game_disp (const game_t * game);
+
+#endif // !defined GAME_H
+
+// end of game.h
+
#include "gui.h"
#include "main.h"
-// constants
-
-static const int StringSize = 4096;
-
// variables
gui_t GUI[1];
-\r
-// hash.c\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "hash.h"\r
-#include "piece.h"\r
-#include "random.h"\r
-#include "square.h"\r
-#include "util.h"\r
-\r
-// variables\r
-\r
-static uint64 Castle64[16];\r
-\r
-// prototypes\r
-\r
-static uint64 hash_castle_key_debug (int flags);\r
-\r
-// functions\r
-\r
-// hash_init()\r
-\r
-void hash_init() {\r
-\r
- int i;\r
-\r
- for (i = 0; i < 16; i++) Castle64[i] = hash_castle_key_debug(i);\r
-}\r
-\r
-// hash_key()\r
-\r
-uint64 hash_key(const board_t * board) {\r
-\r
- uint64 key;\r
- int colour;\r
- const uint8 * ptr;\r
- int sq, piece;\r
-\r
- ASSERT(board_is_ok(board));\r
-\r
- // init\r
-\r
- key = 0;\r
-\r
- // pieces\r
-\r
- for (colour = 1; colour <= 2; colour++) { // HACK\r
- for (ptr = board->list[colour]; (sq=*ptr) != SquareNone; ptr++) {\r
- piece = board->square[sq];\r
- key ^= hash_piece_key(piece,sq);\r
- }\r
- }\r
-\r
- // castle flags\r
-\r
- key ^= hash_castle_key(board_flags(board));\r
-\r
- // en-passant square\r
-\r
- sq = board->ep_square;\r
- if (sq != SquareNone) key ^= hash_ep_key(sq);\r
-\r
- // turn\r
-\r
- key ^= hash_turn_key(board->turn);\r
-\r
- return key;\r
-}\r
-\r
-// hash_piece_key()\r
-\r
-uint64 hash_piece_key(int piece, int square) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
- ASSERT(square_is_ok(square));\r
-\r
- return random_64(RandomPiece+piece_to_12(piece)*64+square_to_64(square));\r
-}\r
-\r
-// hash_castle_key()\r
-\r
-uint64 hash_castle_key(int flags) {\r
-\r
- ASSERT((flags&~0xF)==0);\r
-\r
- return Castle64[flags];\r
-}\r
-\r
-// hash_castle_key_debug()\r
-\r
-static uint64 hash_castle_key_debug(int flags) {\r
-\r
- uint64 key;\r
- int i;\r
-\r
- ASSERT((flags&~0xF)==0);\r
-\r
- key = 0;\r
-\r
- for (i = 0; i < 4; i++) {\r
- if ((flags & (1<<i)) != 0) key ^= random_64(RandomCastle+i);\r
- }\r
-\r
- return key;\r
-}\r
-\r
-// hash_ep_key()\r
-\r
-uint64 hash_ep_key(int square) {\r
-\r
- ASSERT(square_is_ok(square));\r
-\r
- return random_64(RandomEnPassant+square_file(square));\r
-}\r
-\r
-// hash_turn_key()\r
-\r
-uint64 hash_turn_key(int colour) {\r
-\r
- ASSERT(colour_is_ok(colour));\r
-\r
- return (colour_is_white(colour)) ? random_64(RandomTurn) : 0;\r
-}\r
-\r
-// end of hash.cpp\r
-\r
+
+// hash.c
+
+// includes
+
+#include "board.h"
+#include "hash.h"
+#include "piece.h"
+#include "random.h"
+#include "square.h"
+#include "util.h"
+
+// variables
+
+static uint64 Castle64[16];
+
+// prototypes
+
+static uint64 hash_castle_key_debug (int flags);
+
+// functions
+
+// hash_init()
+
+void hash_init() {
+
+ int i;
+
+ for (i = 0; i < 16; i++) Castle64[i] = hash_castle_key_debug(i);
+}
+
+// hash_key()
+
+uint64 hash_key(const board_t * board) {
+
+ uint64 key;
+ int colour;
+ const uint8 * ptr;
+ int sq, piece;
+
+ ASSERT(board_is_ok(board));
+
+ // init
+
+ key = 0;
+
+ // pieces
+
+ for (colour = 1; colour <= 2; colour++) { // HACK
+ for (ptr = board->list[colour]; (sq=*ptr) != SquareNone; ptr++) {
+ piece = board->square[sq];
+ key ^= hash_piece_key(piece,sq);
+ }
+ }
+
+ // castle flags
+
+ key ^= hash_castle_key(board_flags(board));
+
+ // en-passant square
+
+ sq = board->ep_square;
+ if (sq != SquareNone) key ^= hash_ep_key(sq);
+
+ // turn
+
+ key ^= hash_turn_key(board->turn);
+
+ return key;
+}
+
+// hash_piece_key()
+
+uint64 hash_piece_key(int piece, int square) {
+
+ ASSERT(piece_is_ok(piece));
+ ASSERT(square_is_ok(square));
+
+ return random_64(RandomPiece+piece_to_12(piece)*64+square_to_64(square));
+}
+
+// hash_castle_key()
+
+uint64 hash_castle_key(int flags) {
+
+ ASSERT((flags&~0xF)==0);
+
+ return Castle64[flags];
+}
+
+// hash_castle_key_debug()
+
+static uint64 hash_castle_key_debug(int flags) {
+
+ uint64 key;
+ int i;
+
+ ASSERT((flags&~0xF)==0);
+
+ key = 0;
+
+ for (i = 0; i < 4; i++) {
+ if ((flags & (1<<i)) != 0) key ^= random_64(RandomCastle+i);
+ }
+
+ return key;
+}
+
+// hash_ep_key()
+
+uint64 hash_ep_key(int square) {
+
+ ASSERT(square_is_ok(square));
+
+ return random_64(RandomEnPassant+square_file(square));
+}
+
+// hash_turn_key()
+
+uint64 hash_turn_key(int colour) {
+
+ ASSERT(colour_is_ok(colour));
+
+ return (colour_is_white(colour)) ? random_64(RandomTurn) : 0;
+}
+
+// end of hash.cpp
+
-\r
-// hash.h\r
-\r
-#ifndef HASH_H\r
-#define HASH_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define RandomPiece 0\r
-// 12 * 64\r
-#define RandomCastle 768\r
-// 4\r
-#define RandomEnPassant 772\r
-// 8\r
-#define RandomTurn 780\r
-// 1\r
-\r
-// functions\r
-\r
-extern void hash_init ();\r
-\r
-extern uint64 hash_key (const board_t * board);\r
-\r
-extern uint64 hash_piece_key (int piece, int square);\r
-extern uint64 hash_castle_key (int flags);\r
-extern uint64 hash_ep_key (int square);\r
-extern uint64 hash_turn_key (int colour);\r
-\r
-extern uint64 hash_random_64 (int index);\r
-\r
-#endif // !defined HASH_H\r
-\r
-// end of hash.h\r
-\r
+
+// hash.h
+
+#ifndef HASH_H
+#define HASH_H
+
+// includes
+
+#include "board.h"
+#include "util.h"
+
+// defines
+
+#define RandomPiece 0
+// 12 * 64
+#define RandomCastle 768
+// 4
+#define RandomEnPassant 772
+// 8
+#define RandomTurn 780
+// 1
+
+// functions
+
+extern void hash_init ();
+
+extern uint64 hash_key (const board_t * board);
+
+extern uint64 hash_piece_key (int piece, int square);
+extern uint64 hash_castle_key (int flags);
+extern uint64 hash_ep_key (int square);
+extern uint64 hash_turn_key (int colour);
+
+extern uint64 hash_random_64 (int index);
+
+#endif // !defined HASH_H
+
+// end of hash.h
+
#include "util.h"
#include "errno.h"
-// macros
-
-#define StringSize ((int) 4096)
-
// types
typedef enum {
static const bool UseDebug = FALSE;
static const bool UseCR = FALSE;
-static const int StringSize = 4096;
-
static const char LF = '\n';
static const char CR = '\r';
-\r
-// io.h\r
-\r
-#ifndef IO_H\r
-#define IO_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// defined\r
-\r
-#define BufferSize 16384\r
-\r
-// types\r
-\r
-typedef struct {\r
-\r
- int in_fd;\r
- int out_fd;\r
-\r
- const char * name;\r
-\r
- bool in_eof;\r
-\r
- sint32 in_size;\r
- sint32 out_size;\r
-\r
- char in_buffer[BufferSize];\r
- char out_buffer[BufferSize];\r
-} io_t;\r
-\r
-// functions\r
-\r
-extern bool io_is_ok (const io_t * io);\r
-\r
-extern void io_init (io_t * io);\r
-extern void io_close (io_t * io);\r
-\r
-extern void io_get_update (io_t * io);\r
-\r
-extern bool io_peek (io_t * io);\r
-\r
-extern bool io_line_ready (const io_t * io);\r
-extern bool io_get_line (io_t * io, char string[], int size);\r
-\r
-extern void io_send (io_t * io, const char format[], ...);\r
-extern void io_send_queue (io_t * io, const char format[], ...);\r
-\r
-#endif // !defined IO_H\r
-\r
-// end of io.h\r
-\r
+
+// io.h
+
+#ifndef IO_H
+#define IO_H
+
+// includes
+
+#include "util.h"
+
+// defined
+
+#define BufferSize 16384
+
+// types
+
+typedef struct {
+
+ int in_fd;
+ int out_fd;
+
+ const char * name;
+
+ bool in_eof;
+
+ sint32 in_size;
+ sint32 out_size;
+
+ char in_buffer[BufferSize];
+ char out_buffer[BufferSize];
+} io_t;
+
+// functions
+
+extern bool io_is_ok (const io_t * io);
+
+extern void io_init (io_t * io);
+extern void io_close (io_t * io);
+
+extern void io_get_update (io_t * io);
+
+extern bool io_peek (io_t * io);
+
+extern bool io_line_ready (const io_t * io);
+extern bool io_get_line (io_t * io, char string[], int size);
+
+extern void io_send (io_t * io, const char format[], ...);
+extern void io_send_queue (io_t * io, const char format[], ...);
+
+#endif // !defined IO_H
+
+// end of io.h
+
-\r
-// line.c\r
-\r
-// includes\r
-\r
-#include <string.h>\r
-\r
-#include "board.h"\r
-#include "line.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_legal.h"\r
-#include "san.h"\r
-#include "util.h"\r
-\r
-// constants\r
-\r
-static const bool Strict = FALSE; // FALSE\r
-static const bool UseDebug = FALSE; // FALSE\r
-\r
-#define StringSize ((int)1024)\r
-\r
-// functions\r
-\r
-// line_is_ok()\r
-\r
-bool line_is_ok(const move_t line[]) {\r
-\r
- int move;\r
-\r
- if (line == NULL) return FALSE;\r
-\r
- while ((move = *line++) != MoveNone) {\r
- if (!move_is_ok(move)) return FALSE;\r
- }\r
-\r
- return TRUE;\r
-}\r
-\r
-// line_clear()\r
-\r
-void line_clear(move_t line[]) {\r
-\r
- ASSERT(line!=NULL);\r
-\r
- *line = MoveNone;\r
-}\r
-\r
-// line_copy()\r
-\r
-void line_copy(move_t dst[], const move_t src[]) {\r
-\r
- ASSERT(dst!=NULL);\r
- ASSERT(src!=NULL);\r
-\r
- ASSERT(dst!=src);\r
-\r
- while ((*dst++ = *src++) != MoveNone)\r
- ;\r
-}\r
-\r
-// line_from_can()\r
-\r
-bool line_from_can (move_t line[], const board_t * board, const char string[], int size) {\r
-\r
- int pos;\r
- char new_string[StringSize], *p;\r
- int move;\r
- board_t new_board[1];\r
-\r
- ASSERT(line!=NULL);\r
- ASSERT(board_is_ok(board));\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=LineSize);\r
-\r
- // init\r
-\r
- pos = 0;\r
- board_copy(new_board,board);\r
-\r
- // loop\r
-\r
- strcpy(new_string,string); // HACK\r
-\r
- for (p = strtok(new_string," "); p != NULL; p = strtok(NULL," ")) {\r
-\r
- move = move_from_can(p,new_board);\r
-\r
- ASSERT(move!=MoveNone);\r
- ASSERT(move_is_legal(move,new_board));\r
-\r
- if (move == MoveNone || !move_is_legal(move,new_board)) break; // HACK: ignore illegal moves\r
-\r
- if (pos >= size) return FALSE;\r
- line[pos++] = move;\r
-\r
- move_do(new_board,move);\r
- }\r
-\r
- if (pos >= size) return FALSE;\r
- line[pos] = MoveNone;\r
-\r
- return TRUE;\r
-}\r
-\r
-// line_to_can()\r
-\r
-bool line_to_can(const move_t line[], const board_t * board, char string[], int size) {\r
-\r
- board_t new_board[1];\r
- int pos;\r
- int move;\r
-\r
- ASSERT(line_is_ok(line));\r
- ASSERT(board_is_ok(board));\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=StringSize);\r
-\r
- // init\r
-\r
- if (size < StringSize) return FALSE;\r
-\r
- board_copy(new_board,board);\r
- pos = 0;\r
-\r
- // loop\r
-\r
- while ((move = *line++) != MoveNone) {\r
-\r
- if (pos != 0) {\r
- if (pos >= size) return FALSE;\r
- string[pos++] = ' ';\r
- }\r
-\r
- if (!move_to_can(move,new_board,&string[pos],size-pos)) return FALSE;\r
- pos += strlen(&string[pos]);\r
-\r
- move_do(new_board,move);\r
- }\r
-\r
- if (pos >= size) return FALSE;\r
- string[pos] = '\0';\r
-\r
- return TRUE;\r
-}\r
-\r
-// line_to_san()\r
-\r
-bool line_to_san(const move_t line[], const board_t * board, char string[], int size) {\r
-\r
- board_t new_board[1];\r
- int pos;\r
- int move;\r
- char move_string[256];\r
-\r
- ASSERT(line_is_ok(line));\r
- ASSERT(board_is_ok(board));\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=StringSize);\r
-\r
- // init\r
-\r
- if (size < StringSize) return FALSE;\r
-\r
- board_copy(new_board,board);\r
- pos = 0;\r
-\r
- // loop\r
-\r
- while ((move = *line++) != MoveNone) {\r
-\r
- if (pos != 0) {\r
- if (pos >= size) return FALSE;\r
- string[pos++] = ' ';\r
- }\r
-\r
- if (!move_is_legal(move,new_board)\r
- || !move_to_san(move,new_board,&string[pos],size-pos)) {\r
-\r
- if (Strict || UseDebug) {\r
-\r
- move_to_can(move,new_board,move_string,256);\r
- my_log("POLYGLOT ILLEGAL MOVE IN LINE %s\n",move_string);\r
-\r
- board_disp(new_board);\r
- }\r
-\r
- if (Strict) my_fatal("line_to_san(): illegal move\n");\r
-\r
- break;\r
- }\r
-\r
- pos += strlen(&string[pos]);\r
-\r
- move_do(new_board,move);\r
- }\r
-\r
- if (pos >= size) return FALSE;\r
- string[pos] = '\0';\r
-\r
- return TRUE;\r
-}\r
-\r
-// end of line.cpp\r
-\r
+
+// line.c
+
+// includes
+
+#include <string.h>
+
+#include "board.h"
+#include "line.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_legal.h"
+#include "san.h"
+#include "util.h"
+
+// constants
+
+static const bool Strict = FALSE; // FALSE
+static const bool UseDebug = FALSE; // FALSE
+
+// functions
+
+// line_is_ok()
+
+bool line_is_ok(const move_t line[]) {
+
+ int move;
+
+ if (line == NULL) return FALSE;
+
+ while ((move = *line++) != MoveNone) {
+ if (!move_is_ok(move)) return FALSE;
+ }
+
+ return TRUE;
+}
+
+// line_clear()
+
+void line_clear(move_t line[]) {
+
+ ASSERT(line!=NULL);
+
+ *line = MoveNone;
+}
+
+// line_copy()
+
+void line_copy(move_t dst[], const move_t src[]) {
+
+ ASSERT(dst!=NULL);
+ ASSERT(src!=NULL);
+
+ ASSERT(dst!=src);
+
+ while ((*dst++ = *src++) != MoveNone)
+ ;
+}
+
+// line_from_can()
+
+bool line_from_can (move_t line[], const board_t * board, const char string[], int size) {
+
+ int pos;
+ char new_string[StringSize], *p;
+ int move;
+ board_t new_board[1];
+
+ ASSERT(line!=NULL);
+ ASSERT(board_is_ok(board));
+ ASSERT(string!=NULL);
+ ASSERT(size>=LineSize);
+
+ // init
+
+ pos = 0;
+ board_copy(new_board,board);
+
+ // loop
+
+ strcpy(new_string,string); // HACK
+
+ for (p = strtok(new_string," "); p != NULL; p = strtok(NULL," ")) {
+
+ move = move_from_can(p,new_board);
+
+ ASSERT(move!=MoveNone);
+ ASSERT(move_is_legal(move,new_board));
+
+ if (move == MoveNone || !move_is_legal(move,new_board)) break; // HACK: ignore illegal moves
+
+ if (pos >= size) return FALSE;
+ line[pos++] = move;
+
+ move_do(new_board,move);
+ }
+
+ if (pos >= size) return FALSE;
+ line[pos] = MoveNone;
+
+ return TRUE;
+}
+
+// line_to_can()
+
+bool line_to_can(const move_t line[], const board_t * board, char string[], int size) {
+
+ board_t new_board[1];
+ int pos;
+ int move;
+
+ ASSERT(line_is_ok(line));
+ ASSERT(board_is_ok(board));
+ ASSERT(string!=NULL);
+ ASSERT(size>=StringSize);
+
+ // init
+
+ if (size < StringSize) return FALSE;
+
+ board_copy(new_board,board);
+ pos = 0;
+
+ // loop
+
+ while ((move = *line++) != MoveNone) {
+
+ if (pos != 0) {
+ if (pos >= size) return FALSE;
+ string[pos++] = ' ';
+ }
+
+ if (!move_to_can(move,new_board,&string[pos],size-pos)) return FALSE;
+ pos += strlen(&string[pos]);
+
+ move_do(new_board,move);
+ }
+
+ if (pos >= size) return FALSE;
+ string[pos] = '\0';
+
+ return TRUE;
+}
+
+// line_to_san()
+
+bool line_to_san(const move_t line[], const board_t * board, char string[], int size) {
+
+ board_t new_board[1];
+ int pos;
+ int move;
+ char move_string[256];
+
+ ASSERT(line_is_ok(line));
+ ASSERT(board_is_ok(board));
+ ASSERT(string!=NULL);
+ ASSERT(size>=StringSize);
+
+ // init
+
+ if (size < StringSize) return FALSE;
+
+ board_copy(new_board,board);
+ pos = 0;
+
+ // loop
+
+ while ((move = *line++) != MoveNone) {
+
+ if (pos != 0) {
+ if (pos >= size) return FALSE;
+ string[pos++] = ' ';
+ }
+
+ if (!move_is_legal(move,new_board)
+ || !move_to_san(move,new_board,&string[pos],size-pos)) {
+
+ if (Strict || UseDebug) {
+
+ move_to_can(move,new_board,move_string,256);
+ my_log("POLYGLOT ILLEGAL MOVE IN LINE %s\n",move_string);
+
+ board_disp(new_board);
+ }
+
+ if (Strict) my_fatal("line_to_san(): illegal move\n");
+
+ break;
+ }
+
+ pos += strlen(&string[pos]);
+
+ move_do(new_board,move);
+ }
+
+ if (pos >= size) return FALSE;
+ string[pos] = '\0';
+
+ return TRUE;
+}
+
+// end of line.cpp
+
-\r
-// line.h\r
-\r
-#ifndef LINE_H\r
-#define LINE_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "move.h"\r
-#include "util.h"\r
-\r
-// constants\r
-\r
-#define LineSize 256\r
-\r
-// functions\r
-\r
-extern bool line_is_ok (const move_t line[]);\r
-\r
-extern void line_clear (move_t line[]);\r
-extern void line_copy (move_t dst[], const move_t src[]);\r
-\r
-extern bool line_from_can (move_t line[], const board_t * board, const char string[], int size);\r
-\r
-extern bool line_to_can (const move_t line[], const board_t * board, char string[], int size);\r
-extern bool line_to_san (const move_t line[], const board_t * board, char string[], int size);\r
-\r
-#endif // !defined LINE_H\r
-\r
-// end of line.h\r
-\r
+
+// line.h
+
+#ifndef LINE_H
+#define LINE_H
+
+// includes
+
+#include "board.h"
+#include "move.h"
+#include "util.h"
+
+// constants
+
+#define LineSize 256
+
+// functions
+
+extern bool line_is_ok (const move_t line[]);
+
+extern void line_clear (move_t line[]);
+extern void line_copy (move_t dst[], const move_t src[]);
+
+extern bool line_from_can (move_t line[], const board_t * board, const char string[], int size);
+
+extern bool line_to_can (const move_t line[], const board_t * board, char string[], int size);
+extern bool line_to_san (const move_t line[], const board_t * board, char string[], int size);
+
+#endif // !defined LINE_H
+
+// end of line.h
+
-\r
-// list.c\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "list.h"\r
-#include "move.h"\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-// list_is_ok()\r
-\r
-bool list_is_ok(const list_t * list) {\r
-\r
- if (list == NULL) return FALSE;\r
-\r
- if (list->size >= ListSize) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// list_clear()\r
-\r
-void list_clear(list_t * list) {\r
-\r
- ASSERT(list!=NULL);\r
-\r
- list->size = 0;\r
-}\r
-\r
-// list_add\r
-\r
-void list_add(list_t * list, int move){\r
- list_add_ex(list, move, 0);\r
-}\r
-\r
-// list_add_ex()\r
-\r
-void list_add_ex(list_t * list, int move, int value) {\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(move_is_ok(move));\r
- ASSERT(value>=-32767&&value<=+32767);\r
-\r
- ASSERT(list->size<ListSize-1);\r
-\r
- list->move[list->size] = move;\r
- list->value[list->size] = value;\r
- list->size++;\r
-}\r
-\r
-// list_remove()\r
-\r
-void list_remove(list_t * list, int index) {\r
-\r
- int i;\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(index>=0&&index<list->size);\r
-\r
- for (i = index; i < list->size-1; i++) {\r
- list->move[i] = list->move[i+1];\r
- list->value[i] = list->value[i+1];\r
- }\r
-\r
- list->size--;\r
-}\r
-\r
-// list_is_empty()\r
-\r
-bool list_is_empty(const list_t * list) {\r
-\r
- ASSERT(list_is_ok(list));\r
-\r
- return list->size == 0;\r
-}\r
-\r
-// list_size()\r
-\r
-int list_size(const list_t * list) {\r
-\r
- ASSERT(list_is_ok(list));\r
-\r
- return list->size;\r
-}\r
-\r
-// list_move()\r
-\r
-int list_move(const list_t * list, int index) {\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(index>=0&&index<list->size);\r
-\r
- return list->move[index];\r
-}\r
-\r
-// list_value()\r
-\r
-int list_value(const list_t * list, int index) {\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(index>=0&&index<list->size);\r
-\r
- return list->value[index];\r
-}\r
-\r
-// list_copy()\r
-\r
-void list_copy(list_t * dst, const list_t * src) {\r
-\r
- int i;\r
-\r
- ASSERT(dst!=NULL);\r
- ASSERT(list_is_ok(src));\r
-\r
- dst->size = src->size;\r
-\r
- for (i = 0; i < src->size; i++) {\r
- dst->move[i] = src->move[i];\r
- dst->value[i] = src->value[i];\r
- }\r
-}\r
-\r
-// list_move_to_front()\r
-\r
-void list_move_to_front(list_t * list, int index) {\r
-\r
- int i;\r
- int move, value;\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(index>=0&&index<list->size);\r
-\r
- if (index != 0) {\r
-\r
- move = list->move[index];\r
- value = list->value[index];\r
-\r
- for (i = index; i > 0; i--) {\r
- list->move[i] = list->move[i-1];\r
- list->value[i] = list->value[i-1];\r
- }\r
-\r
- list->move[0] = move;\r
- list->value[0] = value;\r
- }\r
-}\r
-\r
-// list_note()\r
-\r
-void list_note(list_t * list) {\r
-\r
- int i, move;\r
-\r
- ASSERT(list_is_ok(list));\r
-\r
- for (i = 0; i < list->size; i++) {\r
- move = list->move[i];\r
- ASSERT(move_is_ok(move));\r
- list->value[i] = -move_order(move);\r
- }\r
-}\r
-\r
-// list_sort()\r
-\r
-void list_sort(list_t * list) {\r
-\r
- int i, j;\r
- int best_index, best_move, best_value;\r
-\r
- ASSERT(list_is_ok(list));\r
-\r
- for (i = 0; i < list->size-1; i++) {\r
-\r
- best_index = i;\r
- best_value = list->value[i];\r
-\r
- for (j = i+1; j < list->size; j++) {\r
- if (list->value[j] > best_value) {\r
- best_index = j;\r
- best_value = list->value[j];\r
- }\r
- }\r
-\r
- if (best_index != i) {\r
-\r
- best_move = list->move[best_index];\r
- ASSERT(best_value==list->value[best_index]);\r
-\r
- for (j = best_index; j > i; j--) {\r
- list->move[j] = list->move[j-1];\r
- list->value[j] = list->value[j-1];\r
- }\r
-\r
- list->move[i] = best_move;\r
- list->value[i] = best_value;\r
- }\r
- }\r
-\r
- if (DEBUG) {\r
- for (i = 0; i < list->size-1; i++) {\r
- ASSERT(list->value[i]>=list->value[i+1]);\r
- }\r
- }\r
-}\r
-\r
-// list_contain()\r
-\r
-bool list_contain(const list_t * list, int move) {\r
-\r
- int i;\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(move_is_ok(move));\r
-\r
- for (i = 0; i < list->size; i++) {\r
- if (list->move[i] == move) return TRUE;\r
- }\r
-\r
- return FALSE;\r
-}\r
-\r
-// list_equal()\r
-\r
-bool list_equal(list_t * list_1, list_t * list_2) {\r
-\r
- list_t copy_1[1], copy_2[1];\r
- int i;\r
-\r
- ASSERT(list_is_ok(list_1));\r
- ASSERT(list_is_ok(list_2));\r
-\r
- if (list_1->size != list_2->size) return FALSE;\r
-\r
- list_copy(copy_1,list_1);\r
- list_note(copy_1);\r
- list_sort(copy_1);\r
-\r
- list_copy(copy_2,list_2);\r
- list_note(copy_2);\r
- list_sort(copy_2);\r
-\r
- for (i = 0; i < copy_1->size; i++) {\r
- if (copy_1->move[i] != copy_2->move[i]) return FALSE;\r
- }\r
-\r
- return TRUE;\r
-}\r
-\r
-// list_disp()\r
-\r
-void list_disp(const list_t * list, const board_t * board) {\r
-\r
- int i, move, value;\r
- char string[256];\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(board_is_ok(board));\r
-\r
- for (i = 0; i < list->size; i++) {\r
-\r
- move = list->move[i];\r
- value = list->value[i];\r
-\r
- if (!move_to_can(move,board,string,256)) ASSERT(FALSE);\r
- my_log("POLYGLOT %-5s %04X %+4d\n",string,move,value);\r
- }\r
-\r
- my_log("POLYGLOT\n");\r
-}\r
-\r
-// end of list.cpp\r
-\r
+
+// list.c
+
+// includes
+
+#include "board.h"
+#include "list.h"
+#include "move.h"
+#include "util.h"
+
+// functions
+
+// list_is_ok()
+
+bool list_is_ok(const list_t * list) {
+
+ if (list == NULL) return FALSE;
+
+ if (list->size >= ListSize) return FALSE;
+
+ return TRUE;
+}
+
+// list_clear()
+
+void list_clear(list_t * list) {
+
+ ASSERT(list!=NULL);
+
+ list->size = 0;
+}
+
+// list_add
+
+void list_add(list_t * list, int move){
+ list_add_ex(list, move, 0);
+}
+
+// list_add_ex()
+
+void list_add_ex(list_t * list, int move, int value) {
+
+ ASSERT(list_is_ok(list));
+ ASSERT(move_is_ok(move));
+ ASSERT(value>=-32767&&value<=+32767);
+
+ ASSERT(list->size<ListSize-1);
+
+ list->move[list->size] = move;
+ list->value[list->size] = value;
+ list->size++;
+}
+
+// list_remove()
+
+void list_remove(list_t * list, int index) {
+
+ int i;
+
+ ASSERT(list_is_ok(list));
+ ASSERT(index>=0&&index<list->size);
+
+ for (i = index; i < list->size-1; i++) {
+ list->move[i] = list->move[i+1];
+ list->value[i] = list->value[i+1];
+ }
+
+ list->size--;
+}
+
+// list_is_empty()
+
+bool list_is_empty(const list_t * list) {
+
+ ASSERT(list_is_ok(list));
+
+ return list->size == 0;
+}
+
+// list_size()
+
+int list_size(const list_t * list) {
+
+ ASSERT(list_is_ok(list));
+
+ return list->size;
+}
+
+// list_move()
+
+int list_move(const list_t * list, int index) {
+
+ ASSERT(list_is_ok(list));
+ ASSERT(index>=0&&index<list->size);
+
+ return list->move[index];
+}
+
+// list_value()
+
+int list_value(const list_t * list, int index) {
+
+ ASSERT(list_is_ok(list));
+ ASSERT(index>=0&&index<list->size);
+
+ return list->value[index];
+}
+
+// list_copy()
+
+void list_copy(list_t * dst, const list_t * src) {
+
+ int i;
+
+ ASSERT(dst!=NULL);
+ ASSERT(list_is_ok(src));
+
+ dst->size = src->size;
+
+ for (i = 0; i < src->size; i++) {
+ dst->move[i] = src->move[i];
+ dst->value[i] = src->value[i];
+ }
+}
+
+// list_move_to_front()
+
+void list_move_to_front(list_t * list, int index) {
+
+ int i;
+ int move, value;
+
+ ASSERT(list_is_ok(list));
+ ASSERT(index>=0&&index<list->size);
+
+ if (index != 0) {
+
+ move = list->move[index];
+ value = list->value[index];
+
+ for (i = index; i > 0; i--) {
+ list->move[i] = list->move[i-1];
+ list->value[i] = list->value[i-1];
+ }
+
+ list->move[0] = move;
+ list->value[0] = value;
+ }
+}
+
+// list_note()
+
+void list_note(list_t * list) {
+
+ int i, move;
+
+ ASSERT(list_is_ok(list));
+
+ for (i = 0; i < list->size; i++) {
+ move = list->move[i];
+ ASSERT(move_is_ok(move));
+ list->value[i] = -move_order(move);
+ }
+}
+
+// list_sort()
+
+void list_sort(list_t * list) {
+
+ int i, j;
+ int best_index, best_move, best_value;
+
+ ASSERT(list_is_ok(list));
+
+ for (i = 0; i < list->size-1; i++) {
+
+ best_index = i;
+ best_value = list->value[i];
+
+ for (j = i+1; j < list->size; j++) {
+ if (list->value[j] > best_value) {
+ best_index = j;
+ best_value = list->value[j];
+ }
+ }
+
+ if (best_index != i) {
+
+ best_move = list->move[best_index];
+ ASSERT(best_value==list->value[best_index]);
+
+ for (j = best_index; j > i; j--) {
+ list->move[j] = list->move[j-1];
+ list->value[j] = list->value[j-1];
+ }
+
+ list->move[i] = best_move;
+ list->value[i] = best_value;
+ }
+ }
+
+ if (DEBUG) {
+ for (i = 0; i < list->size-1; i++) {
+ ASSERT(list->value[i]>=list->value[i+1]);
+ }
+ }
+}
+
+// list_contain()
+
+bool list_contain(const list_t * list, int move) {
+
+ int i;
+
+ ASSERT(list_is_ok(list));
+ ASSERT(move_is_ok(move));
+
+ for (i = 0; i < list->size; i++) {
+ if (list->move[i] == move) return TRUE;
+ }
+
+ return FALSE;
+}
+
+// list_equal()
+
+bool list_equal(list_t * list_1, list_t * list_2) {
+
+ list_t copy_1[1], copy_2[1];
+ int i;
+
+ ASSERT(list_is_ok(list_1));
+ ASSERT(list_is_ok(list_2));
+
+ if (list_1->size != list_2->size) return FALSE;
+
+ list_copy(copy_1,list_1);
+ list_note(copy_1);
+ list_sort(copy_1);
+
+ list_copy(copy_2,list_2);
+ list_note(copy_2);
+ list_sort(copy_2);
+
+ for (i = 0; i < copy_1->size; i++) {
+ if (copy_1->move[i] != copy_2->move[i]) return FALSE;
+ }
+
+ return TRUE;
+}
+
+// list_disp()
+
+void list_disp(const list_t * list, const board_t * board) {
+
+ int i, move, value;
+ char string[256];
+
+ ASSERT(list_is_ok(list));
+ ASSERT(board_is_ok(board));
+
+ for (i = 0; i < list->size; i++) {
+
+ move = list->move[i];
+ value = list->value[i];
+
+ if (!move_to_can(move,board,string,256)) ASSERT(FALSE);
+ my_log("POLYGLOT %-5s %04X %+4d\n",string,move,value);
+ }
+
+ my_log("POLYGLOT\n");
+}
+
+// end of list.cpp
+
-\r
-// list.h\r
-\r
-#ifndef LIST_H\r
-#define LIST_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "move.h"\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define ListSize 256\r
-\r
-// types\r
-\r
-typedef struct {\r
- sint16 size;\r
- move_t move[ListSize];\r
- sint16 value[ListSize];\r
-} list_t;\r
-\r
-// functions\r
-\r
-extern bool list_is_ok (const list_t * list);\r
-\r
-extern void list_clear (list_t * list);\r
-extern void list_add (list_t * list, int move);\r
-extern void list_add_ex (list_t * list, int move, int value);\r
-\r
-extern void list_remove (list_t * list, int index);\r
-\r
-extern bool list_is_empty (const list_t * list);\r
-extern int list_size (const list_t * list);\r
-\r
-extern int list_move (const list_t * list, int index);\r
-extern int list_value (const list_t * list, int index);\r
-\r
-extern void list_copy (list_t * dst, const list_t * src);\r
-\r
-extern void list_note (list_t * list);\r
-extern void list_sort (list_t * list);\r
-\r
-extern bool list_contain (const list_t * list, int move);\r
-extern bool list_equal (list_t * list_1, list_t * list_2);\r
-\r
-extern void list_disp (const list_t * list, const board_t * board);\r
-\r
-#endif // !defined LIST_H\r
-\r
-// end of list.h\r
-\r
+
+// list.h
+
+#ifndef LIST_H
+#define LIST_H
+
+// includes
+
+#include "board.h"
+#include "move.h"
+#include "util.h"
+
+// defines
+
+#define ListSize 256
+
+// types
+
+typedef struct {
+ sint16 size;
+ move_t move[ListSize];
+ sint16 value[ListSize];
+} list_t;
+
+// functions
+
+extern bool list_is_ok (const list_t * list);
+
+extern void list_clear (list_t * list);
+extern void list_add (list_t * list, int move);
+extern void list_add_ex (list_t * list, int move, int value);
+
+extern void list_remove (list_t * list, int index);
+
+extern bool list_is_empty (const list_t * list);
+extern int list_size (const list_t * list);
+
+extern int list_move (const list_t * list, int index);
+extern int list_value (const list_t * list, int index);
+
+extern void list_copy (list_t * dst, const list_t * src);
+
+extern void list_note (list_t * list);
+extern void list_sort (list_t * list);
+
+extern bool list_contain (const list_t * list, int move);
+extern bool list_equal (list_t * list_1, list_t * list_2);
+
+extern void list_disp (const list_t * list, const board_t * board);
+
+#endif // !defined LIST_H
+
+// end of list.h
+
-\r
-// main.c\r
-\r
-// includes\r
-\r
-#include <errno.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-#include <time.h>\r
-\r
-#include "attack.h"\r
-#include "board.h"\r
-#include "book.h"\r
-#include "book_make.h"\r
-#include "book_merge.h"\r
-#include "engine.h"\r
-#include "epd.h"\r
-#include "fen.h"\r
-#include "gui.h"\r
-#include "hash.h"\r
-#include "list.h"\r
-#include "main.h"\r
-#include "mainloop.h"\r
-#include "move.h"\r
-#include "move_gen.h"\r
-#include "option.h"\r
-#include "piece.h"\r
-#include "search.h"\r
-#include "square.h"\r
-#include "uci.h"\r
-#include "util.h"\r
-#include "xboard2uci.h"\r
-#include "uci2uci.h"\r
-#include "ini.h"\r
-#include "util.h"\r
-\r
-\r
-// constants\r
-\r
-\r
-static const char * const Version = "1.4.61b";\r
-static const char * const HelpMessage = "\\r
-SYNTAX\n\\r
-* polyglot [configfile] [-noini] [-ec engine] [-ed enginedirectory] [-en enginename] [-log true/false] [-lf logfile] [-pg <name>=<value>]* [-uci <name>=<value>]*\n\\r
-* polyglot make-book [-pgn inputfile] [-bin outputfile] [-max-ply ply] [-min-game games] [-min-score score] [-only-white] [-only-black] [-uniform]\n\\r
-* polyglot merge-book -in1 inputfile1 -in2 inputfile2 [-out outputfile]\n\\r
-* polyglot info-book [-bin inputfile] [-exact]\n\\r
-* polyglot dump-book [-bin inputfile] -color color [-out outputfile]\n\\r
-* polyglot [configfile] epd-test [engineoptions] [-epd inputfile] [-min-depth depth] [-max-depth depth] [-min-time time] [-max-time time] [-depth-delta delta]\n\\r
-* polyglot perft [-fen fen] [-max-depth depth]\\r
-";\r
-\r
-static const int SearchDepth = 63;\r
-static const double SearchTime = 3600.0;\r
-static const int StringSize = 4096;\r
-\r
-// variables\r
-\r
-static bool Init;\r
-\r
-// prototypes\r
-\r
-static void stop_search ();\r
-\r
-// functions\r
-\r
-// arg_shift_left()\r
-\r
-static void arg_shift_left(char **argv, int index){\r
- int i;\r
- for(i=index; argv[i]!=NULL; i++){\r
- argv[i]=argv[i+1];\r
- }\r
-}\r
-\r
-// parse_args()\r
-\r
-static void parse_args(ini_t *ini, char **argv){\r
- int arg_index;\r
- char *arg;\r
- arg_index=0;\r
- while((arg=argv[arg_index])){\r
- if(my_string_equal(arg,"-ec") && argv[arg_index+1]){\r
- ini_insert_ex(ini,"PolyGlot","EngineCommand",argv[arg_index+1]);\r
- arg_shift_left(argv,arg_index);\r
- arg_shift_left(argv,arg_index);\r
- continue;\r
- }if(my_string_equal(arg,"-ed") && argv[arg_index+1]){\r
- ini_insert_ex(ini,"PolyGlot","EngineDir",argv[arg_index+1]);\r
- arg_shift_left(argv,arg_index);\r
- arg_shift_left(argv,arg_index);\r
- continue;\r
- }\r
- if(my_string_equal(arg,"-en") && argv[arg_index+1]){\r
- ini_insert_ex(ini,"PolyGlot","EngineName",argv[arg_index+1]);\r
- arg_shift_left(argv,arg_index);\r
- arg_shift_left(argv,arg_index);\r
- continue;\r
- }\r
- if(my_string_equal(arg,"-log") &&\r
- argv[arg_index+1] &&\r
- IS_BOOL(argv[arg_index+1])){\r
- ini_insert_ex(ini,\r
- "PolyGlot",\r
- "Log",\r
- TO_BOOL(argv[arg_index+1])?"true":"false");\r
- arg_shift_left(argv,arg_index);\r
- arg_shift_left(argv,arg_index);\r
- continue;\r
- }\r
- if(my_string_equal(arg,"-lf") && argv[arg_index+1]){\r
- ini_insert_ex(ini,"PolyGlot","LogFile",argv[arg_index+1]);\r
- arg_shift_left(argv,arg_index);\r
- arg_shift_left(argv,arg_index);\r
- continue;\r
- }\r
- if(my_string_equal(arg,"-wb") &&\r
- argv[arg_index+1]&&\r
- IS_BOOL(argv[arg_index+1])){\r
- ini_insert_ex(ini,"PolyGlot",\r
- "OnlyWbOptions",\r
- TO_BOOL(argv[arg_index+1])?"true":"false");\r
- arg_shift_left(argv,arg_index);\r
- arg_shift_left(argv,arg_index);\r
- continue;\r
- }\r
- if((my_string_equal(arg,"-pg")||my_string_equal(arg,"-uci")) &&\r
- argv[arg_index+1]){\r
- int ret;\r
- char section[StringSize];\r
- char name[StringSize];\r
- char value[StringSize];\r
- ret=ini_line_parse(argv[arg_index+1],section,name,value);\r
- if(ret==NAME_VALUE){\r
- if(my_string_equal(arg,"-pg")){\r
- ini_insert_ex(ini,"PolyGlot",name,value);\r
- }else{\r
- ini_insert_ex(ini,"Engine",name,value);\r
- }\r
- }\r
- arg_shift_left(argv,arg_index);\r
- arg_shift_left(argv,arg_index);\r
- continue;\r
- }\r
- arg_index++;\r
- }\r
-}\r
-\r
-\r
-// make_ini()\r
-\r
-static void make_ini(ini_t *ini){\r
- option_t *opt;\r
- ini_insert_ex(ini,"polyglot",\r
- "EngineCommand",\r
- option_get(Option,"EngineCommand"));\r
- ini_insert_ex(ini,"polyglot",\r
- "EngineDir",\r
- option_get(Option,"EngineDir"));\r
- option_start_iter(Option);\r
- while((opt=option_next(Option))){\r
- if(my_string_case_equal(opt->name,"SettingsFile")) continue;\r
- if(my_string_case_equal(opt->name,"EngineCommand")) continue;\r
- if(my_string_case_equal(opt->name,"EngineDir")) continue;\r
- if(!my_string_equal(opt->value,opt->default_)&& !IS_BUTTON(opt->type))\r
- {\r
- ini_insert_ex(ini,"polyglot",opt->name,opt->value);\r
- }\r
- }\r
- option_start_iter(Uci->option);\r
- while((opt=option_next(Uci->option))){\r
- if(!strncmp(opt->name,"UCI_",4) &&\r
- !my_string_case_equal(opt->name,"UCI_LimitStrength") &&\r
- !my_string_case_equal(opt->name,"UCI_Elo"))continue;\r
- if(!my_string_equal(opt->value,opt->default_)&&\r
- !IS_BUTTON(opt->type)){\r
- ini_insert_ex(ini,"engine",opt->name,opt->value);\r
- }\r
- }\r
-}\r
-\r
-\r
-// write_ini()\r
-\r
-static void write_ini(const char *filename,\r
- ini_t *ini){\r
- // TODO Quote, dequote\r
- const char *quote;\r
- ini_entry_t *entry;\r
- char tmp[StringSize];\r
- char tmp1[StringSize];\r
- char tmp2[StringSize];\r
- FILE *f;\r
- time_t t=time(NULL);\r
- f=fopen(filename,"w");\r
- if(!f){\r
- gui_send(GUI,"tellusererror write_ini(): %s: %s.",filename,strerror(errno));\r
- my_log("POLYGLOT write_ini(): %s: %s.\n",filename,strerror(errno));\r
- return;\r
- }\r
- fprintf(f,"; Created: %s\n",ctime(&t));\r
- fprintf(f,"[PolyGlot]\n");\r
- ini_start_iter(ini);\r
- while((entry=ini_next(ini))){\r
- if(my_string_case_equal(entry->section,"polyglot")){\r
- my_quote(tmp1,entry->name,ini_specials);\r
- my_quote(tmp2,entry->value,ini_specials);\r
- snprintf(tmp,sizeof(tmp),"%s=%s\n",\r
- tmp1,\r
- tmp2);\r
- tmp[sizeof(tmp)-1]='\0';\r
- fprintf(f,"%s",tmp);\r
- }\r
- }\r
- fprintf(f,"[Engine]\n");\r
- ini_start_iter(ini);\r
- while((entry=ini_next(ini))){\r
- if(my_string_case_equal(entry->section,"engine")){\r
- my_quote(tmp1,entry->name,ini_specials);\r
- my_quote(tmp2,entry->value,ini_specials);\r
- snprintf(tmp,sizeof(tmp),"%s=%s\n",\r
- tmp1,\r
- tmp2);\r
- tmp[sizeof(tmp)-1]='\0';\r
- fprintf(f,"%s",tmp);\r
- }\r
- }\r
- fclose(f);\r
-}\r
-\r
-// welcome_message()\r
-\r
-void welcome_message(char *buf){\r
- if(!DEBUG){\r
- sprintf(buf,\r
- "PolyGlot %s by Fabien Letouzey.\n",\r
- Version);\r
- }else{\r
- sprintf(buf,\r
- "PolyGlot %s by Fabien Letouzey (debug build).\n",\r
- Version);\r
- }\r
-}\r
-\r
-int wb_select(){\r
- option_t *opt;\r
- option_start_iter(Option);\r
- while((opt=option_next(Option))){\r
- opt->mode&=~XBOARD;\r
- if(opt->mode & XBSEL){\r
- opt->mode|=XBOARD; \r
- }\r
- }\r
-}\r
-\r
-// main()\r
-\r
-int main(int argc, char * argv[]) {\r
- ini_t ini[1], ini_command[1];\r
- ini_entry_t *entry;\r
- char *arg;\r
- int arg_index;\r
- bool NoIni;\r
- option_t *opt;\r
- char welcome[StringSize];\r
-\r
-\r
- welcome_message(welcome);\r
- \r
- printf("%s",welcome);\r
-\r
-\r
- if(argc>=2 && ((my_string_case_equal(argv[1],"help")) || (my_string_case_equal(argv[1],"-help")) || (my_string_case_equal(argv[1],"--help")) || (my_string_case_equal(argv[1],"-h")) || my_string_case_equal(argv[1],"/?"))){\r
- printf("%s\n",HelpMessage);\r
- return EXIT_SUCCESS;\r
- }\r
-\r
- // init\r
-\r
- Init = FALSE;\r
-\r
- gui_init(GUI);\r
-\r
- util_init();\r
- option_init_pg();\r
- \r
- square_init();\r
- piece_init();\r
- attack_init();\r
- \r
- hash_init();\r
-\r
- my_random_init();\r
-\r
- ini_init(ini);\r
- ini_init(ini_command);\r
-\r
- // book utilities: do not touch these\r
- \r
- if (argc >= 2 && my_string_equal(argv[1],"make-book")) {\r
- book_make(argc,argv);\r
- return EXIT_SUCCESS;\r
- }\r
- \r
- if (argc >= 2 && my_string_equal(argv[1],"merge-book")) {\r
- book_merge(argc,argv);\r
- return EXIT_SUCCESS;\r
- }\r
-\r
- if (argc >= 2 && my_string_equal(argv[1],"dump-book")) {\r
- book_dump(argc,argv);\r
- return EXIT_SUCCESS;\r
- }\r
- \r
- if (argc >= 2 && my_string_equal(argv[1],"info-book")) {\r
- book_info(argc,argv);\r
- return EXIT_SUCCESS;\r
- }\r
-\r
- // perft\r
- \r
- if (argc >= 2 && my_string_equal(argv[1],"perft")) {\r
- do_perft(argc,argv);\r
- return EXIT_SUCCESS;\r
- }\r
- \r
- // What is the config file? This is very hacky right now.\r
-\r
- // Do we want a config file at all?\r
-\r
- arg_index=0;\r
- NoIni=FALSE;\r
- while((arg=argv[arg_index++])){\r
- if(my_string_equal(arg,"-noini")){\r
- NoIni=TRUE;\r
- break;\r
- }\r
- }\r
- arg_shift_left(argv,arg_index-1);\r
- parse_args(ini_command,argv+1);\r
- if(NoIni){\r
- option_set(Option,"SettingsFile","<empty>");\r
- }\r
-\r
- // Ok see if first argument looks like config file\r
- \r
- if(argv[1] && !my_string_equal(argv[1],"epd-test") && !(argv[1][0]=='-')){\r
- // first argument must be config file\r
- if(!NoIni){\r
- option_set(Option,"SettingsFile",argv[1]);\r
- }else{\r
- // ignore\r
- }\r
- arg_shift_left(argv,1);\r
- }else{\r
- // Config file is the default.\r
- // This has already been set above or in "option_init_pg()"\r
- }\r
-\r
-\r
-\r
- // if we use a config file: load it!\r
- \r
- if(!my_string_equal(option_get_string(Option,"SettingsFile"),"<empty>")){\r
- if(ini_parse(ini,option_get_string(Option,"SettingsFile"))){\r
- my_fatal("main(): Can't open config file \"%s\": %s\n",\r
- option_get_string(Option,"SettingsFile"),\r
- strerror(errno));\r
- }\r
- }\r
-\r
- // Extract some important options\r
-\r
- if((entry=ini_find(ini,"polyglot","EngineCommand"))){\r
- option_set(Option,entry->name,entry->value);\r
- }\r
- if((entry=ini_find(ini,"polyglot","EngineDir"))){\r
- option_set(Option,entry->name,entry->value);\r
- }\r
- if((entry=ini_find(ini,"polyglot","EngineName"))){\r
- option_set(Option,entry->name,entry->value);\r
- }\r
- if((entry=ini_find(ini,"polyglot","Log"))){\r
- polyglot_set_option(entry->name,entry->value);\r
- }\r
- if((entry=ini_find(ini,"polyglot","LogFile"))){\r
- polyglot_set_option(entry->name,entry->value);\r
- }\r
- \r
- // Concession to WB 4.4.0\r
- // Treat "polyglot_1st.ini" and "polyglot_2nd.ini" specially\r
-\r
- if(option_get_bool(Option,"WbWorkArounds3")){\r
- const char *SettingsFile=option_get(Option,"SettingsFile");\r
- if(strstr(SettingsFile,"polyglot_1st.ini")||\r
- strstr(SettingsFile,"polyglot_2nd.ini")){\r
- option_set(Option,"SettingsFile","<empty>");\r
- }\r
- }\r
-\r
- // Look at command line for logging option. It is important\r
- // to start logging as soon as possible.\r
-\r
- if((entry=ini_find(ini_command,"PolyGlot","Log"))){\r
- option_set(Option,entry->name,entry->value);\r
- }\r
- if((entry=ini_find(ini_command,"PolyGlot","LogFile"))){\r
- option_set(Option,entry->name,entry->value);\r
- }\r
- \r
- // start logging if required\r
- \r
- if (option_get_bool(Option,"Log")) {\r
- my_log_open(option_get_string(Option,"LogFile"));\r
- }\r
-\r
- // log welcome stuff\r
- \r
- my_log("%s",welcome);\r
- my_log("POLYGLOT *** START ***\n");\r
- if(!my_string_equal(option_get_string(Option,"SettingsFile"),"<empty>")){\r
- my_log("POLYGLOT INI file \"%s\"\n",option_get_string(Option,"SettingsFile"));\r
- }\r
-\r
-\r
- // scavenge command line for options necessary to start the engine\r
-\r
-\r
- if((entry=ini_find(ini_command,"PolyGlot","EngineCommand"))){\r
- option_set(Option,entry->name,entry->value);\r
- }\r
- if((entry=ini_find(ini_command,"PolyGlot","EngineDir"))){\r
- option_set(Option,entry->name,entry->value);\r
- }\r
- if((entry=ini_find(ini_command,"PolyGlot","EngineName"))){\r
- option_set(Option,entry->name,entry->value);\r
- }\r
-\r
- // Make sure that EngineCommand has been set\r
- if(my_string_case_equal(option_get(Option,"EngineCommand"),"<empty>")){\r
- my_fatal("main(): EngineCommand not set\n");\r
- }\r
-\r
- // start engine\r
- \r
- engine_open(Engine);\r
-\r
- if(!engine_active(Engine)){\r
- my_fatal("main(): Could not start \"%s\"\n",option_get(Option,"EngineCommand"));\r
- }\r
-\r
- // switch to UCI mode if necessary\r
- \r
- if (option_get_bool(Option,"UCI")) {\r
- my_log("POLYGLOT *** Switching to UCI mode ***\n");\r
- }\r
-\r
- // initialize uci parsing and send uci command. \r
- // Parse options and wait for uciok\r
- \r
- // XXX\r
- uci_open(Uci,Engine);\r
-\r
- option_set_default(Option,"EngineName",Uci->name);\r
-\r
- // get engine name from engine if not supplied in config file or on\r
- // the command line\r
-\r
- if (my_string_equal(option_get_string(Option,"EngineName"),"<empty>")) {\r
- option_set(Option,"EngineName",Uci->name);\r
- }\r
-\r
-\r
- // In the case we have been invoked with NoIni or StandardIni\r
- // we still have to load a config file.\r
-\r
- if(my_string_equal(option_get_string(Option,"SettingsFile"),"<empty>")){\r
-\r
- // construct the name of the ConfigFile from the EngineName\r
- \r
- char tmp[StringSize];\r
- char option_file[StringSize];\r
- int i;\r
- snprintf(tmp,sizeof(tmp),"%s.ini",\r
- option_get_string(Option,"EngineName"));\r
- tmp[sizeof(tmp)-1]='\0';\r
- for(i=0;i<strlen(tmp);i++){\r
- if(tmp[i]==' '){\r
- tmp[i]='_';\r
- }\r
- }\r
- my_path_join(option_file,\r
- option_get_string(Option,"SettingsDir"),\r
- tmp);\r
- // Load the config file\r
- option_set(Option,"SettingsFile",option_file);\r
-\r
- my_log("POLYGLOT INI file \"%s\"\n",option_get_string(Option,"SettingsFile"));\r
- if(ini_parse(ini,option_file)){\r
- my_log("POLYGLOT Unable to open %s\n",\r
- option_get_string(Option,"SettingsFile")); \r
- }\r
- }\r
-\r
-\r
- // Parse the command line and merge remaining options.\r
-\r
- ini_start_iter(ini_command);\r
- while((entry=ini_next(ini_command))){\r
- ini_insert(ini,entry);\r
- }\r
-\r
- // Remind the reader about the options that are now in effect.\r
-\r
- my_log("POLYGLOG OPTIONS \n");\r
- ini_disp(ini);\r
-\r
- // extract PG options\r
- \r
- ini_start_iter(ini);\r
- while((entry=ini_next(ini))){\r
- if(my_string_case_equal(entry->section,"polyglot")){\r
- opt=option_find(Option,entry->name);\r
- if(opt && !IS_BUTTON(opt->type)){\r
- polyglot_set_option(entry->name,entry->value);\r
- }\r
- }\r
- }\r
-\r
- // Cater to our biggest customer:-)\r
- \r
- if(option_get_bool(Option,"OnlyWbOptions")){\r
- wb_select();\r
- }\r
-\r
- // done initializing\r
- \r
- Init = TRUE;\r
- \r
- // collect engine options from config file(s) and send to engine\r
- \r
- ini_start_iter(ini);\r
- while((entry=ini_next(ini))){\r
- if(my_string_case_equal(entry->section,"engine")){\r
- // also updates value in Uci->option\r
- uci_send_option(Uci,entry->name,"%s",entry->value);\r
- }\r
- }\r
-\r
- \r
- \r
- // EPD test\r
- \r
- if (argv[1] && my_string_equal(argv[1],"epd-test")){\r
- argc=0;\r
- while((arg=argv[argc++]));\r
- epd_test(argc-1,argv);\r
- return EXIT_SUCCESS;\r
- }\r
- \r
- // Anything that hasn't been parsed yet is a syntax error\r
- // It seems that XBoard sometimes passes empty strings as arguments\r
- // to PolyGlot. We ignore these. \r
-\r
- argc=1;\r
- while((arg=argv[argc++])){\r
- if(!my_string_equal(arg,"")){\r
- my_fatal("main(): Incorrect use of option: \"%s\"\n",argv[argc-1]);\r
- }\r
- }\r
-\r
- // gui_init(GUI);\r
- mainloop();\r
- return EXIT_SUCCESS; \r
-}\r
-\r
-// polyglot_set_option()\r
-\r
-void polyglot_set_option(const char *name, const char *value){ // this must be cleaned up!\r
- ini_t ini[1];\r
- int ret;\r
- ini_init(ini);\r
- my_log("POLYGLOT Setting PolyGlot option \"%s=%s\"\n",name,value);\r
- if(my_string_case_equal(name,"Save")){\r
- ret=my_mkdir(option_get(Option,"SettingsDir"));\r
- if(ret){\r
- my_log("POLYGLOT polyglot_set_option(): %s: %s\n",\r
- option_get(Option,"SettingsDir"),\r
- strerror(errno));\r
- }\r
- make_ini(ini);\r
- write_ini(option_get(Option,"SettingsFile"),ini);\r
- return;\r
- }\r
-// if(my_string_equal(option_get(Option,name),value)){\r
-// my_log("Not setting PolyGlot option \"%s\" "\r
-// "since it already as the correct value.\n",\r
-// name);\r
-// return;\r
-// }\r
- option_set(Option,name,value);\r
- if(option_get_bool(Option,"Book")&&(my_string_case_equal(name,"BookFile")||my_string_case_equal(name,"Book"))){\r
- my_log("POLYGLOT *** SETTING BOOK ***\n");\r
- my_log("POLYGLOT BOOK \"%s\"\n",option_get_string(Option,"BookFile"));\r
- book_close();\r
- book_clear();\r
- book_open(option_get_string(Option,"BookFile"));\r
- if(!book_is_open()){\r
- my_log("POLYGLOT Unable to open book \"%s\"\n",option_get_string(Option,"BookFile"));\r
- }\r
- }else if(option_get_bool(Option,"Log")&&(my_string_case_equal(name,"LogFile") ||my_string_case_equal(name,"Log"))){\r
- my_log("POLYGLOT *** SWITCHING LOGFILE ***\n");\r
- my_log("POLYGLOT NEW LOGFILE \"%s\"\n",option_get_string(Option,"LogFile"));\r
- my_log_close();\r
- my_log_open(option_get_string(Option,"LogFile"));\r
- }else if(option_get_bool(Option,"UseNice") &&(my_string_case_equal(name,"NiceValue")||my_string_case_equal(name,"UseNice"))){\r
- my_log("POLYGLOT Adjust Engine Piority\n");\r
- engine_set_nice_value(Engine,atoi(option_get_string(Option,"NiceValue")));\r
- }else if(my_string_case_equal(name,"Book") && !option_get_bool(Option,"Book")){\r
- book_close();\r
- book_clear();\r
- }else if(my_string_case_equal(name,"UseNice") && !option_get_bool(Option,"UseNice")){\r
- my_log("POLYGLOT Adjust Engine Piority\n");\r
- engine_set_nice_value(Engine,0);\r
- }else if(my_string_case_equal(name,"Log") && !option_get_bool(Option,"Log")){\r
- my_log("POLYGLOT QUIT LOGGING\n");\r
- my_log_close();\r
- }\r
-}\r
-\r
-\r
-\r
-// quit()\r
-\r
-void quit() {\r
- my_log("POLYGLOT *** QUIT ***\n");\r
- if (Init && !Engine->pipex->quit_pending) {\r
- stop_search();\r
- Engine->pipex->quit_pending=TRUE;\r
- engine_send(Engine,"quit");\r
- engine_close(Engine);\r
- \r
- }\r
- my_sleep(200);\r
- my_log("POLYGLOT Calling exit\n");\r
- exit(EXIT_SUCCESS);\r
-}\r
-\r
-// stop_search()\r
-\r
-static void stop_search() {\r
- \r
- if (Init && Uci->searching) {\r
- \r
- ASSERT(Uci->searching);\r
- ASSERT(Uci->pending_nb>=1);\r
- \r
- my_log("POLYGLOT STOP SEARCH\n");\r
- \r
- if (option_get_bool(Option,"SyncStop")) {\r
- uci_send_stop_sync(Uci);\r
- } else {\r
- uci_send_stop(Uci);\r
- }\r
- }\r
-}\r
-\r
-\r
-// end of main.c\r
-\r
+
+// main.c
+
+// includes
+
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+
+#include "attack.h"
+#include "board.h"
+#include "book.h"
+#include "book_make.h"
+#include "book_merge.h"
+#include "engine.h"
+#include "epd.h"
+#include "fen.h"
+#include "gui.h"
+#include "hash.h"
+#include "list.h"
+#include "main.h"
+#include "mainloop.h"
+#include "move.h"
+#include "move_gen.h"
+#include "option.h"
+#include "piece.h"
+#include "search.h"
+#include "square.h"
+#include "uci.h"
+#include "util.h"
+#include "xboard2uci.h"
+#include "uci2uci.h"
+#include "ini.h"
+#include "util.h"
+
+
+// constants
+
+
+static const char * const Version = "1.4.63b";
+static const char * const HelpMessage = "\
+SYNTAX\n\
+* polyglot [configfile] [-noini] [-ec engine] [-ed enginedirectory] [-en enginename] [-log true/false] [-lf logfile] [-pg <name>=<value>]* [-uci <name>=<value>]*\n\
+* polyglot make-book [-pgn inputfile] [-bin outputfile] [-max-ply ply] [-min-game games] [-min-score score] [-only-white] [-only-black] [-uniform]\n\
+* polyglot merge-book -in1 inputfile1 -in2 inputfile2 [-out outputfile]\n\
+* polyglot info-book [-bin inputfile] [-exact]\n\
+* polyglot dump-book [-bin inputfile] -color color [-out outputfile]\n\
+* polyglot [configfile] epd-test [engineoptions] [-epd inputfile] [-min-depth depth] [-max-depth depth] [-min-time time] [-max-time time] [-depth-delta delta]\n\
+* polyglot perft [-fen fen] [-max-depth depth]\
+";
+
+static const int SearchDepth = 63;
+static const double SearchTime = 3600.0;
+
+// variables
+
+static bool Init;
+
+// prototypes
+
+static void stop_search ();
+
+// functions
+
+// arg_shift_left()
+
+static void arg_shift_left(char **argv, int index){
+ int i;
+ for(i=index; argv[i]!=NULL; i++){
+ argv[i]=argv[i+1];
+ }
+}
+
+// parse_args()
+
+static void parse_args(ini_t *ini, char **argv){
+ int arg_index;
+ char *arg;
+ arg_index=0;
+ while((arg=argv[arg_index])){
+ if(my_string_equal(arg,"-ec") && argv[arg_index+1]){
+ ini_insert_ex(ini,"PolyGlot","EngineCommand",argv[arg_index+1]);
+ arg_shift_left(argv,arg_index);
+ arg_shift_left(argv,arg_index);
+ continue;
+ }if(my_string_equal(arg,"-ed") && argv[arg_index+1]){
+ ini_insert_ex(ini,"PolyGlot","EngineDir",argv[arg_index+1]);
+ arg_shift_left(argv,arg_index);
+ arg_shift_left(argv,arg_index);
+ continue;
+ }
+ if(my_string_equal(arg,"-en") && argv[arg_index+1]){
+ ini_insert_ex(ini,"PolyGlot","EngineName",argv[arg_index+1]);
+ arg_shift_left(argv,arg_index);
+ arg_shift_left(argv,arg_index);
+ continue;
+ }
+ if(my_string_equal(arg,"-log") &&
+ argv[arg_index+1] &&
+ IS_BOOL(argv[arg_index+1])){
+ ini_insert_ex(ini,
+ "PolyGlot",
+ "Log",
+ TO_BOOL(argv[arg_index+1])?"true":"false");
+ arg_shift_left(argv,arg_index);
+ arg_shift_left(argv,arg_index);
+ continue;
+ }
+ if(my_string_equal(arg,"-lf") && argv[arg_index+1]){
+ ini_insert_ex(ini,"PolyGlot","LogFile",argv[arg_index+1]);
+ arg_shift_left(argv,arg_index);
+ arg_shift_left(argv,arg_index);
+ continue;
+ }
+ if(my_string_equal(arg,"-wb") &&
+ argv[arg_index+1]&&
+ IS_BOOL(argv[arg_index+1])){
+ ini_insert_ex(ini,"PolyGlot",
+ "OnlyWbOptions",
+ TO_BOOL(argv[arg_index+1])?"true":"false");
+ arg_shift_left(argv,arg_index);
+ arg_shift_left(argv,arg_index);
+ continue;
+ }
+ if((my_string_equal(arg,"-pg")||my_string_equal(arg,"-uci")) &&
+ argv[arg_index+1]){
+ int ret;
+ char section[StringSize];
+ char name[StringSize];
+ char value[StringSize];
+ ret=ini_line_parse(argv[arg_index+1],section,name,value);
+ if(ret==NAME_VALUE){
+ if(my_string_equal(arg,"-pg")){
+ ini_insert_ex(ini,"PolyGlot",name,value);
+ }else{
+ ini_insert_ex(ini,"Engine",name,value);
+ }
+ }
+ arg_shift_left(argv,arg_index);
+ arg_shift_left(argv,arg_index);
+ continue;
+ }
+ arg_index++;
+ }
+}
+
+
+// make_ini()
+
+static void make_ini(ini_t *ini){
+ option_t *opt;
+ ini_insert_ex(ini,"polyglot",
+ "EngineCommand",
+ option_get(Option,"EngineCommand"));
+ ini_insert_ex(ini,"polyglot",
+ "EngineDir",
+ option_get(Option,"EngineDir"));
+ option_start_iter(Option);
+ while((opt=option_next(Option))){
+ if(my_string_case_equal(opt->name,"SettingsFile")) continue;
+ if(my_string_case_equal(opt->name,"EngineCommand")) continue;
+ if(my_string_case_equal(opt->name,"EngineDir")) continue;
+ if(!my_string_equal(opt->value,opt->default_)&& !IS_BUTTON(opt->type))
+ {
+ ini_insert_ex(ini,"polyglot",opt->name,opt->value);
+ }
+ }
+ option_start_iter(Uci->option);
+ while((opt=option_next(Uci->option))){
+ if(!strncmp(opt->name,"UCI_",4) &&
+ !my_string_case_equal(opt->name,"UCI_LimitStrength") &&
+ !my_string_case_equal(opt->name,"UCI_Elo"))continue;
+ if(!my_string_equal(opt->value,opt->default_)&&
+ !IS_BUTTON(opt->type)){
+ ini_insert_ex(ini,"engine",opt->name,opt->value);
+ }
+ }
+}
+
+
+// write_ini()
+
+static void write_ini(const char *filename,
+ ini_t *ini){
+ // TODO Quote, dequote
+ const char *quote;
+ ini_entry_t *entry;
+ char tmp[StringSize];
+ char tmp1[StringSize];
+ char tmp2[StringSize];
+ FILE *f;
+ time_t t=time(NULL);
+ f=fopen(filename,"w");
+ if(!f){
+ gui_send(GUI,"tellusererror write_ini(): %s: %s.",filename,strerror(errno));
+ my_log("POLYGLOT write_ini(): %s: %s.\n",filename,strerror(errno));
+ return;
+ }
+ fprintf(f,"; Created: %s\n",ctime(&t));
+ fprintf(f,"[PolyGlot]\n");
+ ini_start_iter(ini);
+ while((entry=ini_next(ini))){
+ if(my_string_case_equal(entry->section,"polyglot")){
+ my_quote(tmp1,entry->name,ini_specials);
+ my_quote(tmp2,entry->value,ini_specials);
+ snprintf(tmp,sizeof(tmp),"%s=%s\n",
+ tmp1,
+ tmp2);
+ tmp[sizeof(tmp)-1]='\0';
+ fprintf(f,"%s",tmp);
+ }
+ }
+ fprintf(f,"[Engine]\n");
+ ini_start_iter(ini);
+ while((entry=ini_next(ini))){
+ if(my_string_case_equal(entry->section,"engine")){
+ my_quote(tmp1,entry->name,ini_specials);
+ my_quote(tmp2,entry->value,ini_specials);
+ snprintf(tmp,sizeof(tmp),"%s=%s\n",
+ tmp1,
+ tmp2);
+ tmp[sizeof(tmp)-1]='\0';
+ fprintf(f,"%s",tmp);
+ }
+ }
+ fclose(f);
+}
+
+// welcome_message()
+
+void welcome_message(char *buf){
+ if(!DEBUG){
+ sprintf(buf,
+ "PolyGlot %s by Fabien Letouzey.\n",
+ Version);
+ }else{
+ sprintf(buf,
+ "PolyGlot %s by Fabien Letouzey (debug build).\n",
+ Version);
+ }
+}
+
+int wb_select(){
+ option_t *opt;
+ option_start_iter(Option);
+ while((opt=option_next(Option))){
+ opt->mode&=~XBOARD;
+ if(opt->mode & XBSEL){
+ opt->mode|=XBOARD;
+ }
+ }
+}
+
+// main()
+
+int main(int argc, char * argv[]) {
+ ini_t ini[1], ini_command[1];
+ ini_entry_t *entry;
+ char *arg;
+ int arg_index;
+ bool NoIni;
+ option_t *opt;
+ char welcome[StringSize];
+
+
+ welcome_message(welcome);
+
+ printf("%s",welcome);
+
+
+ if(argc>=2 && ((my_string_case_equal(argv[1],"help")) || (my_string_case_equal(argv[1],"-help")) || (my_string_case_equal(argv[1],"--help")) || (my_string_case_equal(argv[1],"-h")) || my_string_case_equal(argv[1],"/?"))){
+ printf("%s\n",HelpMessage);
+ return EXIT_SUCCESS;
+ }
+
+ // init
+
+ Init = FALSE;
+
+ gui_init(GUI);
+
+ util_init();
+ option_init_pg();
+
+ square_init();
+ piece_init();
+ attack_init();
+
+ hash_init();
+
+ my_random_init();
+
+ ini_init(ini);
+ ini_init(ini_command);
+
+ // book utilities: do not touch these
+
+ if (argc >= 2 && my_string_equal(argv[1],"make-book")) {
+ book_make(argc,argv);
+ return EXIT_SUCCESS;
+ }
+
+ if (argc >= 2 && my_string_equal(argv[1],"merge-book")) {
+ book_merge(argc,argv);
+ return EXIT_SUCCESS;
+ }
+
+ if (argc >= 2 && my_string_equal(argv[1],"dump-book")) {
+ book_dump(argc,argv);
+ return EXIT_SUCCESS;
+ }
+
+ if (argc >= 2 && my_string_equal(argv[1],"info-book")) {
+ book_info(argc,argv);
+ return EXIT_SUCCESS;
+ }
+
+ // perft
+
+ if (argc >= 2 && my_string_equal(argv[1],"perft")) {
+ do_perft(argc,argv);
+ return EXIT_SUCCESS;
+ }
+
+ // What is the config file? This is very hacky right now.
+
+ // Do we want a config file at all?
+
+ arg_index=0;
+ NoIni=FALSE;
+ while((arg=argv[arg_index++])){
+ if(my_string_equal(arg,"-noini")){
+ NoIni=TRUE;
+ break;
+ }
+ }
+ arg_shift_left(argv,arg_index-1);
+ parse_args(ini_command,argv+1);
+ if(NoIni){
+ option_set(Option,"SettingsFile","<empty>");
+ }
+
+ // Ok see if first argument looks like config file
+
+ if(argv[1] && !my_string_equal(argv[1],"epd-test") && !(argv[1][0]=='-')){
+ // first argument must be config file
+ if(!NoIni){
+ option_set(Option,"SettingsFile",argv[1]);
+ }else{
+ // ignore
+ }
+ arg_shift_left(argv,1);
+ }else{
+ // Config file is the default.
+ // This has already been set above or in "option_init_pg()"
+ }
+
+
+
+ // if we use a config file: load it!
+
+ if(!my_string_equal(option_get_string(Option,"SettingsFile"),"<empty>")){
+ if(ini_parse(ini,option_get_string(Option,"SettingsFile"))){
+ my_fatal("main(): Can't open config file \"%s\": %s\n",
+ option_get_string(Option,"SettingsFile"),
+ strerror(errno));
+ }
+ }
+
+ // Extract some important options
+
+ if((entry=ini_find(ini,"polyglot","EngineCommand"))){
+ option_set(Option,entry->name,entry->value);
+ }
+ if((entry=ini_find(ini,"polyglot","EngineDir"))){
+ option_set(Option,entry->name,entry->value);
+ }
+ if((entry=ini_find(ini,"polyglot","EngineName"))){
+ option_set(Option,entry->name,entry->value);
+ }
+ if((entry=ini_find(ini,"polyglot","Log"))){
+ polyglot_set_option(entry->name,entry->value);
+ }
+ if((entry=ini_find(ini,"polyglot","LogFile"))){
+ polyglot_set_option(entry->name,entry->value);
+ }
+
+ // Concession to WB 4.4.0
+ // Treat "polyglot_1st.ini" and "polyglot_2nd.ini" specially
+
+ if(option_get_bool(Option,"WbWorkArounds3")){
+ const char *SettingsFile=option_get(Option,"SettingsFile");
+ if(strstr(SettingsFile,"polyglot_1st.ini")||
+ strstr(SettingsFile,"polyglot_2nd.ini")){
+ option_set(Option,"SettingsFile","<empty>");
+ }
+ }
+
+ // Look at command line for logging option. It is important
+ // to start logging as soon as possible.
+
+ if((entry=ini_find(ini_command,"PolyGlot","Log"))){
+ option_set(Option,entry->name,entry->value);
+ }
+ if((entry=ini_find(ini_command,"PolyGlot","LogFile"))){
+ option_set(Option,entry->name,entry->value);
+ }
+
+ // start logging if required
+
+ if (option_get_bool(Option,"Log")) {
+ my_log_open(option_get_string(Option,"LogFile"));
+ }
+
+ // log welcome stuff
+
+ my_log("%s",welcome);
+ my_log("POLYGLOT *** START ***\n");
+ if(!my_string_equal(option_get_string(Option,"SettingsFile"),"<empty>")){
+ my_log("POLYGLOT INI file \"%s\"\n",option_get_string(Option,"SettingsFile"));
+ }
+
+
+ // scavenge command line for options necessary to start the engine
+
+
+ if((entry=ini_find(ini_command,"PolyGlot","EngineCommand"))){
+ option_set(Option,entry->name,entry->value);
+ }
+ if((entry=ini_find(ini_command,"PolyGlot","EngineDir"))){
+ option_set(Option,entry->name,entry->value);
+ }
+ if((entry=ini_find(ini_command,"PolyGlot","EngineName"))){
+ option_set(Option,entry->name,entry->value);
+ }
+
+ // Make sure that EngineCommand has been set
+ if(my_string_case_equal(option_get(Option,"EngineCommand"),"<empty>")){
+ my_fatal("main(): EngineCommand not set\n");
+ }
+
+ // start engine
+
+ engine_open(Engine);
+
+ if(!engine_active(Engine)){
+ my_fatal("main(): Could not start \"%s\"\n",option_get(Option,"EngineCommand"));
+ }
+
+ // switch to UCI mode if necessary
+
+ if (option_get_bool(Option,"UCI")) {
+ my_log("POLYGLOT *** Switching to UCI mode ***\n");
+ }
+
+ // initialize uci parsing and send uci command.
+ // Parse options and wait for uciok
+
+ // XXX
+ uci_open(Uci,Engine);
+
+ option_set_default(Option,"EngineName",Uci->name);
+
+ // get engine name from engine if not supplied in config file or on
+ // the command line
+
+ if (my_string_equal(option_get_string(Option,"EngineName"),"<empty>")) {
+ option_set(Option,"EngineName",Uci->name);
+ }
+
+
+ // In the case we have been invoked with NoIni or StandardIni
+ // we still have to load a config file.
+
+ if(my_string_equal(option_get_string(Option,"SettingsFile"),"<empty>")){
+
+ // construct the name of the ConfigFile from the EngineName
+
+ char tmp[StringSize];
+ char option_file[StringSize];
+ int i;
+ snprintf(tmp,sizeof(tmp),"%s.ini",
+ option_get_string(Option,"EngineName"));
+ tmp[sizeof(tmp)-1]='\0';
+ for(i=0;i<strlen(tmp);i++){
+ if(tmp[i]==' '){
+ tmp[i]='_';
+ }
+ }
+ my_path_join(option_file,
+ option_get_string(Option,"SettingsDir"),
+ tmp);
+ // Load the config file
+ option_set(Option,"SettingsFile",option_file);
+
+ my_log("POLYGLOT INI file \"%s\"\n",option_get_string(Option,"SettingsFile"));
+ if(ini_parse(ini,option_file)){
+ my_log("POLYGLOT Unable to open %s\n",
+ option_get_string(Option,"SettingsFile"));
+ }
+ }
+
+
+ // Parse the command line and merge remaining options.
+
+ ini_start_iter(ini_command);
+ while((entry=ini_next(ini_command))){
+ ini_insert(ini,entry);
+ }
+
+ // Remind the reader about the options that are now in effect.
+
+ my_log("POLYGLOG OPTIONS \n");
+ ini_disp(ini);
+
+ // extract PG options
+
+ ini_start_iter(ini);
+ while((entry=ini_next(ini))){
+ if(my_string_case_equal(entry->section,"polyglot")){
+ opt=option_find(Option,entry->name);
+ if(opt && !IS_BUTTON(opt->type)){
+ polyglot_set_option(entry->name,entry->value);
+ }
+ }
+ }
+
+ // Cater to our biggest customer:-)
+
+ if(option_get_bool(Option,"OnlyWbOptions")){
+ wb_select();
+ }
+
+ // done initializing
+
+ Init = TRUE;
+
+ // collect engine options from config file(s) and send to engine
+
+ ini_start_iter(ini);
+ while((entry=ini_next(ini))){
+ if(my_string_case_equal(entry->section,"engine")){
+ // also updates value in Uci->option
+ uci_send_option(Uci,entry->name,"%s",entry->value);
+ }
+ }
+
+
+
+ // EPD test
+
+ if (argv[1] && my_string_equal(argv[1],"epd-test")){
+ argc=0;
+ while((arg=argv[argc++]));
+ epd_test(argc-1,argv);
+ return EXIT_SUCCESS;
+ }
+
+ // Anything that hasn't been parsed yet is a syntax error
+ // It seems that XBoard sometimes passes empty strings as arguments
+ // to PolyGlot. We ignore these.
+
+ argc=1;
+ while((arg=argv[argc++])){
+ if(!my_string_equal(arg,"")){
+ my_fatal("main(): Incorrect use of option: \"%s\"\n",argv[argc-1]);
+ }
+ }
+
+ // gui_init(GUI);
+ mainloop();
+ return EXIT_SUCCESS;
+}
+
+// polyglot_set_option()
+
+void polyglot_set_option(const char *name, const char *value){ // this must be cleaned up!
+ ini_t ini[1];
+ int ret;
+ ini_init(ini);
+ my_log("POLYGLOT Setting PolyGlot option \"%s=%s\"\n",name,value);
+ if(my_string_case_equal(name,"Save")){
+ ret=my_mkdir(option_get(Option,"SettingsDir"));
+ if(ret){
+ my_log("POLYGLOT polyglot_set_option(): %s: %s\n",
+ option_get(Option,"SettingsDir"),
+ strerror(errno));
+ }
+ make_ini(ini);
+ write_ini(option_get(Option,"SettingsFile"),ini);
+ return;
+ }
+// if(my_string_equal(option_get(Option,name),value)){
+// my_log("Not setting PolyGlot option \"%s\" "
+// "since it already as the correct value.\n",
+// name);
+// return;
+// }
+ option_set(Option,name,value);
+ if(option_get_bool(Option,"Book")&&(my_string_case_equal(name,"BookFile")||my_string_case_equal(name,"Book"))){
+ my_log("POLYGLOT *** SETTING BOOK ***\n");
+ my_log("POLYGLOT BOOK \"%s\"\n",option_get_string(Option,"BookFile"));
+ book_close();
+ book_clear();
+ book_open(option_get_string(Option,"BookFile"));
+ if(!book_is_open()){
+ my_log("POLYGLOT Unable to open book \"%s\"\n",option_get_string(Option,"BookFile"));
+ }
+ }else if(option_get_bool(Option,"Log")&&(my_string_case_equal(name,"LogFile") ||my_string_case_equal(name,"Log"))){
+ my_log("POLYGLOT *** SWITCHING LOGFILE ***\n");
+ my_log("POLYGLOT NEW LOGFILE \"%s\"\n",option_get_string(Option,"LogFile"));
+ my_log_close();
+ my_log_open(option_get_string(Option,"LogFile"));
+ }else if(option_get_bool(Option,"UseNice") &&(my_string_case_equal(name,"NiceValue")||my_string_case_equal(name,"UseNice"))){
+ my_log("POLYGLOT Adjust Engine Piority\n");
+ engine_set_nice_value(Engine,atoi(option_get_string(Option,"NiceValue")));
+ }else if(my_string_case_equal(name,"Book") && !option_get_bool(Option,"Book")){
+ book_close();
+ book_clear();
+ }else if(my_string_case_equal(name,"UseNice") && !option_get_bool(Option,"UseNice")){
+ my_log("POLYGLOT Adjust Engine Piority\n");
+ engine_set_nice_value(Engine,0);
+ }else if(my_string_case_equal(name,"Log") && !option_get_bool(Option,"Log")){
+ my_log("POLYGLOT QUIT LOGGING\n");
+ my_log_close();
+ }
+}
+
+
+
+// quit()
+
+void quit() {
+ my_log("POLYGLOT *** QUIT ***\n");
+ if (Init && !Engine->pipex->quit_pending) {
+ stop_search();
+ Engine->pipex->quit_pending=TRUE;
+ engine_send(Engine,"quit");
+ engine_close(Engine);
+
+ }
+ my_sleep(200);
+ my_log("POLYGLOT Calling exit\n");
+ exit(EXIT_SUCCESS);
+}
+
+// stop_search()
+
+static void stop_search() {
+
+ if (Init && Uci->searching) {
+
+ ASSERT(Uci->searching);
+ ASSERT(Uci->pending_nb>=1);
+
+ my_log("POLYGLOT STOP SEARCH\n");
+
+ if (option_get_bool(Option,"SyncStop")) {
+ uci_send_stop_sync(Uci);
+ } else {
+ uci_send_stop(Uci);
+ }
+ }
+}
+
+
+// end of main.c
+
-\r
-// main.h\r
-\r
-#ifndef MAIN_H\r
-#define MAIN_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-extern void quit ();\r
-extern void polyglot_set_option(const char *name, const char *value);\r
-\r
-#endif // !defined MAIN_H\r
-\r
-// end of main.h\r
-\r
+
+// main.h
+
+#ifndef MAIN_H
+#define MAIN_H
+
+// includes
+
+#include "util.h"
+
+// functions
+
+extern void quit ();
+extern void polyglot_set_option(const char *name, const char *value);
+
+#endif // !defined MAIN_H
+
+// end of main.h
+
-// mainloop.c\r
-\r
-// constants\r
-\r
-#define StringSize ((int)4096)\r
-\r
-// includes\r
-\r
-#include <errno.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "main.h"\r
-#include "engine.h"\r
-#include "gui.h"\r
-#include "option.h"\r
-//#include "ini.h"\r
-#include "xboard2uci.h"\r
-#include "uci2uci.h"\r
-\r
-// prototypes\r
-\r
-static void mainloop_init ();\r
-static void mainloop_wait_for_event ();\r
-static void mainloop_engine_step(char * string);\r
-static void mainloop_gui_step(char * string);\r
-\r
-// functions\r
-\r
-// mainloop_init()\r
- \r
-static void mainloop_init(){\r
- if(!option_get_bool(Option,"UCI")){\r
- xboard2uci_init(); // the default\r
- }\r
-}\r
-\r
-// mainloop_engine_step()\r
-\r
-static void mainloop_engine_step(char * string){\r
- if(option_get_bool(Option,"UCI")){\r
- uci2uci_engine_step(string); \r
- }else{\r
- xboard2uci_engine_step(string);\r
- }\r
-}\r
-\r
-// mainloop_gui_step()\r
-\r
-static void mainloop_gui_step(char * string){\r
- if(option_get_bool(Option,"UCI")){\r
- uci2uci_gui_step(string); \r
- }else if(my_string_equal(string,"uci")){ // mode auto detection\r
- my_log("POLYGLOT *** Switching to UCI mode ***\n");\r
- option_set(Option,"UCI","true");\r
- uci2uci_gui_step(string);\r
- }else{\r
- xboard2uci_gui_step(string);\r
- }\r
-}\r
-\r
-// mainloop()\r
-\r
-void mainloop() {\r
- char string[StringSize];\r
- my_log("POLYGLOT *** Mainloop started ***\n");\r
- mainloop_init();\r
- while (!engine_eof(Engine)) {\r
- // process buffered lines\r
- while(TRUE){\r
- if(gui_get_non_blocking(GUI,string)){\r
- mainloop_gui_step(string);\r
- }else if(!engine_eof(Engine) &&\r
- engine_get_non_blocking(Engine,string) ){\r
- mainloop_engine_step(string);\r
- }else{\r
- break;\r
- }\r
- }\r
- mainloop_wait_for_event();\r
- }\r
- my_log("POLYGLOT *** Mainloop has ended ***\n");\r
- // This should be handled better.\r
- engine_close(Engine);\r
- my_log("POLYGLOT Calling exit\n");\r
- exit(EXIT_SUCCESS);\r
-\r
-}\r
-\r
-\r
-\r
-\r
-// mainloop_wait_for_event()\r
-\r
-static void mainloop_wait_for_event(){\r
- pipex_t *pipex[3];\r
- pipex[0]=GUI->pipex;\r
- pipex[1]=Engine->pipex;\r
- pipex[2]=NULL;\r
- pipex_wait_event(pipex);\r
-}\r
-\r
-\r
-\r
+// mainloop.c
+
+// includes
+
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "main.h"
+#include "engine.h"
+#include "gui.h"
+#include "option.h"
+//#include "ini.h"
+#include "xboard2uci.h"
+#include "uci2uci.h"
+
+// prototypes
+
+static void mainloop_init ();
+static void mainloop_wait_for_event ();
+static void mainloop_engine_step(char * string);
+static void mainloop_gui_step(char * string);
+
+// functions
+
+// mainloop_init()
+
+static void mainloop_init(){
+ if(!option_get_bool(Option,"UCI")){
+ xboard2uci_init(); // the default
+ }
+}
+
+// mainloop_engine_step()
+
+static void mainloop_engine_step(char * string){
+ if(option_get_bool(Option,"UCI")){
+ uci2uci_engine_step(string);
+ }else{
+ xboard2uci_engine_step(string);
+ }
+}
+
+// mainloop_gui_step()
+
+static void mainloop_gui_step(char * string){
+ if(option_get_bool(Option,"UCI")){
+ uci2uci_gui_step(string);
+ }else if(my_string_equal(string,"uci")){ // mode auto detection
+ my_log("POLYGLOT *** Switching to UCI mode ***\n");
+ option_set(Option,"UCI","true");
+ uci2uci_gui_step(string);
+ }else{
+ xboard2uci_gui_step(string);
+ }
+}
+
+// mainloop()
+
+void mainloop() {
+ char string[StringSize];
+ my_log("POLYGLOT *** Mainloop started ***\n");
+ mainloop_init();
+ while (!engine_eof(Engine)) {
+ // process buffered lines
+ while(TRUE){
+ if(gui_get_non_blocking(GUI,string)){
+ mainloop_gui_step(string);
+ }else if(!engine_eof(Engine) &&
+ engine_get_non_blocking(Engine,string) ){
+ mainloop_engine_step(string);
+ }else{
+ break;
+ }
+ }
+ mainloop_wait_for_event();
+ }
+ my_log("POLYGLOT *** Mainloop has ended ***\n");
+ // This should be handled better.
+ engine_close(Engine);
+ my_log("POLYGLOT Calling exit\n");
+ exit(EXIT_SUCCESS);
+
+}
+
+
+
+
+// mainloop_wait_for_event()
+
+static void mainloop_wait_for_event(){
+ pipex_t *pipex[3];
+ pipex[0]=GUI->pipex;
+ pipex[1]=Engine->pipex;
+ pipex[2]=NULL;
+ pipex_wait_event(pipex);
+}
+
+
+
-\r
-// mainloop.h\r
-\r
-#ifndef MAINLOOP_H\r
-#define MAINLOOP_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-#include "uci2uci.h"\r
-\r
-// types\r
-\r
-\r
-\r
-\r
-\r
-// functions\r
-\r
-extern void mainloop ();\r
-\r
-\r
-#endif // !defined MAINLOOP_H\r
-\r
-// end of mainloop.h\r
-\r
+
+// mainloop.h
+
+#ifndef MAINLOOP_H
+#define MAINLOOP_H
+
+// includes
+
+#include "util.h"
+#include "uci2uci.h"
+
+// types
+
+
+
+
+
+// functions
+
+extern void mainloop ();
+
+
+#endif // !defined MAINLOOP_H
+
+// end of mainloop.h
+
-\r
-// move.c\r
-\r
-// includes\r
-\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "attack.h"\r
-#include "colour.h"\r
-#include "list.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_gen.h"\r
-#include "move_legal.h"\r
-#include "option.h"\r
-#include "piece.h"\r
-#include "square.h"\r
-#include "util.h"\r
-\r
-// "constants"\r
-\r
-static const uint8 PromotePiece[5] = { PieceNone64, Knight64, Bishop64, Rook64, Queen64 };\r
-\r
-// functions\r
-\r
-// move_is_ok()\r
-\r
-bool move_is_ok(int move) {\r
-\r
- if (move < 0 || move >= 65536) return FALSE;\r
-\r
- if (move == MoveNone) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// move_make()\r
-\r
-int move_make(int from, int to) {\r
-\r
- ASSERT(square_is_ok(from));\r
- ASSERT(square_is_ok(to));\r
-\r
- return (square_to_64(from) << 6) | square_to_64(to);\r
-}\r
-\r
-// move_make_flags()\r
-\r
-int move_make_flags(int from, int to, int flags) {\r
-\r
- ASSERT(square_is_ok(from));\r
- ASSERT(square_is_ok(to));\r
- ASSERT((flags&~0xF000)==0);\r
-\r
- ASSERT(to!=from);\r
-\r
- return (square_to_64(from) << 6) | square_to_64(to) | flags;\r
-}\r
-\r
-// move_from()\r
-\r
-int move_from(int move) {\r
-\r
- int from_64;\r
-\r
- ASSERT(move_is_ok(move));\r
-\r
- from_64 = (move >> 6) & 077;\r
-\r
- return square_from_64(from_64);\r
-}\r
-\r
-// move_to()\r
-\r
-int move_to(int move) {\r
-\r
- int to_64;\r
-\r
- ASSERT(move_is_ok(move));\r
-\r
- to_64 = move & 077;\r
-\r
- return square_from_64(to_64);\r
-}\r
-\r
-// move_promote_hack()\r
-\r
-int move_promote_hack(int move) {\r
-\r
- int code;\r
-\r
- ASSERT(move_is_ok(move));\r
-\r
- ASSERT(move_is_promote(move));\r
-\r
- code = move >> 12;\r
- ASSERT(code>=1&&code<=4);\r
-\r
- return PromotePiece[code];\r
-}\r
-\r
-// move_is_capture()\r
-\r
-bool move_is_capture(int move, const board_t * board) {\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- if (move_is_en_passant(move,board)) return TRUE;\r
- if (board->square[move_to(move)] != Empty) return TRUE;\r
-\r
- return FALSE;\r
-}\r
-\r
-// move_is_promote()\r
-\r
-bool move_is_promote(int move) {\r
-\r
- ASSERT(move_is_ok(move));\r
-\r
- return (move & MoveFlags) != 0;\r
-}\r
-\r
-// move_is_en_passant()\r
-\r
-bool move_is_en_passant(int move, const board_t * board) {\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- return piece_is_pawn(move_piece(move,board))\r
- && move_to(move) == board->ep_square;\r
-}\r
-\r
-// move_is_castle()\r
-\r
-bool move_is_castle(int move, const board_t * board) {\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- return colour_equal(board->square[move_to(move)],board->turn);\r
-}\r
-\r
-// move_piece()\r
-\r
-int move_piece(int move, const board_t * board) {\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- return board->square[move_from(move)];\r
-}\r
-\r
-// move_capture()\r
-\r
-int move_capture(int move, const board_t * board) {\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- if (move_is_en_passant(move,board)) {\r
- return piece_pawn_opp(move_piece(move,board));\r
- }\r
-\r
- return board->square[move_to(move)];\r
-}\r
-\r
-// move_promote()\r
-\r
-int move_promote(int move, const board_t * board) {\r
-\r
- int code;\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- if (move_is_promote(move)) {\r
- code = move >> 12;\r
- ASSERT(code>=1&&code<=4);\r
- return PromotePiece[code] | board->turn;\r
- }\r
-\r
- return Empty;\r
-}\r
-\r
-// move_is_check()\r
-\r
-bool move_is_check(int move, const board_t * board) {\r
-\r
- board_t new_board[1];\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- board_copy(new_board,board);\r
- move_do(new_board,move);\r
- ASSERT(!is_in_check(new_board,colour_opp(new_board->turn)));\r
-\r
- return board_is_check(new_board);\r
-}\r
-\r
-// move_is_mate()\r
-\r
-bool move_is_mate(int move, const board_t * board) {\r
-\r
- board_t new_board[1];\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- board_copy(new_board,board);\r
- move_do(new_board,move);\r
- ASSERT(!is_in_check(new_board,colour_opp(new_board->turn)));\r
-\r
- return board_is_mate(new_board);\r
-}\r
-\r
-// move_to_can()\r
-\r
-bool move_to_can(int move, const board_t * board, char string[], int size) {\r
-\r
- int from, to;\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=6);\r
-\r
- ASSERT(move_is_legal(move,board));\r
-\r
- if (size < 6) return FALSE;\r
-\r
- // init\r
-\r
- from = move_from(move);\r
- to = move_to(move);\r
-\r
- // king-slide castling\r
-\r
- if (move_is_castle(move,board) && !option_get_bool(Option,"Chess960")) {\r
- if (FALSE) {\r
- } else if (from == E1 && to == H1) {\r
- to = G1;\r
- } else if (from == E1 && to == A1) {\r
- to = C1;\r
- } else if (from == E8 && to == H8) {\r
- to = G8;\r
- } else if (from == E8 && to == A8) {\r
- to = C8;\r
- }\r
- }\r
-\r
- // normal moves\r
-\r
- if (!square_to_string(from,&string[0],3)) ASSERT(FALSE);\r
- if (!square_to_string(to,&string[2],3)) ASSERT(FALSE);\r
- ASSERT(strlen(string)==4);\r
-\r
- // promotes\r
-\r
- if (move_is_promote(move)) {\r
- string[4] = piece_to_char(move_promote_hack(move)|Black); // HACK: black => lower-case\r
- string[5] = '\0';\r
- }\r
-\r
- // debug\r
-\r
- ASSERT(move_from_can(string,board)==move);\r
-\r
- return TRUE;\r
-}\r
-\r
-// move_from_can()\r
-\r
-int move_from_can(const char string[], const board_t * board) {\r
-\r
- char tmp_string[256];\r
- int from, to;\r
- int side;\r
- int move;\r
-\r
- ASSERT(string!=NULL);\r
- ASSERT(board_is_ok(board));\r
-\r
- // from\r
-\r
- tmp_string[0] = string[0];\r
- tmp_string[1] = string[1];\r
- tmp_string[2] = '\0';\r
-\r
- from = square_from_string(tmp_string);\r
- if (from == SquareNone) return MoveNone;\r
-\r
- // to\r
-\r
- tmp_string[0] = string[2];\r
- tmp_string[1] = string[3];\r
- tmp_string[2] = '\0';\r
-\r
- to = square_from_string(tmp_string);\r
- if (to == SquareNone) return MoveNone;\r
-\r
- // convert "king slide" castling to KxR\r
-\r
- if (piece_is_king(board->square[from])\r
- && square_rank(to) == square_rank(from)\r
- && abs(to-from) > 1) {\r
- side = (to > from) ? SideH : SideA;\r
- to = board->castle[board->turn][side];\r
- if (to == SquareNone) return MoveNone;\r
- }\r
- // move\r
-\r
- move = move_make(from,to);\r
-\r
- // promote\r
- switch (string[4]) {\r
- case '\0': // not a promotion\r
- if (piece_is_pawn(board->square[from])\r
- && square_side_rank(to,board->turn) == Rank8\r
- && option_get_bool(Option,"PromoteWorkAround")) {\r
- move |= MovePromoteQueen;\r
- }\r
- break;\r
- case 'N':\r
- case 'n':\r
- move |= MovePromoteKnight;\r
- break;\r
- case 'B':\r
- case 'b':\r
- move |= MovePromoteBishop;\r
- break;\r
- case 'R':\r
- case 'r':\r
- move |= MovePromoteRook;\r
- break;\r
- case 'Q':\r
- case 'q':\r
- move |= MovePromoteQueen;\r
- break;\r
- default:\r
- return MoveNone;\r
- break;\r
- }\r
- // debug\r
-\r
- ASSERT(move_is_legal(move,board));\r
- return move;\r
-}\r
-\r
-// move_order()\r
-\r
-int move_order(int move) {\r
-\r
- ASSERT(move_is_ok(move));\r
-\r
- return ((move & 07777) << 3) | (move >> 12); // from, to, promote\r
-}\r
-\r
-// move_disp()\r
-\r
-void move_disp(int move, const board_t * board) {\r
-\r
- char string[256];\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- if (!move_to_can(move,board,string,256)) ASSERT(FALSE);\r
- my_log("POLYGLOT %s\n",string);\r
-}\r
-\r
-// end of move.cpp\r
-\r
+
+// move.c
+
+// includes
+
+#include <stdlib.h>
+#include <string.h>
+
+#include "attack.h"
+#include "colour.h"
+#include "list.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_gen.h"
+#include "move_legal.h"
+#include "option.h"
+#include "piece.h"
+#include "square.h"
+#include "util.h"
+
+// "constants"
+
+static const uint8 PromotePiece[5] = { PieceNone64, Knight64, Bishop64, Rook64, Queen64 };
+
+// functions
+
+// move_is_ok()
+
+bool move_is_ok(int move) {
+
+ if (move < 0 || move >= 65536) return FALSE;
+
+ if (move == MoveNone) return FALSE;
+
+ return TRUE;
+}
+
+// move_make()
+
+int move_make(int from, int to) {
+
+ ASSERT(square_is_ok(from));
+ ASSERT(square_is_ok(to));
+
+ return (square_to_64(from) << 6) | square_to_64(to);
+}
+
+// move_make_flags()
+
+int move_make_flags(int from, int to, int flags) {
+
+ ASSERT(square_is_ok(from));
+ ASSERT(square_is_ok(to));
+ ASSERT((flags&~0xF000)==0);
+
+ ASSERT(to!=from);
+
+ return (square_to_64(from) << 6) | square_to_64(to) | flags;
+}
+
+// move_from()
+
+int move_from(int move) {
+
+ int from_64;
+
+ ASSERT(move_is_ok(move));
+
+ from_64 = (move >> 6) & 077;
+
+ return square_from_64(from_64);
+}
+
+// move_to()
+
+int move_to(int move) {
+
+ int to_64;
+
+ ASSERT(move_is_ok(move));
+
+ to_64 = move & 077;
+
+ return square_from_64(to_64);
+}
+
+// move_promote_hack()
+
+int move_promote_hack(int move) {
+
+ int code;
+
+ ASSERT(move_is_ok(move));
+
+ ASSERT(move_is_promote(move));
+
+ code = move >> 12;
+ ASSERT(code>=1&&code<=4);
+
+ return PromotePiece[code];
+}
+
+// move_is_capture()
+
+bool move_is_capture(int move, const board_t * board) {
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ if (move_is_en_passant(move,board)) return TRUE;
+ if (board->square[move_to(move)] != Empty) return TRUE;
+
+ return FALSE;
+}
+
+// move_is_promote()
+
+bool move_is_promote(int move) {
+
+ ASSERT(move_is_ok(move));
+
+ return (move & MoveFlags) != 0;
+}
+
+// move_is_en_passant()
+
+bool move_is_en_passant(int move, const board_t * board) {
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ return piece_is_pawn(move_piece(move,board))
+ && move_to(move) == board->ep_square;
+}
+
+// move_is_castle()
+
+bool move_is_castle(int move, const board_t * board) {
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ return colour_equal(board->square[move_to(move)],board->turn);
+}
+
+// move_piece()
+
+int move_piece(int move, const board_t * board) {
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ return board->square[move_from(move)];
+}
+
+// move_capture()
+
+int move_capture(int move, const board_t * board) {
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ if (move_is_en_passant(move,board)) {
+ return piece_pawn_opp(move_piece(move,board));
+ }
+
+ return board->square[move_to(move)];
+}
+
+// move_promote()
+
+int move_promote(int move, const board_t * board) {
+
+ int code;
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ if (move_is_promote(move)) {
+ code = move >> 12;
+ ASSERT(code>=1&&code<=4);
+ return PromotePiece[code] | board->turn;
+ }
+
+ return Empty;
+}
+
+// move_is_check()
+
+bool move_is_check(int move, const board_t * board) {
+
+ board_t new_board[1];
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ board_copy(new_board,board);
+ move_do(new_board,move);
+ ASSERT(!is_in_check(new_board,colour_opp(new_board->turn)));
+
+ return board_is_check(new_board);
+}
+
+// move_is_mate()
+
+bool move_is_mate(int move, const board_t * board) {
+
+ board_t new_board[1];
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ board_copy(new_board,board);
+ move_do(new_board,move);
+ ASSERT(!is_in_check(new_board,colour_opp(new_board->turn)));
+
+ return board_is_mate(new_board);
+}
+
+// move_to_can()
+
+bool move_to_can(int move, const board_t * board, char string[], int size) {
+
+ int from, to;
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+ ASSERT(string!=NULL);
+ ASSERT(size>=6);
+
+ ASSERT(move_is_legal(move,board));
+
+ if (size < 6) return FALSE;
+
+ // init
+
+ from = move_from(move);
+ to = move_to(move);
+
+ // king-slide castling
+
+ if (move_is_castle(move,board) && !option_get_bool(Option,"Chess960")) {
+ if (FALSE) {
+ } else if (from == E1 && to == H1) {
+ to = G1;
+ } else if (from == E1 && to == A1) {
+ to = C1;
+ } else if (from == E8 && to == H8) {
+ to = G8;
+ } else if (from == E8 && to == A8) {
+ to = C8;
+ }
+ }
+
+ // normal moves
+
+ if (!square_to_string(from,&string[0],3)) ASSERT(FALSE);
+ if (!square_to_string(to,&string[2],3)) ASSERT(FALSE);
+ ASSERT(strlen(string)==4);
+
+ // promotes
+
+ if (move_is_promote(move)) {
+ string[4] = piece_to_char(move_promote_hack(move)|Black); // HACK: black => lower-case
+ string[5] = '\0';
+ }
+
+ // debug
+
+ ASSERT(move_from_can(string,board)==move);
+
+ return TRUE;
+}
+
+// move_from_can()
+
+int move_from_can(const char string[], const board_t * board) {
+
+ char tmp_string[256];
+ int from, to;
+ int side;
+ int move;
+
+ ASSERT(string!=NULL);
+ ASSERT(board_is_ok(board));
+
+ // from
+
+ tmp_string[0] = string[0];
+ tmp_string[1] = string[1];
+ tmp_string[2] = '\0';
+
+ from = square_from_string(tmp_string);
+ if (from == SquareNone) return MoveNone;
+
+ // to
+
+ tmp_string[0] = string[2];
+ tmp_string[1] = string[3];
+ tmp_string[2] = '\0';
+
+ to = square_from_string(tmp_string);
+ if (to == SquareNone) return MoveNone;
+
+ // convert "king slide" castling to KxR
+
+ if (piece_is_king(board->square[from])
+ && square_rank(to) == square_rank(from)
+ && abs(to-from) > 1) {
+ side = (to > from) ? SideH : SideA;
+ to = board->castle[board->turn][side];
+ if (to == SquareNone) return MoveNone;
+ }
+ // move
+
+ move = move_make(from,to);
+
+ // promote
+ switch (string[4]) {
+ case '\0': // not a promotion
+ if (piece_is_pawn(board->square[from])
+ && square_side_rank(to,board->turn) == Rank8
+ && option_get_bool(Option,"PromoteWorkAround")) {
+ move |= MovePromoteQueen;
+ }
+ break;
+ case 'N':
+ case 'n':
+ move |= MovePromoteKnight;
+ break;
+ case 'B':
+ case 'b':
+ move |= MovePromoteBishop;
+ break;
+ case 'R':
+ case 'r':
+ move |= MovePromoteRook;
+ break;
+ case 'Q':
+ case 'q':
+ move |= MovePromoteQueen;
+ break;
+ default:
+ return MoveNone;
+ break;
+ }
+ // debug
+
+ ASSERT(move_is_legal(move,board));
+ return move;
+}
+
+// move_order()
+
+int move_order(int move) {
+
+ ASSERT(move_is_ok(move));
+
+ return ((move & 07777) << 3) | (move >> 12); // from, to, promote
+}
+
+// move_disp()
+
+void move_disp(int move, const board_t * board) {
+
+ char string[256];
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ if (!move_to_can(move,board,string,256)) ASSERT(FALSE);
+ my_log("POLYGLOT %s\n",string);
+}
+
+// end of move.cpp
+
-\r
-// move.h\r
-\r
-#ifndef MOVE_H\r
-#define MOVE_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "util.h"\r
-\r
-// defined\r
-\r
-// HACK: a1a1 cannot be a legal move\r
-#define MoveNone (0) \r
-\r
-#define MovePromoteKnight (1 << 12)\r
-#define MovePromoteBishop (2 << 12)\r
-#define MovePromoteRook (3 << 12)\r
-#define MovePromoteQueen (4 << 12)\r
-#define MoveFlags (7 << 12)\r
-\r
-// types\r
-\r
-typedef uint16 move_t;\r
-\r
-// functions\r
-\r
-extern bool move_is_ok (int move);\r
-\r
-extern int move_make (int from, int to);\r
-extern int move_make_flags (int from, int to, int flags);\r
-\r
-extern int move_from (int move);\r
-extern int move_to (int move);\r
-extern int move_promote_hack (int move);\r
-\r
-extern bool move_is_capture (int move, const board_t * board);\r
-extern bool move_is_promote (int move);\r
-extern bool move_is_en_passant (int move, const board_t * board);\r
-extern bool move_is_castle (int move, const board_t * board);\r
-\r
-extern int move_piece (int move, const board_t * board);\r
-extern int move_capture (int move, const board_t * board);\r
-extern int move_promote (int move, const board_t * board);\r
-\r
-extern bool move_is_check (int move, const board_t * board);\r
-extern bool move_is_mate (int move, const board_t * board);\r
-\r
-extern int move_order (int move);\r
-\r
-extern bool move_to_can (int move, const board_t * board, char string[], int size);\r
-extern int move_from_can (const char string[], const board_t * board);\r
-\r
-extern void move_disp (int move, const board_t * board);\r
-\r
-#endif // !defined MOVE_H\r
-\r
-// end of move.h\r
-\r
+
+// move.h
+
+#ifndef MOVE_H
+#define MOVE_H
+
+// includes
+
+#include "board.h"
+#include "util.h"
+
+// defined
+
+// HACK: a1a1 cannot be a legal move
+#define MoveNone (0)
+
+#define MovePromoteKnight (1 << 12)
+#define MovePromoteBishop (2 << 12)
+#define MovePromoteRook (3 << 12)
+#define MovePromoteQueen (4 << 12)
+#define MoveFlags (7 << 12)
+
+// types
+
+typedef uint16 move_t;
+
+// functions
+
+extern bool move_is_ok (int move);
+
+extern int move_make (int from, int to);
+extern int move_make_flags (int from, int to, int flags);
+
+extern int move_from (int move);
+extern int move_to (int move);
+extern int move_promote_hack (int move);
+
+extern bool move_is_capture (int move, const board_t * board);
+extern bool move_is_promote (int move);
+extern bool move_is_en_passant (int move, const board_t * board);
+extern bool move_is_castle (int move, const board_t * board);
+
+extern int move_piece (int move, const board_t * board);
+extern int move_capture (int move, const board_t * board);
+extern int move_promote (int move, const board_t * board);
+
+extern bool move_is_check (int move, const board_t * board);
+extern bool move_is_mate (int move, const board_t * board);
+
+extern int move_order (int move);
+
+extern bool move_to_can (int move, const board_t * board, char string[], int size);
+extern int move_from_can (const char string[], const board_t * board);
+
+extern void move_disp (int move, const board_t * board);
+
+#endif // !defined MOVE_H
+
+// end of move.h
+
-\r
-// move_do.c\r
-\r
-// includes\r
-\r
-#include <stdlib.h>\r
-\r
-#include "board.h"\r
-#include "colour.h"\r
-#include "hash.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_legal.h"\r
-#include "piece.h"\r
-#include "random.h"\r
-#include "util.h"\r
-\r
-// prototypes\r
-\r
-static void square_clear (board_t * board, int square, int piece);\r
-static void square_set (board_t * board, int square, int piece, int pos);\r
-static void square_move (board_t * board, int from, int to, int piece);\r
-\r
-// functions\r
-\r
-// move_do()\r
-\r
-void move_do(board_t * board, int move) {\r
-\r
- int me, opp;\r
- int from, to;\r
- int piece, pos, capture;\r
- int old_flags, new_flags;\r
- int sq, ep_square;\r
- int pawn;\r
-\r
- ASSERT(board_is_ok(board));\r
- ASSERT(move_is_ok(move));\r
-\r
- ASSERT(move_is_pseudo(move,board));\r
-\r
- // init\r
-\r
- me = board->turn;\r
- opp = colour_opp(me);\r
-\r
- from = move_from(move);\r
- to = move_to(move);\r
-\r
- piece = board->square[from];\r
- ASSERT(colour_equal(piece,me));\r
-\r
- pos = board->pos[from];\r
- ASSERT(pos>=0);\r
-\r
- // update turn\r
-\r
- board->turn = opp;\r
- board->key ^= random_64(RandomTurn);\r
-\r
- // update castling rights\r
-\r
- old_flags = board_flags(board);\r
-\r
- if (piece_is_king(piece)) {\r
- board->castle[me][SideH] = SquareNone;\r
- board->castle[me][SideA] = SquareNone;\r
- }\r
-\r
- if (board->castle[me][SideH] == from) board->castle[me][SideH] = SquareNone;\r
- if (board->castle[me][SideA] == from) board->castle[me][SideA] = SquareNone;\r
-\r
- if (board->castle[opp][SideH] == to) board->castle[opp][SideH] = SquareNone;\r
- if (board->castle[opp][SideA] == to) board->castle[opp][SideA] = SquareNone;\r
-\r
- new_flags = board_flags(board);\r
-\r
- board->key ^= hash_castle_key(new_flags^old_flags); // HACK\r
-\r
- // update en-passant square\r
-\r
- ep_square = sq = board->ep_square;\r
- if (sq != SquareNone) {\r
- board->key ^= random_64(RandomEnPassant+square_file(sq));\r
- board->ep_square = SquareNone;\r
- }\r
-\r
- if (piece_is_pawn(piece) && abs(to-from) == 32) {\r
- pawn = piece_make_pawn(opp);\r
- if (board->square[to-1] == pawn || board->square[to+1] == pawn) {\r
- board->ep_square = sq = (from + to) / 2;\r
- board->key ^= random_64(RandomEnPassant+square_file(sq));\r
- }\r
- }\r
-\r
- // update ply number (captures are handled later)\r
-\r
- board->ply_nb++;\r
- if (piece_is_pawn(piece)) board->ply_nb = 0; // conversion\r
-\r
- // update move number\r
-\r
- if (me == Black) board->move_nb++;\r
-\r
- // castle\r
-\r
- if (colour_equal(board->square[to],me)) {\r
-\r
- int rank;\r
- int king_from, king_to;\r
- int rook_from, rook_to;\r
- int rook;\r
-\r
- rank = colour_is_white(me) ? Rank1 : Rank8;\r
-\r
- king_from = from;\r
- rook_from = to;\r
-\r
- if (to > from) { // h side\r
- king_to = square_make(FileG,rank);\r
- rook_to = square_make(FileF,rank);\r
- } else { // a side\r
- king_to = square_make(FileC,rank);\r
- rook_to = square_make(FileD,rank);\r
- }\r
-\r
- // remove the rook\r
-\r
- pos = board->pos[rook_from];\r
- ASSERT(pos>=0);\r
-\r
- rook = Rook64 | me; // HACK\r
-\r
- square_clear(board,rook_from,rook);\r
-\r
- // move the king\r
-\r
- square_move(board,king_from,king_to,piece);\r
-\r
- // put the rook back\r
-\r
- square_set(board,rook_to,rook,pos);\r
-\r
- ASSERT(board->key==hash_key(board));\r
-\r
- return;\r
- }\r
-\r
- // remove the captured piece\r
-\r
- if (piece_is_pawn(piece) && to == ep_square) {\r
-\r
- // en-passant capture\r
-\r
- sq = square_ep_dual(to);\r
- capture = board->square[sq];\r
- ASSERT(capture==piece_make_pawn(opp));\r
-\r
- square_clear(board,sq,capture);\r
-\r
- board->ply_nb = 0; // conversion\r
-\r
- } else {\r
-\r
- capture = board->square[to];\r
-\r
- if (capture != Empty) {\r
-\r
- // normal capture\r
-\r
- ASSERT(colour_equal(capture,opp));\r
- ASSERT(!piece_is_king(capture));\r
-\r
- square_clear(board,to,capture);\r
-\r
- board->ply_nb = 0; // conversion\r
- }\r
- }\r
-\r
- // move the piece\r
-\r
- if (move_is_promote(move)) {\r
-\r
- // promote\r
-\r
- square_clear(board,from,piece);\r
- piece = move_promote_hack(move) | me; // HACK\r
- square_set(board,to,piece,pos);\r
-\r
- } else {\r
-\r
- // normal move\r
-\r
- square_move(board,from,to,piece);\r
- }\r
-\r
- ASSERT(board->key==hash_key(board));\r
-}\r
-\r
-// square_clear()\r
-\r
-static void square_clear(board_t * board, int square, int piece) {\r
-\r
- int pos, piece_12, colour;\r
- int sq, size;\r
-\r
- ASSERT(board!=NULL);\r
- ASSERT(square_is_ok(square));\r
- ASSERT(piece_is_ok(piece));\r
-\r
- // init\r
-\r
- pos = board->pos[square];\r
- ASSERT(pos>=0);\r
-\r
- colour = piece_colour(piece);\r
- piece_12 = piece_to_12(piece);\r
-\r
- // square\r
-\r
- ASSERT(board->square[square]==piece);\r
- board->square[square] = Empty;\r
-\r
- ASSERT(board->pos[square]==pos);\r
- board->pos[square] = -1; // not needed\r
-\r
- // piece list\r
-\r
- ASSERT(board->list_size[colour]>=2);\r
- size = --board->list_size[colour];\r
- ASSERT(pos<=size);\r
-\r
- if (pos != size) {\r
-\r
- sq = board->list[colour][size];\r
- ASSERT(square_is_ok(sq));\r
- ASSERT(sq!=square);\r
-\r
- ASSERT(board->pos[sq]==size);\r
- board->pos[sq] = pos;\r
-\r
- ASSERT(board->list[colour][pos]==square);\r
- board->list[colour][pos] = sq;\r
- }\r
-\r
- board->list[colour][size] = SquareNone;\r
-\r
- // material\r
-\r
- ASSERT(board->number[piece_12]>=1);\r
- board->number[piece_12]--;\r
-\r
- // hash key\r
-\r
- board->key ^= random_64(RandomPiece+piece_12*64+square_to_64(square));\r
-}\r
-\r
-// square_set()\r
-\r
-static void square_set(board_t * board, int square, int piece, int pos) {\r
-\r
- int piece_12, colour;\r
- int sq, size;\r
-\r
- ASSERT(board!=NULL);\r
- ASSERT(square_is_ok(square));\r
- ASSERT(piece_is_ok(piece));\r
- ASSERT(pos>=0);\r
-\r
- // init\r
-\r
- colour = piece_colour(piece);\r
- piece_12 = piece_to_12(piece);\r
-\r
- // square\r
-\r
- ASSERT(board->square[square]==Empty);\r
- board->square[square] = piece;\r
-\r
- ASSERT(board->pos[square]==-1);\r
- board->pos[square] = pos;\r
-\r
- // piece list\r
-\r
- size = board->list_size[colour]++;\r
- ASSERT(board->list[colour][size]==SquareNone);\r
- ASSERT(pos<=size);\r
-\r
- if (pos != size) {\r
-\r
- sq = board->list[colour][pos];\r
- ASSERT(square_is_ok(sq));\r
- ASSERT(sq!=square);\r
-\r
- ASSERT(board->pos[sq]==pos);\r
- board->pos[sq] = size;\r
-\r
- ASSERT(board->list[colour][size]==SquareNone);\r
- board->list[colour][size] = sq;\r
- }\r
-\r
- board->list[colour][pos] = square;\r
-\r
- // material\r
-\r
- ASSERT(board->number[piece_12]<=8);\r
- board->number[piece_12]++;\r
-\r
- // hash key\r
-\r
- board->key ^= random_64(RandomPiece+piece_12*64+square_to_64(square));\r
-}\r
-\r
-// square_move()\r
-\r
-static void square_move(board_t * board, int from, int to, int piece) {\r
-\r
- int colour, pos;\r
- int piece_index;\r
-\r
- ASSERT(board!=NULL);\r
- ASSERT(square_is_ok(from));\r
- ASSERT(square_is_ok(to));\r
- ASSERT(piece_is_ok(piece));\r
-\r
- // init\r
-\r
- colour = piece_colour(piece);\r
-\r
- pos = board->pos[from];\r
- ASSERT(pos>=0);\r
-\r
- // from\r
-\r
- ASSERT(board->square[from]==piece);\r
- board->square[from] = Empty;\r
-\r
- ASSERT(board->pos[from]==pos);\r
- board->pos[from] = -1; // not needed\r
-\r
- // to\r
-\r
- ASSERT(board->square[to]==Empty);\r
- board->square[to] = piece;\r
-\r
- ASSERT(board->pos[to]==-1);\r
- board->pos[to] = pos;\r
-\r
- // piece list\r
-\r
- ASSERT(board->list[colour][pos]==from);\r
- board->list[colour][pos] = to;\r
-\r
- // hash key\r
-\r
- piece_index = RandomPiece + piece_to_12(piece) * 64;\r
-\r
- board->key ^= random_64(piece_index+square_to_64(from))\r
- ^ random_64(piece_index+square_to_64(to));\r
-}\r
-\r
-// end of move_do.cpp\r
-\r
+
+// move_do.c
+
+// includes
+
+#include <stdlib.h>
+
+#include "board.h"
+#include "colour.h"
+#include "hash.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_legal.h"
+#include "piece.h"
+#include "random.h"
+#include "util.h"
+
+// prototypes
+
+static void square_clear (board_t * board, int square, int piece);
+static void square_set (board_t * board, int square, int piece, int pos);
+static void square_move (board_t * board, int from, int to, int piece);
+
+// functions
+
+// move_do()
+
+void move_do(board_t * board, int move) {
+
+ int me, opp;
+ int from, to;
+ int piece, pos, capture;
+ int old_flags, new_flags;
+ int sq, ep_square;
+ int pawn;
+
+ ASSERT(board_is_ok(board));
+ ASSERT(move_is_ok(move));
+
+ ASSERT(move_is_pseudo(move,board));
+
+ // init
+
+ me = board->turn;
+ opp = colour_opp(me);
+
+ from = move_from(move);
+ to = move_to(move);
+
+ piece = board->square[from];
+ ASSERT(colour_equal(piece,me));
+
+ pos = board->pos[from];
+ ASSERT(pos>=0);
+
+ // update turn
+
+ board->turn = opp;
+ board->key ^= random_64(RandomTurn);
+
+ // update castling rights
+
+ old_flags = board_flags(board);
+
+ if (piece_is_king(piece)) {
+ board->castle[me][SideH] = SquareNone;
+ board->castle[me][SideA] = SquareNone;
+ }
+
+ if (board->castle[me][SideH] == from) board->castle[me][SideH] = SquareNone;
+ if (board->castle[me][SideA] == from) board->castle[me][SideA] = SquareNone;
+
+ if (board->castle[opp][SideH] == to) board->castle[opp][SideH] = SquareNone;
+ if (board->castle[opp][SideA] == to) board->castle[opp][SideA] = SquareNone;
+
+ new_flags = board_flags(board);
+
+ board->key ^= hash_castle_key(new_flags^old_flags); // HACK
+
+ // update en-passant square
+
+ ep_square = sq = board->ep_square;
+ if (sq != SquareNone) {
+ board->key ^= random_64(RandomEnPassant+square_file(sq));
+ board->ep_square = SquareNone;
+ }
+
+ if (piece_is_pawn(piece) && abs(to-from) == 32) {
+ pawn = piece_make_pawn(opp);
+ if (board->square[to-1] == pawn || board->square[to+1] == pawn) {
+ board->ep_square = sq = (from + to) / 2;
+ board->key ^= random_64(RandomEnPassant+square_file(sq));
+ }
+ }
+
+ // update ply number (captures are handled later)
+
+ board->ply_nb++;
+ if (piece_is_pawn(piece)) board->ply_nb = 0; // conversion
+
+ // update move number
+
+ if (me == Black) board->move_nb++;
+
+ // castle
+
+ if (colour_equal(board->square[to],me)) {
+
+ int rank;
+ int king_from, king_to;
+ int rook_from, rook_to;
+ int rook;
+
+ rank = colour_is_white(me) ? Rank1 : Rank8;
+
+ king_from = from;
+ rook_from = to;
+
+ if (to > from) { // h side
+ king_to = square_make(FileG,rank);
+ rook_to = square_make(FileF,rank);
+ } else { // a side
+ king_to = square_make(FileC,rank);
+ rook_to = square_make(FileD,rank);
+ }
+
+ // remove the rook
+
+ pos = board->pos[rook_from];
+ ASSERT(pos>=0);
+
+ rook = Rook64 | me; // HACK
+
+ square_clear(board,rook_from,rook);
+
+ // move the king
+
+ square_move(board,king_from,king_to,piece);
+
+ // put the rook back
+
+ square_set(board,rook_to,rook,pos);
+
+ ASSERT(board->key==hash_key(board));
+
+ return;
+ }
+
+ // remove the captured piece
+
+ if (piece_is_pawn(piece) && to == ep_square) {
+
+ // en-passant capture
+
+ sq = square_ep_dual(to);
+ capture = board->square[sq];
+ ASSERT(capture==piece_make_pawn(opp));
+
+ square_clear(board,sq,capture);
+
+ board->ply_nb = 0; // conversion
+
+ } else {
+
+ capture = board->square[to];
+
+ if (capture != Empty) {
+
+ // normal capture
+
+ ASSERT(colour_equal(capture,opp));
+ ASSERT(!piece_is_king(capture));
+
+ square_clear(board,to,capture);
+
+ board->ply_nb = 0; // conversion
+ }
+ }
+
+ // move the piece
+
+ if (move_is_promote(move)) {
+
+ // promote
+
+ square_clear(board,from,piece);
+ piece = move_promote_hack(move) | me; // HACK
+ square_set(board,to,piece,pos);
+
+ } else {
+
+ // normal move
+
+ square_move(board,from,to,piece);
+ }
+
+ ASSERT(board->key==hash_key(board));
+}
+
+// square_clear()
+
+static void square_clear(board_t * board, int square, int piece) {
+
+ int pos, piece_12, colour;
+ int sq, size;
+
+ ASSERT(board!=NULL);
+ ASSERT(square_is_ok(square));
+ ASSERT(piece_is_ok(piece));
+
+ // init
+
+ pos = board->pos[square];
+ ASSERT(pos>=0);
+
+ colour = piece_colour(piece);
+ piece_12 = piece_to_12(piece);
+
+ // square
+
+ ASSERT(board->square[square]==piece);
+ board->square[square] = Empty;
+
+ ASSERT(board->pos[square]==pos);
+ board->pos[square] = -1; // not needed
+
+ // piece list
+
+ ASSERT(board->list_size[colour]>=2);
+ size = --board->list_size[colour];
+ ASSERT(pos<=size);
+
+ if (pos != size) {
+
+ sq = board->list[colour][size];
+ ASSERT(square_is_ok(sq));
+ ASSERT(sq!=square);
+
+ ASSERT(board->pos[sq]==size);
+ board->pos[sq] = pos;
+
+ ASSERT(board->list[colour][pos]==square);
+ board->list[colour][pos] = sq;
+ }
+
+ board->list[colour][size] = SquareNone;
+
+ // material
+
+ ASSERT(board->number[piece_12]>=1);
+ board->number[piece_12]--;
+
+ // hash key
+
+ board->key ^= random_64(RandomPiece+piece_12*64+square_to_64(square));
+}
+
+// square_set()
+
+static void square_set(board_t * board, int square, int piece, int pos) {
+
+ int piece_12, colour;
+ int sq, size;
+
+ ASSERT(board!=NULL);
+ ASSERT(square_is_ok(square));
+ ASSERT(piece_is_ok(piece));
+ ASSERT(pos>=0);
+
+ // init
+
+ colour = piece_colour(piece);
+ piece_12 = piece_to_12(piece);
+
+ // square
+
+ ASSERT(board->square[square]==Empty);
+ board->square[square] = piece;
+
+ ASSERT(board->pos[square]==-1);
+ board->pos[square] = pos;
+
+ // piece list
+
+ size = board->list_size[colour]++;
+ ASSERT(board->list[colour][size]==SquareNone);
+ ASSERT(pos<=size);
+
+ if (pos != size) {
+
+ sq = board->list[colour][pos];
+ ASSERT(square_is_ok(sq));
+ ASSERT(sq!=square);
+
+ ASSERT(board->pos[sq]==pos);
+ board->pos[sq] = size;
+
+ ASSERT(board->list[colour][size]==SquareNone);
+ board->list[colour][size] = sq;
+ }
+
+ board->list[colour][pos] = square;
+
+ // material
+
+ ASSERT(board->number[piece_12]<=8);
+ board->number[piece_12]++;
+
+ // hash key
+
+ board->key ^= random_64(RandomPiece+piece_12*64+square_to_64(square));
+}
+
+// square_move()
+
+static void square_move(board_t * board, int from, int to, int piece) {
+
+ int colour, pos;
+ int piece_index;
+
+ ASSERT(board!=NULL);
+ ASSERT(square_is_ok(from));
+ ASSERT(square_is_ok(to));
+ ASSERT(piece_is_ok(piece));
+
+ // init
+
+ colour = piece_colour(piece);
+
+ pos = board->pos[from];
+ ASSERT(pos>=0);
+
+ // from
+
+ ASSERT(board->square[from]==piece);
+ board->square[from] = Empty;
+
+ ASSERT(board->pos[from]==pos);
+ board->pos[from] = -1; // not needed
+
+ // to
+
+ ASSERT(board->square[to]==Empty);
+ board->square[to] = piece;
+
+ ASSERT(board->pos[to]==-1);
+ board->pos[to] = pos;
+
+ // piece list
+
+ ASSERT(board->list[colour][pos]==from);
+ board->list[colour][pos] = to;
+
+ // hash key
+
+ piece_index = RandomPiece + piece_to_12(piece) * 64;
+
+ board->key ^= random_64(piece_index+square_to_64(from))
+ ^ random_64(piece_index+square_to_64(to));
+}
+
+// end of move_do.cpp
+
-\r
-// move_do.h\r
-\r
-#ifndef MOVE_DO_H\r
-#define MOVE_DO_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-extern void move_do (board_t * board, int move);\r
-\r
-#endif // !defined MOVE_DO_H\r
-\r
-// end of move_do.h\r
-\r
+
+// move_do.h
+
+#ifndef MOVE_DO_H
+#define MOVE_DO_H
+
+// includes
+
+#include "board.h"
+#include "util.h"
+
+// functions
+
+extern void move_do (board_t * board, int move);
+
+#endif // !defined MOVE_DO_H
+
+// end of move_do.h
+
-\r
-// move_gen.c\r
-\r
-// includes\r
-\r
-#include "attack.h"\r
-#include "board.h"\r
-#include "colour.h"\r
-#include "list.h"\r
-#include "move.h"\r
-#include "move_gen.h"\r
-#include "move_legal.h"\r
-#include "piece.h"\r
-#include "util.h"\r
-\r
-// prototypes\r
-\r
-static void add_all_moves (list_t * list, const board_t * board);\r
-static void add_castle_moves (list_t * list, const board_t * board);\r
-\r
-static void add_pawn_move (list_t * list, int from, int to);\r
-\r
-// functions\r
-\r
-// gen_legal_moves()\r
-\r
-void gen_legal_moves(list_t * list, const board_t * board) {\r
-\r
- ASSERT(list!=NULL);\r
- ASSERT(board_is_ok(board));\r
-\r
- gen_moves(list,board);\r
- filter_legal(list,board);\r
-}\r
-\r
-// gen_moves()\r
-\r
-void gen_moves(list_t * list, const board_t * board) {\r
-\r
- ASSERT(list!=NULL);\r
- ASSERT(board_is_ok(board));\r
-\r
- list_clear(list);\r
-\r
- add_all_moves(list,board);\r
- if (!is_in_check(board,board->turn)) add_castle_moves(list,board);\r
-}\r
-\r
-// add_all_moves()\r
-\r
-static void add_all_moves(list_t * list, const board_t * board) {\r
-\r
- int me, opp;\r
- const uint8 * ptr;\r
- const sint8 * ptr_inc;\r
- int from, to;\r
- int inc;\r
- int piece, capture;\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(board_is_ok(board));\r
-\r
- me = board->turn;\r
- opp = colour_opp(me);\r
-\r
- for (ptr = board->list[me]; (from=*ptr) != SquareNone; ptr++) {\r
-\r
- piece = board->square[from];\r
- ASSERT(colour_equal(piece,me));\r
-\r
- switch (piece_type(piece)) {\r
-\r
- case WhitePawn64:\r
-\r
- to = from + 15;\r
- if (to == board->ep_square || colour_equal(board->square[to],opp)) {\r
- add_pawn_move(list,from,to);\r
- }\r
-\r
- to = from + 17;\r
- if (to == board->ep_square || colour_equal(board->square[to],opp)) {\r
- add_pawn_move(list,from,to);\r
- }\r
-\r
- to = from + 16;\r
- if (board->square[to] == Empty) {\r
- add_pawn_move(list,from,to);\r
- if (square_rank(from) == Rank2) {\r
- to = from + 32;\r
- if (board->square[to] == Empty) {\r
- ASSERT(!square_is_promote(to));\r
- list_add(list,move_make(from,to));\r
- }\r
- }\r
- }\r
-\r
- break;\r
-\r
- case BlackPawn64:\r
-\r
- to = from - 17;\r
- if (to == board->ep_square || colour_equal(board->square[to],opp)) {\r
- add_pawn_move(list,from,to);\r
- }\r
-\r
- to = from - 15;\r
- if (to == board->ep_square || colour_equal(board->square[to],opp)) {\r
- add_pawn_move(list,from,to);\r
- }\r
-\r
- to = from - 16;\r
- if (board->square[to] == Empty) {\r
- add_pawn_move(list,from,to);\r
- if (square_rank(from) == Rank7) {\r
- to = from - 32;\r
- if (board->square[to] == Empty) {\r
- ASSERT(!square_is_promote(to));\r
- list_add(list,move_make(from,to));\r
- }\r
- }\r
- }\r
-\r
- break;\r
-\r
- case Knight64:\r
-\r
- for (ptr_inc = KnightInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {\r
- to = from + inc;\r
- capture = board->square[to];\r
- if (capture == Empty || colour_equal(capture,opp)) {\r
- list_add(list,move_make(from,to));\r
- }\r
- }\r
-\r
- break;\r
-\r
- case Bishop64:\r
-\r
- for (ptr_inc = BishopInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {\r
- for (to = from+inc; (capture=board->square[to]) == Empty; to += inc) {\r
- list_add(list,move_make(from,to));\r
- }\r
- if (colour_equal(capture,opp)) {\r
- list_add(list,move_make(from,to));\r
- }\r
- }\r
-\r
- break;\r
-\r
- case Rook64:\r
-\r
- for (ptr_inc = RookInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {\r
- for (to = from+inc; (capture=board->square[to]) == Empty; to += inc) {\r
- list_add(list,move_make(from,to));\r
- }\r
- if (colour_equal(capture,opp)) {\r
- list_add(list,move_make(from,to));\r
- }\r
- }\r
-\r
- break;\r
-\r
- case Queen64:\r
-\r
- for (ptr_inc = QueenInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {\r
- for (to = from+inc; (capture=board->square[to]) == Empty; to += inc) {\r
- list_add(list,move_make(from,to));\r
- }\r
- if (colour_equal(capture,opp)) {\r
- list_add(list,move_make(from,to));\r
- }\r
- }\r
-\r
- break;\r
-\r
- case King64:\r
-\r
- for (ptr_inc = KingInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {\r
- to = from + inc;\r
- capture = board->square[to];\r
- if (capture == Empty || colour_equal(capture,opp)) {\r
- list_add(list,move_make(from,to));\r
- }\r
- }\r
-\r
- break;\r
-\r
- default:\r
-\r
- ASSERT(FALSE);\r
- break;\r
- }\r
- }\r
-}\r
-\r
-// add_castle_moves()\r
-\r
-static void add_castle_moves(list_t * list, const board_t * board) {\r
-\r
- int me, opp;\r
- int rank;\r
- int king_from, king_to;\r
- int rook_from, rook_to;\r
- bool legal;\r
- int inc;\r
- int sq;\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(board_is_ok(board));\r
-\r
- ASSERT(!is_in_check(board,board->turn));\r
-\r
- me = board->turn;\r
- opp = colour_opp(me);\r
-\r
- rank = colour_is_white(me) ? Rank1 : Rank8;\r
-\r
- // h-side castling\r
-\r
- if (board->castle[me][SideH] != SquareNone) {\r
-\r
- king_from = king_pos(board,me);\r
- king_to = square_make(FileG,rank);\r
- rook_from = board->castle[me][SideH];\r
- rook_to = square_make(FileF,rank);\r
-\r
- ASSERT(square_rank(king_from)==rank);\r
- ASSERT(square_rank(rook_from)==rank);\r
- ASSERT(board->square[king_from]==(King64|me)); // HACK\r
- ASSERT(board->square[rook_from]==(Rook64|me)); // HACK\r
- ASSERT(rook_from>king_from);\r
-\r
- legal = TRUE;\r
-\r
- if (king_to != king_from) {\r
-\r
- inc = (king_to > king_from) ? +1 : -1;\r
-\r
- for (sq = king_from+inc; TRUE; sq += inc) {\r
-\r
- if (sq != rook_from && board->square[sq] != Empty) legal = FALSE;\r
- if (is_attacked(board,sq,opp)) legal = FALSE;\r
-\r
- if (sq == king_to) break;\r
- }\r
- }\r
-\r
- if (rook_to != rook_from) {\r
-\r
- inc = (rook_to > rook_from) ? +1 : -1;\r
-\r
- for (sq = rook_from+inc; TRUE; sq += inc) {\r
- if (sq != king_from && board->square[sq] != Empty) legal = FALSE;\r
- if (sq == rook_to) break;\r
- }\r
- }\r
-\r
- if (legal) list_add(list,move_make(king_from,rook_from));\r
- }\r
-\r
- // a-side castling\r
-\r
- if (board->castle[me][SideA] != SquareNone) {\r
-\r
- king_from = king_pos(board,me);\r
- king_to = square_make(FileC,rank);\r
- rook_from = board->castle[me][SideA];\r
- rook_to = square_make(FileD,rank);\r
-\r
- ASSERT(square_rank(king_from)==rank);\r
- ASSERT(square_rank(rook_from)==rank);\r
- ASSERT(board->square[king_from]==(King64|me)); // HACK\r
- ASSERT(board->square[rook_from]==(Rook64|me)); // HACK\r
- ASSERT(rook_from<king_from);\r
-\r
- legal = TRUE;\r
-\r
- if (king_to != king_from) {\r
-\r
- inc = (king_to > king_from) ? +1 : -1;\r
-\r
- for (sq = king_from+inc; TRUE; sq += inc) {\r
-\r
- if (sq != rook_from && board->square[sq] != Empty) legal = FALSE;\r
- if (is_attacked(board,sq,opp)) legal = FALSE;\r
-\r
- if (sq == king_to) break;\r
- }\r
- }\r
-\r
- if (rook_to != rook_from) {\r
-\r
- inc = (rook_to > rook_from) ? +1 : -1;\r
-\r
- for (sq = rook_from+inc; TRUE; sq += inc) {\r
- if (sq != king_from && board->square[sq] != Empty) legal = FALSE;\r
- if (sq == rook_to) break;\r
- }\r
- }\r
-\r
- if (legal) list_add(list,move_make(king_from,rook_from));\r
- }\r
-}\r
-\r
-// add_pawn_move()\r
-\r
-static void add_pawn_move(list_t * list, int from, int to) {\r
-\r
- int move;\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(square_is_ok(from));\r
- ASSERT(square_is_ok(to));\r
-\r
- move = move_make(from,to);\r
-\r
- if (square_is_promote(to)) {\r
- list_add(list,move|MovePromoteKnight);\r
- list_add(list,move|MovePromoteBishop);\r
- list_add(list,move|MovePromoteRook);\r
- list_add(list,move|MovePromoteQueen);\r
- } else {\r
- list_add(list,move);\r
- }\r
-}\r
-\r
-// end of move_gen.cpp\r
-\r
+
+// move_gen.c
+
+// includes
+
+#include "attack.h"
+#include "board.h"
+#include "colour.h"
+#include "list.h"
+#include "move.h"
+#include "move_gen.h"
+#include "move_legal.h"
+#include "piece.h"
+#include "util.h"
+
+// prototypes
+
+static void add_all_moves (list_t * list, const board_t * board);
+static void add_castle_moves (list_t * list, const board_t * board);
+
+static void add_pawn_move (list_t * list, int from, int to);
+
+// functions
+
+// gen_legal_moves()
+
+void gen_legal_moves(list_t * list, const board_t * board) {
+
+ ASSERT(list!=NULL);
+ ASSERT(board_is_ok(board));
+
+ gen_moves(list,board);
+ filter_legal(list,board);
+}
+
+// gen_moves()
+
+void gen_moves(list_t * list, const board_t * board) {
+
+ ASSERT(list!=NULL);
+ ASSERT(board_is_ok(board));
+
+ list_clear(list);
+
+ add_all_moves(list,board);
+ if (!is_in_check(board,board->turn)) add_castle_moves(list,board);
+}
+
+// add_all_moves()
+
+static void add_all_moves(list_t * list, const board_t * board) {
+
+ int me, opp;
+ const uint8 * ptr;
+ const sint8 * ptr_inc;
+ int from, to;
+ int inc;
+ int piece, capture;
+
+ ASSERT(list_is_ok(list));
+ ASSERT(board_is_ok(board));
+
+ me = board->turn;
+ opp = colour_opp(me);
+
+ for (ptr = board->list[me]; (from=*ptr) != SquareNone; ptr++) {
+
+ piece = board->square[from];
+ ASSERT(colour_equal(piece,me));
+
+ switch (piece_type(piece)) {
+
+ case WhitePawn64:
+
+ to = from + 15;
+ if (to == board->ep_square || colour_equal(board->square[to],opp)) {
+ add_pawn_move(list,from,to);
+ }
+
+ to = from + 17;
+ if (to == board->ep_square || colour_equal(board->square[to],opp)) {
+ add_pawn_move(list,from,to);
+ }
+
+ to = from + 16;
+ if (board->square[to] == Empty) {
+ add_pawn_move(list,from,to);
+ if (square_rank(from) == Rank2) {
+ to = from + 32;
+ if (board->square[to] == Empty) {
+ ASSERT(!square_is_promote(to));
+ list_add(list,move_make(from,to));
+ }
+ }
+ }
+
+ break;
+
+ case BlackPawn64:
+
+ to = from - 17;
+ if (to == board->ep_square || colour_equal(board->square[to],opp)) {
+ add_pawn_move(list,from,to);
+ }
+
+ to = from - 15;
+ if (to == board->ep_square || colour_equal(board->square[to],opp)) {
+ add_pawn_move(list,from,to);
+ }
+
+ to = from - 16;
+ if (board->square[to] == Empty) {
+ add_pawn_move(list,from,to);
+ if (square_rank(from) == Rank7) {
+ to = from - 32;
+ if (board->square[to] == Empty) {
+ ASSERT(!square_is_promote(to));
+ list_add(list,move_make(from,to));
+ }
+ }
+ }
+
+ break;
+
+ case Knight64:
+
+ for (ptr_inc = KnightInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {
+ to = from + inc;
+ capture = board->square[to];
+ if (capture == Empty || colour_equal(capture,opp)) {
+ list_add(list,move_make(from,to));
+ }
+ }
+
+ break;
+
+ case Bishop64:
+
+ for (ptr_inc = BishopInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {
+ for (to = from+inc; (capture=board->square[to]) == Empty; to += inc) {
+ list_add(list,move_make(from,to));
+ }
+ if (colour_equal(capture,opp)) {
+ list_add(list,move_make(from,to));
+ }
+ }
+
+ break;
+
+ case Rook64:
+
+ for (ptr_inc = RookInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {
+ for (to = from+inc; (capture=board->square[to]) == Empty; to += inc) {
+ list_add(list,move_make(from,to));
+ }
+ if (colour_equal(capture,opp)) {
+ list_add(list,move_make(from,to));
+ }
+ }
+
+ break;
+
+ case Queen64:
+
+ for (ptr_inc = QueenInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {
+ for (to = from+inc; (capture=board->square[to]) == Empty; to += inc) {
+ list_add(list,move_make(from,to));
+ }
+ if (colour_equal(capture,opp)) {
+ list_add(list,move_make(from,to));
+ }
+ }
+
+ break;
+
+ case King64:
+
+ for (ptr_inc = KingInc; (inc=*ptr_inc) != IncNone; ptr_inc++) {
+ to = from + inc;
+ capture = board->square[to];
+ if (capture == Empty || colour_equal(capture,opp)) {
+ list_add(list,move_make(from,to));
+ }
+ }
+
+ break;
+
+ default:
+
+ ASSERT(FALSE);
+ break;
+ }
+ }
+}
+
+// add_castle_moves()
+
+static void add_castle_moves(list_t * list, const board_t * board) {
+
+ int me, opp;
+ int rank;
+ int king_from, king_to;
+ int rook_from, rook_to;
+ bool legal;
+ int inc;
+ int sq;
+
+ ASSERT(list_is_ok(list));
+ ASSERT(board_is_ok(board));
+
+ ASSERT(!is_in_check(board,board->turn));
+
+ me = board->turn;
+ opp = colour_opp(me);
+
+ rank = colour_is_white(me) ? Rank1 : Rank8;
+
+ // h-side castling
+
+ if (board->castle[me][SideH] != SquareNone) {
+
+ king_from = king_pos(board,me);
+ king_to = square_make(FileG,rank);
+ rook_from = board->castle[me][SideH];
+ rook_to = square_make(FileF,rank);
+
+ ASSERT(square_rank(king_from)==rank);
+ ASSERT(square_rank(rook_from)==rank);
+ ASSERT(board->square[king_from]==(King64|me)); // HACK
+ ASSERT(board->square[rook_from]==(Rook64|me)); // HACK
+ ASSERT(rook_from>king_from);
+
+ legal = TRUE;
+
+ if (king_to != king_from) {
+
+ inc = (king_to > king_from) ? +1 : -1;
+
+ for (sq = king_from+inc; TRUE; sq += inc) {
+
+ if (sq != rook_from && board->square[sq] != Empty) legal = FALSE;
+ if (is_attacked(board,sq,opp)) legal = FALSE;
+
+ if (sq == king_to) break;
+ }
+ }
+
+ if (rook_to != rook_from) {
+
+ inc = (rook_to > rook_from) ? +1 : -1;
+
+ for (sq = rook_from+inc; TRUE; sq += inc) {
+ if (sq != king_from && board->square[sq] != Empty) legal = FALSE;
+ if (sq == rook_to) break;
+ }
+ }
+
+ if (legal) list_add(list,move_make(king_from,rook_from));
+ }
+
+ // a-side castling
+
+ if (board->castle[me][SideA] != SquareNone) {
+
+ king_from = king_pos(board,me);
+ king_to = square_make(FileC,rank);
+ rook_from = board->castle[me][SideA];
+ rook_to = square_make(FileD,rank);
+
+ ASSERT(square_rank(king_from)==rank);
+ ASSERT(square_rank(rook_from)==rank);
+ ASSERT(board->square[king_from]==(King64|me)); // HACK
+ ASSERT(board->square[rook_from]==(Rook64|me)); // HACK
+ ASSERT(rook_from<king_from);
+
+ legal = TRUE;
+
+ if (king_to != king_from) {
+
+ inc = (king_to > king_from) ? +1 : -1;
+
+ for (sq = king_from+inc; TRUE; sq += inc) {
+
+ if (sq != rook_from && board->square[sq] != Empty) legal = FALSE;
+ if (is_attacked(board,sq,opp)) legal = FALSE;
+
+ if (sq == king_to) break;
+ }
+ }
+
+ if (rook_to != rook_from) {
+
+ inc = (rook_to > rook_from) ? +1 : -1;
+
+ for (sq = rook_from+inc; TRUE; sq += inc) {
+ if (sq != king_from && board->square[sq] != Empty) legal = FALSE;
+ if (sq == rook_to) break;
+ }
+ }
+
+ if (legal) list_add(list,move_make(king_from,rook_from));
+ }
+}
+
+// add_pawn_move()
+
+static void add_pawn_move(list_t * list, int from, int to) {
+
+ int move;
+
+ ASSERT(list_is_ok(list));
+ ASSERT(square_is_ok(from));
+ ASSERT(square_is_ok(to));
+
+ move = move_make(from,to);
+
+ if (square_is_promote(to)) {
+ list_add(list,move|MovePromoteKnight);
+ list_add(list,move|MovePromoteBishop);
+ list_add(list,move|MovePromoteRook);
+ list_add(list,move|MovePromoteQueen);
+ } else {
+ list_add(list,move);
+ }
+}
+
+// end of move_gen.cpp
+
-\r
-// move_gen.h\r
-\r
-#ifndef MOVE_GEN_H\r
-#define MOVE_GEN_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "list.h"\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-extern void gen_legal_moves (list_t * list, const board_t * board);\r
-extern void gen_moves (list_t * list, const board_t * board);\r
-\r
-#endif // !defined MOVE_GEN_H\r
-\r
-// end of move_gen.h\r
-\r
+
+// move_gen.h
+
+#ifndef MOVE_GEN_H
+#define MOVE_GEN_H
+
+// includes
+
+#include "board.h"
+#include "list.h"
+#include "util.h"
+
+// functions
+
+extern void gen_legal_moves (list_t * list, const board_t * board);
+extern void gen_moves (list_t * list, const board_t * board);
+
+#endif // !defined MOVE_GEN_H
+
+// end of move_gen.h
+
-\r
-// move_legal.c\r
-\r
-// includes\r
-\r
-#include "attack.h"\r
-#include "colour.h"\r
-#include "fen.h"\r
-#include "list.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_gen.h"\r
-#include "move_legal.h"\r
-#include "piece.h"\r
-#include "square.h"\r
-#include "util.h"\r
-\r
-// prototypes\r
-\r
-static bool move_is_legal_debug (int move, const board_t * board);\r
-\r
-// functions\r
-\r
-// move_is_pseudo()\r
-\r
-bool move_is_pseudo(int move, const board_t * board) {\r
-\r
- list_t list[1];\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- gen_moves(list,board);\r
-\r
- return list_contain(list,move);\r
-}\r
-\r
-// pseudo_is_legal()\r
-\r
-bool pseudo_is_legal(int move, const board_t * board) {\r
-\r
- board_t new_board[1];\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- ASSERT(move_is_pseudo(move,board));\r
-\r
- board_copy(new_board,board);\r
- move_do(new_board,move);\r
-\r
- return !is_in_check(new_board,colour_opp(new_board->turn));\r
-}\r
-\r
-// move_is_legal()\r
-\r
-bool move_is_legal(int move, const board_t * board) {\r
-\r
- bool legal;\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- legal = move_is_pseudo(move,board) && pseudo_is_legal(move,board);\r
- ASSERT(legal==move_is_legal_debug(move,board));\r
-\r
- return legal;\r
-}\r
-\r
-// filter_legal()\r
-\r
-void filter_legal(list_t * list, const board_t * board) {\r
-\r
- int pos;\r
- int i, move, value;\r
-\r
- ASSERT(list_is_ok(list));\r
- ASSERT(board_is_ok(board));\r
-\r
- pos = 0;\r
-\r
- for (i = 0; i < list_size(list); i++) {\r
-\r
- ASSERT(pos>=0&&pos<=i);\r
-\r
- move = list_move(list,i);\r
- value = list_value(list,i);\r
-\r
- if (pseudo_is_legal(move,board)) {\r
- list->move[pos] = move;\r
- list->value[pos] = value;\r
- pos++;\r
- }\r
- }\r
-\r
- ASSERT(pos>=0&&pos<=list_size(list));\r
- list->size = pos;\r
-}\r
-\r
-// move_is_legal_debug()\r
-\r
-static bool move_is_legal_debug(int move, const board_t * board) {\r
-\r
- list_t list[1];\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
-\r
- gen_legal_moves(list,board);\r
-\r
- return list_contain(list,move);\r
-}\r
-\r
-// end of move_legal.cpp\r
-\r
+
+// move_legal.c
+
+// includes
+
+#include "attack.h"
+#include "colour.h"
+#include "fen.h"
+#include "list.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_gen.h"
+#include "move_legal.h"
+#include "piece.h"
+#include "square.h"
+#include "util.h"
+
+// prototypes
+
+static bool move_is_legal_debug (int move, const board_t * board);
+
+// functions
+
+// move_is_pseudo()
+
+bool move_is_pseudo(int move, const board_t * board) {
+
+ list_t list[1];
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ gen_moves(list,board);
+
+ return list_contain(list,move);
+}
+
+// pseudo_is_legal()
+
+bool pseudo_is_legal(int move, const board_t * board) {
+
+ board_t new_board[1];
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ ASSERT(move_is_pseudo(move,board));
+
+ board_copy(new_board,board);
+ move_do(new_board,move);
+
+ return !is_in_check(new_board,colour_opp(new_board->turn));
+}
+
+// move_is_legal()
+
+bool move_is_legal(int move, const board_t * board) {
+
+ bool legal;
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ legal = move_is_pseudo(move,board) && pseudo_is_legal(move,board);
+ ASSERT(legal==move_is_legal_debug(move,board));
+
+ return legal;
+}
+
+// filter_legal()
+
+void filter_legal(list_t * list, const board_t * board) {
+
+ int pos;
+ int i, move, value;
+
+ ASSERT(list_is_ok(list));
+ ASSERT(board_is_ok(board));
+
+ pos = 0;
+
+ for (i = 0; i < list_size(list); i++) {
+
+ ASSERT(pos>=0&&pos<=i);
+
+ move = list_move(list,i);
+ value = list_value(list,i);
+
+ if (pseudo_is_legal(move,board)) {
+ list->move[pos] = move;
+ list->value[pos] = value;
+ pos++;
+ }
+ }
+
+ ASSERT(pos>=0&&pos<=list_size(list));
+ list->size = pos;
+}
+
+// move_is_legal_debug()
+
+static bool move_is_legal_debug(int move, const board_t * board) {
+
+ list_t list[1];
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+
+ gen_legal_moves(list,board);
+
+ return list_contain(list,move);
+}
+
+// end of move_legal.cpp
+
-\r
-// move_legal.h\r
-\r
-#ifndef MOVE_LEGAL_H\r
-#define MOVE_LEGAL_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "list.h"\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-extern bool move_is_pseudo (int move, const board_t * board);\r
-extern bool pseudo_is_legal (int move, const board_t * board);\r
-extern bool move_is_legal (int move, const board_t * board);\r
-\r
-extern void filter_legal (list_t * list, const board_t * board);\r
-\r
-#endif // !defined MOVE_LEGAL_H\r
-\r
-// end of move_legal.h\r
-\r
+
+// move_legal.h
+
+#ifndef MOVE_LEGAL_H
+#define MOVE_LEGAL_H
+
+// includes
+
+#include "board.h"
+#include "list.h"
+#include "util.h"
+
+// functions
+
+extern bool move_is_pseudo (int move, const board_t * board);
+extern bool pseudo_is_legal (int move, const board_t * board);
+extern bool move_is_legal (int move, const board_t * board);
+
+extern void filter_legal (list_t * list, const board_t * board);
+
+#endif // !defined MOVE_LEGAL_H
+
+// end of move_legal.h
+
-\r
-// option.c\r
-\r
-// includes\r
-\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "option.h"\r
-#include "util.h"\r
-\r
-\r
-// defines\r
-\r
-#define NNB { NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL }\r
-\r
-// constants\r
-\r
-static const bool UseDebug = FALSE;\r
-static const int StringSize = 4096;\r
-\r
-// variables\r
-\r
-\r
-option_list_t Option[1];\r
-\r
-option_t DefaultOptions[] = { \r
- // options\r
-\r
- { "SettingsFile", "file","0","0", "polyglot.ini", NULL,0,NNB, PG|XBOARD|XBSEL}, \r
-\r
- { "SettingsDir", "path","0","0", "<empty>" , NULL,0,NNB, PG},\r
-\r
- { "OnlyWbOptions", "check","0","0", "true" , NULL,0,NNB, PG|XBOARD},\r
-\r
- { "EngineName", "string","0","0", "<empty>" , NULL,0,NNB, PG}, \r
- { "EngineDir", "path","0","0", "." , NULL,0,NNB, PG}, \r
- { "EngineCommand", "string","0","0", "<empty>" , NULL,0,NNB, PG}, \r
-\r
- { "Log", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI}, \r
- { "LogFile", "file","0","0", "polyglot.log", NULL,0,NNB, PG|XBOARD|XBSEL|UCI}, \r
-\r
- { "UCI", "check","0","0", "false" , NULL,0,NNB, PG}, \r
-\r
- { "UseNice", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD|UCI}, \r
- { "NiceValue", "spin", "0","20", "5" , NULL,0,NNB, PG|XBOARD|UCI}, \r
-\r
- { "Resign", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD|XBSEL}, \r
- { "ResignMoves", "spin","0","10000", "3" , NULL,0,NNB, PG|XBOARD|XBSEL}, \r
- { "ResignScore", "spin","0","10000", "600" , NULL,0,NNB, PG|XBOARD|XBSEL}, \r
-\r
- { "MateScore", "spin","0","100000", "10000" , NULL,0,NNB, PG|XBOARD}, \r
-\r
- { "Book", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI}, \r
- { "BookFile", "file","0","0", "book.bin" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI}, \r
-\r
- { "BookRandom", "check","0","0", "true" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI}, \r
- { "BookDepth", "spin","0","256", "256" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI}, \r
- { "BookTreshold", "spin","0","1000", "5" , NULL,0,NNB, PG|XBOARD|UCI}, \r
- { "BookLearn", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD}, \r
-\r
- { "KibitzMove", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD}, \r
- { "KibitzPV", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD}, \r
-\r
- { "KibitzCommand", "string","0","0", "tellall" , NULL,0,NNB, PG|XBOARD}, \r
- { "KibitzDelay", "spin","0","1000", "5" , NULL,0,NNB, PG|XBOARD}, \r
- { "KibitzInterval", "spin","0","1000", "0" , NULL,0,NNB, PG|XBOARD}, \r
-\r
- { "ShowPonder", "check","0","0", "true" , NULL,0,NNB, PG|XBOARD}, \r
- { "ScoreWhite", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD}, \r
-\r
- // work-arounds\r
-\r
- { "UCIVersion", "spin","1","2", "2" , NULL,0,NNB, PG|XBOARD}, \r
- { "CanPonder", "check","1","2", "false" , NULL,0,NNB, PG|XBOARD}, \r
- { "SyncStop", "check","1","2", "false" , NULL,0,NNB, PG|XBOARD|XBSEL}, \r
- { "Affinity", "spin","-1","32", "-1" , NULL,0,NNB, PG}, \r
- { "RepeatPV", "check","0","0", "true" , NULL,0,NNB, PG|XBOARD},\r
- { "PromoteWorkAround","check","0","0", "false" , NULL,0,NNB, PG|XBOARD},\r
-\r
- // internal\r
-\r
- { "Chess960", "check","0","0", "false" , NULL,0,NNB, PG}, \r
-\r
- // These options flag various hacks in the source to work around\r
- // WB quirks. They will eventually all be set to false. Probably\r
- // in 4.5.0\r
- \r
- { "WbWorkArounds", "check","0","0", "true" , NULL,0,NNB, PG}, \r
- { "WbWorkArounds2", "check","0","0", "false" , NULL,0,NNB, PG}, \r
- { "WbWorkArounds3", "check","0","0", "true" , NULL,0,NNB, PG}, \r
-\r
- // Buttons\r
-\r
- { "Save", "save","0","0", "false" , NULL,0,NNB, PG|XBOARD|XBSEL},\r
-\r
- // Sentinel\r
- \r
- { NULL, NULL,"0","0", NULL , NULL,0,NNB, 0},\r
-\r
-};\r
-\r
-\r
-// functions\r
-\r
-// option_is_ok()\r
-\r
-bool option_is_ok(const option_list_t *option) {\r
- if(option->option_nb<0 || option->option_nb>=OptionNb){\r
- return FALSE;\r
- }\r
- return TRUE;\r
-}\r
-\r
-// option_init_pg()\r
-\r
-void option_init_pg() {\r
-\r
- int i;\r
- option_t *p=DefaultOptions;\r
- char *home_dir;\r
- char SettingsDir[StringSize];\r
- \r
- option_init(Option);\r
- while(p){\r
- if(p->name){\r
- option_insert(Option,p);\r
- p++;\r
- }else{\r
- break;\r
- }\r
- }\r
- for(i=0;i<Option->option_nb;i++){\r
- Option->options[i].value=my_strdup(Option->options[i].default_);\r
- }\r
-#ifndef _WIN32\r
- home_dir=getenv("HOME");\r
- if(!home_dir){\r
- home_dir=".";\r
- }\r
- snprintf(SettingsDir,sizeof(SettingsDir),"%s/.polyglot",home_dir);\r
- SettingsDir[sizeof(SettingsDir)-1]='\0';\r
-#else\r
- sprintf(SettingsDir,".\\_PG");\r
-#endif\r
- option_set(Option,"SettingsDir",SettingsDir);\r
- option_set_default(Option,"SettingsDir",SettingsDir);\r
-}\r
-\r
-// option_init()\r
-\r
-void option_init(option_list_t *option){\r
- ASSERT(option!=NULL);\r
- option->option_nb=0;\r
- option->iter=0;\r
- memset(option->options,0,sizeof(option->options));\r
-}\r
-\r
-// option_insert()\r
-\r
-void option_insert(option_list_t *option, option_t *new_option){\r
- int i;\r
- option_t *opt;\r
- ASSERT(option!=NULL);\r
- ASSERT(new_option!=NULL);\r
- ASSERT(new_option->name!=NULL);\r
- opt=option_find(option,new_option->name);\r
- if(!opt){\r
- opt=&option->options[option->option_nb];\r
- option->option_nb++;\r
- }\r
- if(option->option_nb>=OptionNb){\r
- my_fatal("option_insert(): option list overflow\n");\r
- }\r
- if(new_option->name) my_string_set(&opt->name, new_option->name);\r
- if(new_option->value) my_string_set(&opt->value, new_option->value);\r
- if(new_option->min) my_string_set(&opt->min, new_option->min);\r
- if(new_option->max) my_string_set(&opt->max, new_option->max);\r
- if(new_option->default_) my_string_set(&opt->default_, new_option->default_);\r
- if(new_option->type) my_string_set(&opt->type, new_option->type);\r
- opt->var_nb=new_option->var_nb;\r
- for(i=0;i<new_option->var_nb;i++){\r
- my_string_set(&opt->var[i], new_option->var[i]);\r
- }\r
- opt->mode=new_option->mode;\r
-}\r
-\r
-// option_set()\r
-\r
-bool option_set(option_list_t *option, \r
- const char name[], \r
- const char value[]) {\r
-\r
- option_t * opt;\r
- ASSERT(option!=NULL);\r
- ASSERT(name!=NULL);\r
- ASSERT(value!=NULL);\r
-\r
- opt = option_find(option,name);\r
- if (opt == NULL) return FALSE;\r
-\r
- if(my_string_case_equal(opt->type,"check")){\r
- value=(my_string_equal(value,"1")||\r
- my_string_case_equal(value,"true"))?"true":"false";\r
- }\r
-\r
- my_string_set(&opt->value,value);\r
-\r
- if (UseDebug) my_log("POLYGLOT OPTION SET \"%s\" -> \"%s\"\n",opt->name,opt->value);\r
-\r
- return TRUE;\r
-}\r
-\r
-// option_set_default()\r
-\r
-bool option_set_default(option_list_t *option,\r
- const char name[], \r
- const char value[]) {\r
-\r
- option_t * opt;\r
- ASSERT(name!=NULL);\r
- ASSERT(value!=NULL);\r
-\r
- opt = option_find(option,name);\r
- if (opt == NULL) return FALSE;\r
-\r
- if(my_string_case_equal(opt->type,"check")){\r
- value=(my_string_equal(value,"1")||\r
- my_string_case_equal(value,"true"))?"true":"false";\r
- }\r
-\r
- my_string_set(&opt->default_,value);\r
-\r
- if (UseDebug) my_log("POLYGLOT OPTION DEFAULT SET \"%s\" -> \"%s\"\n",opt->name,opt->default_);\r
-\r
- return TRUE;\r
-}\r
-\r
-// option_get()\r
-\r
-const char * option_get(option_list_t *option, const char name[]) {\r
-\r
- option_t * opt;\r
-\r
- ASSERT(name!=NULL);\r
-\r
- opt = option_find(option,name);\r
- if (opt == NULL) my_fatal("option_get(): unknown option \"%s\"\n",name);\r
- if (UseDebug) my_log("POLYGLOT OPTION GET \"%s\" -> \"%s\"\n",opt->name,opt->value);\r
-\r
- return opt->value;\r
-}\r
-\r
-// option_get_default()\r
-\r
-const char * option_get_default(option_list_t *option, const char name[]) {\r
-\r
- option_t * opt;\r
-\r
- ASSERT(name!=NULL);\r
-\r
- opt = option_find(option,name);\r
- if (opt == NULL) my_fatal("option_get(): unknown option \"%s\"\n",name);\r
-\r
- if (UseDebug) my_log("POLYGLOT OPTION GET \"%s\" -> \"%s\"\n",opt->name,opt->value);\r
-\r
- return opt->default_;\r
-}\r
-\r
-// option_get_bool()\r
-\r
-bool option_get_bool(option_list_t *option, const char name[]) {\r
-\r
- const char * value;\r
-\r
- value = option_get(option,name);\r
-\r
- if (FALSE) {\r
- } else if (my_string_case_equal(value,"true") || my_string_case_equal(value,"yes") || my_string_equal(value,"1")) {\r
- return TRUE;\r
- } else if (my_string_case_equal(value,"false") || my_string_case_equal(value,"no") || my_string_equal(value,"0")) {\r
- return FALSE;\r
- }\r
-\r
- ASSERT(FALSE);\r
-\r
- return FALSE;\r
-}\r
-\r
-\r
-// option_get_double()\r
-\r
-double option_get_double(option_list_t *option, const char name[]) {\r
-\r
- const char * value;\r
-\r
- value = option_get(option,name);\r
-\r
- return atof(value);\r
-}\r
-\r
-// option_get_int()\r
-\r
-int option_get_int(option_list_t *option, const char name[]) {\r
-\r
- const char * value;\r
-\r
- value = option_get(option,name);\r
-\r
- return atoi(value);\r
-}\r
-\r
-// option_get_string()\r
-\r
-const char * option_get_string(option_list_t *option, const char name[]) {\r
-\r
- const char * value;\r
-\r
- value = option_get(option,name);\r
-\r
- return value;\r
-}\r
-\r
-// option_find()\r
-\r
-option_t * option_find(option_list_t *option, const char name[]) {\r
-\r
- option_t * opt;\r
- int i;\r
-\r
- ASSERT(name!=NULL);\r
- for (i=0; i<option->option_nb; i++){\r
- opt=option->options+i;\r
- if (my_string_case_equal(opt->name,name)){\r
- return opt;\r
- }\r
- }\r
- \r
- return NULL;\r
-}\r
-\r
-// option_start_iter()\r
-\r
-void option_start_iter(option_list_t *option){\r
- option->iter=0;\r
-}\r
-\r
-// option_next()\r
-\r
-option_t * option_next(option_list_t *option){\r
- ASSERT(option->iter<=option->option_nb);\r
- if(option->iter==option->option_nb){\r
- return NULL;\r
- }\r
- return &option->options[option->iter++];\r
- \r
-}\r
-\r
-void option_free(option_t *option){\r
- int i;\r
- my_string_clear(&option->name);\r
- my_string_clear(&option->type);\r
- my_string_clear(&option->min);\r
- my_string_clear(&option->max);\r
- my_string_clear(&option->default_);\r
- my_string_clear(&option->value);\r
- for(i=0;i<option->var_nb;i++){\r
- my_string_clear(&option->var[i]);\r
- }\r
- option->var_nb=0;\r
- option->mode=0;\r
-}\r
-\r
-// option_clear()\r
-\r
-void option_clear(option_list_t *option){\r
- int i;\r
- for (i = 0; i < option->option_nb; i++) {\r
- option_free(option->options+i);\r
- }\r
- option->option_nb=0;\r
-}\r
-\r
-// option_from_ini()\r
-\r
-void option_from_ini(option_list_t *option,\r
- ini_t *ini,\r
- const char *section){\r
- ini_entry_t *entry;\r
- ini_start_iter(ini);\r
- while((entry=ini_next(ini))){\r
- option_set(option,entry->name,entry->value);\r
- option_set_default(option,entry->name,entry->value);\r
- }\r
-}\r
-\r
-// end of option.cpp\r
-\r
+
+// option.c
+
+// includes
+
+#include <stdlib.h>
+#include <string.h>
+
+#include "option.h"
+#include "util.h"
+
+
+// defines
+
+#define NNB { NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL }
+
+// constants
+
+static const bool UseDebug = FALSE;
+
+// variables
+
+
+option_list_t Option[1];
+
+option_t DefaultOptions[] = {
+ // options
+
+ { "SettingsFile", "file","0","0", "polyglot.ini", NULL,0,NNB, PG|XBOARD|XBSEL},
+
+ { "SettingsDir", "path","0","0", "<empty>" , NULL,0,NNB, PG},
+
+ { "OnlyWbOptions", "check","0","0", "true" , NULL,0,NNB, PG|XBOARD},
+
+ { "EngineName", "string","0","0", "<empty>" , NULL,0,NNB, PG},
+ { "EngineDir", "path","0","0", "." , NULL,0,NNB, PG},
+ { "EngineCommand", "string","0","0", "<empty>" , NULL,0,NNB, PG},
+
+ { "Log", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI},
+ { "LogFile", "file","0","0", "polyglot.log", NULL,0,NNB, PG|XBOARD|XBSEL|UCI},
+
+ { "UCI", "check","0","0", "false" , NULL,0,NNB, PG},
+
+ { "UseNice", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD|UCI},
+ { "NiceValue", "spin", "0","20", "5" , NULL,0,NNB, PG|XBOARD|UCI},
+
+ { "Resign", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD|XBSEL},
+ { "ResignMoves", "spin","0","10000", "3" , NULL,0,NNB, PG|XBOARD|XBSEL},
+ { "ResignScore", "spin","0","10000", "600" , NULL,0,NNB, PG|XBOARD|XBSEL},
+
+ { "MateScore", "spin","0","100000", "10000" , NULL,0,NNB, PG|XBOARD},
+
+ { "Book", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI},
+ { "BookFile", "file","0","0", "book.bin" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI},
+
+ { "BookRandom", "check","0","0", "true" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI},
+ { "BookDepth", "spin","0","256", "256" , NULL,0,NNB, PG|XBOARD|XBSEL|UCI},
+ { "BookTreshold", "spin","0","1000", "5" , NULL,0,NNB, PG|XBOARD|UCI},
+ { "BookLearn", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD},
+
+ { "KibitzMove", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD},
+ { "KibitzPV", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD},
+
+ { "KibitzCommand", "string","0","0", "tellall" , NULL,0,NNB, PG|XBOARD},
+ { "KibitzDelay", "spin","0","1000", "5" , NULL,0,NNB, PG|XBOARD},
+ { "KibitzInterval", "spin","0","1000", "0" , NULL,0,NNB, PG|XBOARD},
+
+ { "ShowPonder", "check","0","0", "true" , NULL,0,NNB, PG|XBOARD},
+ { "ScoreWhite", "check","0","0", "false" , NULL,0,NNB, PG|XBOARD},
+
+ // work-arounds
+
+ { "UCIVersion", "spin","1","2", "2" , NULL,0,NNB, PG|XBOARD},
+ { "CanPonder", "check","1","2", "false" , NULL,0,NNB, PG|XBOARD},
+ { "SyncStop", "check","1","2", "false" , NULL,0,NNB, PG|XBOARD|XBSEL},
+ { "Affinity", "spin","-1","32", "-1" , NULL,0,NNB, PG},
+ { "RepeatPV", "check","0","0", "true" , NULL,0,NNB, PG|XBOARD},
+ { "PromoteWorkAround","check","0","0", "false" , NULL,0,NNB, PG|XBOARD},
+
+ // internal
+
+ { "Chess960", "check","0","0", "false" , NULL,0,NNB, PG},
+
+ // These options flag various hacks in the source to work around
+ // WB quirks. They will eventually all be set to false. Probably
+ // in 4.5.0
+
+ { "WbWorkArounds", "check","0","0", "true" , NULL,0,NNB, PG},
+ { "WbWorkArounds2", "check","0","0", "false" , NULL,0,NNB, PG},
+ { "WbWorkArounds3", "check","0","0", "true" , NULL,0,NNB, PG},
+
+ // Buttons
+
+ { "Save", "save","0","0", "false" , NULL,0,NNB, PG|XBOARD|XBSEL},
+
+ // Sentinel
+
+ { NULL, NULL,"0","0", NULL , NULL,0,NNB, 0},
+
+};
+
+
+// functions
+
+// option_is_ok()
+
+bool option_is_ok(const option_list_t *option) {
+ if(option->option_nb<0 || option->option_nb>=OptionNb){
+ return FALSE;
+ }
+ return TRUE;
+}
+
+// option_init_pg()
+
+void option_init_pg() {
+
+ int i;
+ option_t *p=DefaultOptions;
+ char *home_dir;
+ char SettingsDir[StringSize];
+
+ option_init(Option);
+ while(p){
+ if(p->name){
+ option_insert(Option,p);
+ p++;
+ }else{
+ break;
+ }
+ }
+ for(i=0;i<Option->option_nb;i++){
+ Option->options[i].value=my_strdup(Option->options[i].default_);
+ }
+#ifndef _WIN32
+ home_dir=getenv("HOME");
+ if(!home_dir){
+ home_dir=".";
+ }
+ snprintf(SettingsDir,sizeof(SettingsDir),"%s/.polyglot",home_dir);
+ SettingsDir[sizeof(SettingsDir)-1]='\0';
+#else
+ sprintf(SettingsDir,".\\_PG");
+#endif
+ option_set(Option,"SettingsDir",SettingsDir);
+ option_set_default(Option,"SettingsDir",SettingsDir);
+}
+
+// option_init()
+
+void option_init(option_list_t *option){
+ ASSERT(option!=NULL);
+ option->option_nb=0;
+ option->iter=0;
+ memset(option->options,0,sizeof(option->options));
+}
+
+// option_insert()
+
+void option_insert(option_list_t *option, option_t *new_option){
+ int i;
+ option_t *opt;
+ ASSERT(option!=NULL);
+ ASSERT(new_option!=NULL);
+ ASSERT(new_option->name!=NULL);
+ opt=option_find(option,new_option->name);
+ if(!opt){
+ opt=&option->options[option->option_nb];
+ option->option_nb++;
+ }
+ if(option->option_nb>=OptionNb){
+ my_fatal("option_insert(): option list overflow\n");
+ }
+ if(new_option->name) my_string_set(&opt->name, new_option->name);
+ if(new_option->value) my_string_set(&opt->value, new_option->value);
+ if(new_option->min) my_string_set(&opt->min, new_option->min);
+ if(new_option->max) my_string_set(&opt->max, new_option->max);
+ if(new_option->default_) my_string_set(&opt->default_, new_option->default_);
+ if(new_option->type) my_string_set(&opt->type, new_option->type);
+ opt->var_nb=new_option->var_nb;
+ for(i=0;i<new_option->var_nb;i++){
+ my_string_set(&opt->var[i], new_option->var[i]);
+ }
+ opt->mode=new_option->mode;
+}
+
+// option_set()
+
+bool option_set(option_list_t *option,
+ const char name[],
+ const char value[]) {
+
+ option_t * opt;
+ ASSERT(option!=NULL);
+ ASSERT(name!=NULL);
+ ASSERT(value!=NULL);
+
+ opt = option_find(option,name);
+ if (opt == NULL) return FALSE;
+
+ if(my_string_case_equal(opt->type,"check")){
+ value=(my_string_equal(value,"1")||
+ my_string_case_equal(value,"true"))?"true":"false";
+ }
+
+ my_string_set(&opt->value,value);
+
+ if (UseDebug) my_log("POLYGLOT OPTION SET \"%s\" -> \"%s\"\n",opt->name,opt->value);
+
+ return TRUE;
+}
+
+// option_set_default()
+
+bool option_set_default(option_list_t *option,
+ const char name[],
+ const char value[]) {
+
+ option_t * opt;
+ ASSERT(name!=NULL);
+ ASSERT(value!=NULL);
+
+ opt = option_find(option,name);
+ if (opt == NULL) return FALSE;
+
+ if(my_string_case_equal(opt->type,"check")){
+ value=(my_string_equal(value,"1")||
+ my_string_case_equal(value,"true"))?"true":"false";
+ }
+
+ my_string_set(&opt->default_,value);
+
+ if (UseDebug) my_log("POLYGLOT OPTION DEFAULT SET \"%s\" -> \"%s\"\n",opt->name,opt->default_);
+
+ return TRUE;
+}
+
+// option_get()
+
+const char * option_get(option_list_t *option, const char name[]) {
+
+ option_t * opt;
+
+ ASSERT(name!=NULL);
+
+ opt = option_find(option,name);
+ if (opt == NULL) my_fatal("option_get(): unknown option \"%s\"\n",name);
+ if (UseDebug) my_log("POLYGLOT OPTION GET \"%s\" -> \"%s\"\n",opt->name,opt->value);
+
+ return opt->value;
+}
+
+// option_get_default()
+
+const char * option_get_default(option_list_t *option, const char name[]) {
+
+ option_t * opt;
+
+ ASSERT(name!=NULL);
+
+ opt = option_find(option,name);
+ if (opt == NULL) my_fatal("option_get(): unknown option \"%s\"\n",name);
+
+ if (UseDebug) my_log("POLYGLOT OPTION GET \"%s\" -> \"%s\"\n",opt->name,opt->value);
+
+ return opt->default_;
+}
+
+// option_get_bool()
+
+bool option_get_bool(option_list_t *option, const char name[]) {
+
+ const char * value;
+
+ value = option_get(option,name);
+
+ if (FALSE) {
+ } else if (my_string_case_equal(value,"true") || my_string_case_equal(value,"yes") || my_string_equal(value,"1")) {
+ return TRUE;
+ } else if (my_string_case_equal(value,"false") || my_string_case_equal(value,"no") || my_string_equal(value,"0")) {
+ return FALSE;
+ }
+
+ ASSERT(FALSE);
+
+ return FALSE;
+}
+
+
+// option_get_double()
+
+double option_get_double(option_list_t *option, const char name[]) {
+
+ const char * value;
+
+ value = option_get(option,name);
+
+ return atof(value);
+}
+
+// option_get_int()
+
+int option_get_int(option_list_t *option, const char name[]) {
+
+ const char * value;
+
+ value = option_get(option,name);
+
+ return atoi(value);
+}
+
+// option_get_string()
+
+const char * option_get_string(option_list_t *option, const char name[]) {
+
+ const char * value;
+
+ value = option_get(option,name);
+
+ return value;
+}
+
+// option_find()
+
+option_t * option_find(option_list_t *option, const char name[]) {
+
+ option_t * opt;
+ int i;
+
+ ASSERT(name!=NULL);
+ for (i=0; i<option->option_nb; i++){
+ opt=option->options+i;
+ if (my_string_case_equal(opt->name,name)){
+ return opt;
+ }
+ }
+
+ return NULL;
+}
+
+// option_start_iter()
+
+void option_start_iter(option_list_t *option){
+ option->iter=0;
+}
+
+// option_next()
+
+option_t * option_next(option_list_t *option){
+ ASSERT(option->iter<=option->option_nb);
+ if(option->iter==option->option_nb){
+ return NULL;
+ }
+ return &option->options[option->iter++];
+
+}
+
+void option_free(option_t *option){
+ int i;
+ my_string_clear(&option->name);
+ my_string_clear(&option->type);
+ my_string_clear(&option->min);
+ my_string_clear(&option->max);
+ my_string_clear(&option->default_);
+ my_string_clear(&option->value);
+ for(i=0;i<option->var_nb;i++){
+ my_string_clear(&option->var[i]);
+ }
+ option->var_nb=0;
+ option->mode=0;
+}
+
+// option_clear()
+
+void option_clear(option_list_t *option){
+ int i;
+ for (i = 0; i < option->option_nb; i++) {
+ option_free(option->options+i);
+ }
+ option->option_nb=0;
+}
+
+// option_from_ini()
+
+void option_from_ini(option_list_t *option,
+ ini_t *ini,
+ const char *section){
+ ini_entry_t *entry;
+ ini_start_iter(ini);
+ while((entry=ini_next(ini))){
+ option_set(option,entry->name,entry->value);
+ option_set_default(option,entry->name,entry->value);
+ }
+}
+
+// end of option.cpp
+
-\r
-// option.h\r
-\r
-#ifndef OPTION_H\r
-#define OPTION_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-#include "ini.h"\r
-\r
-// defines\r
-\r
-#define VarNb 16\r
-#define XBOARD (1<<0)\r
-#define UCI (1<<1)\r
-#define PG (1<<2)\r
-#define XBSEL (1<<3)\r
-#define OptionNb 256\r
-\r
-#define IS_BUTTON(str) (my_string_case_equal(str,"button") || \\r
- my_string_case_equal(str,"save") || \\r
- my_string_case_equal(str,"reset")) \\r
-\r
-#define IS_SPIN(str) (my_string_case_equal(str,"spin") || \\r
- my_string_case_equal(str,"slider")) \\r
-\r
-#define IS_STRING(str) (my_string_case_equal(str,"string") || \\r
- my_string_case_equal(str,"path") || \\r
- my_string_case_equal(str,"file")) \\r
-\r
-// types\r
-\r
-typedef struct { // TODO: put back in more logical order\r
- const char * name;\r
- const char * type;\r
- const char * min;\r
- const char * max;\r
- const char * default_;\r
- const char * value;\r
- int var_nb;\r
- const char * var[VarNb];\r
- int mode;\r
-} option_t;\r
-\r
-// all non NULL data in an option_list_t should be malloc'ed\r
-// use "my_string_set" to fill it. \r
-\r
-typedef struct {\r
- option_t options[OptionNb];\r
- int option_nb;\r
- int iter;\r
-} option_list_t;\r
-\r
-// variables\r
-\r
-extern option_list_t Option[1];\r
-\r
-// functions\r
-\r
-\r
-extern void option_init (option_list_t *option);\r
-\r
-extern void option_init_pg ();\r
-\r
-extern bool option_set (option_list_t *option,\r
- const char var[],\r
- const char val[]);\r
-extern bool option_set_default (option_list_t *option,\r
- const char var[],\r
- const char val[]);\r
-\r
-extern const char * option_get (option_list_t *option, const char var[]);\r
-extern const char * option_get_default (option_list_t *option, const char var[]);\r
-\r
-extern bool option_get_bool (option_list_t *option, const char var[]);\r
-extern double option_get_double (option_list_t *option, const char var[]);\r
-extern int option_get_int (option_list_t *option, const char var[]);\r
-extern const char * option_get_string (option_list_t *option, const char var[]);\r
-\r
-extern void option_from_ini (option_list_t *option,\r
- ini_t *ini,\r
- const char *section);\r
-\r
-extern bool option_is_ok (const option_list_t *option);\r
-extern option_t * option_find (option_list_t *option, const char var[]);\r
-extern void option_clear (option_list_t *option);\r
-extern void option_insert (option_list_t *option, option_t *new_option);\r
-\r
-extern void option_start_iter (option_list_t *option);\r
-extern option_t * option_next (option_list_t *option);\r
-\r
-extern void option_free (option_t *option);\r
-\r
-#endif // !defined OPTION_H\r
-\r
-// end of option.h\r
-\r
+
+// option.h
+
+#ifndef OPTION_H
+#define OPTION_H
+
+// includes
+
+#include "util.h"
+#include "ini.h"
+
+// defines
+
+#define VarNb 16
+#define XBOARD (1<<0)
+#define UCI (1<<1)
+#define PG (1<<2)
+#define XBSEL (1<<3)
+#define OptionNb 256
+
+#define IS_BUTTON(str) (my_string_case_equal(str,"button") || \
+ my_string_case_equal(str,"save") || \
+ my_string_case_equal(str,"reset")) \
+
+#define IS_SPIN(str) (my_string_case_equal(str,"spin") || \
+ my_string_case_equal(str,"slider")) \
+
+#define IS_STRING(str) (my_string_case_equal(str,"string") || \
+ my_string_case_equal(str,"path") || \
+ my_string_case_equal(str,"file")) \
+
+// types
+
+typedef struct { // TODO: put back in more logical order
+ const char * name;
+ const char * type;
+ const char * min;
+ const char * max;
+ const char * default_;
+ const char * value;
+ int var_nb;
+ const char * var[VarNb];
+ int mode;
+} option_t;
+
+// all non NULL data in an option_list_t should be malloc'ed
+// use "my_string_set" to fill it.
+
+typedef struct {
+ option_t options[OptionNb];
+ int option_nb;
+ int iter;
+} option_list_t;
+
+// variables
+
+extern option_list_t Option[1];
+
+// functions
+
+
+extern void option_init (option_list_t *option);
+
+extern void option_init_pg ();
+
+extern bool option_set (option_list_t *option,
+ const char var[],
+ const char val[]);
+extern bool option_set_default (option_list_t *option,
+ const char var[],
+ const char val[]);
+
+extern const char * option_get (option_list_t *option, const char var[]);
+extern const char * option_get_default (option_list_t *option, const char var[]);
+
+extern bool option_get_bool (option_list_t *option, const char var[]);
+extern double option_get_double (option_list_t *option, const char var[]);
+extern int option_get_int (option_list_t *option, const char var[]);
+extern const char * option_get_string (option_list_t *option, const char var[]);
+
+extern void option_from_ini (option_list_t *option,
+ ini_t *ini,
+ const char *section);
+
+extern bool option_is_ok (const option_list_t *option);
+extern option_t * option_find (option_list_t *option, const char var[]);
+extern void option_clear (option_list_t *option);
+extern void option_insert (option_list_t *option, option_t *new_option);
+
+extern void option_start_iter (option_list_t *option);
+extern option_t * option_next (option_list_t *option);
+
+extern void option_free (option_t *option);
+
+#endif // !defined OPTION_H
+
+// end of option.h
+
-\r
-// parse.c\r
-\r
-// includes\r
-\r
-#include <string.h>\r
-\r
-#include "parse.h"\r
-#include "util.h"\r
-\r
-// constants\r
-\r
-#define StringSize ((int)256)\r
-\r
-// variables\r
-\r
-char * Star[STAR_NUMBER];\r
-\r
-// prototypes\r
-\r
-static bool match_rec (char string[], const char pattern[], char * star[]);\r
-\r
-// functions\r
-\r
-// match()\r
-\r
-bool match(char string[], const char pattern[]) {\r
-\r
- ASSERT(string!=NULL);\r
- ASSERT(pattern!=NULL);\r
-\r
- ASSERT(strstr(pattern,"**")==NULL);\r
-\r
- return match_rec(string,pattern,Star);\r
-}\r
-\r
-// match_rec()\r
-\r
-static bool match_rec(char string[], const char pattern[], char * star[]) {\r
-\r
- int c;\r
-\r
- ASSERT(string!=NULL);\r
- ASSERT(pattern!=NULL);\r
- ASSERT(star!=NULL);\r
-\r
- // iterative matches\r
-\r
- while ((c=*pattern++) != '*') {\r
- if (FALSE) {\r
- } else if (c == '\0') { // end of pattern\r
- while (*string == ' ') string++; // skip trailing spaces\r
- return *string == '\0';\r
- } else if (c == ' ') { // spaces\r
- if (*string++ != ' ') return FALSE; // mismatch\r
- while (*string == ' ') string++; // skip trailing spaces\r
- } else { // normal character\r
- if (*string++ != c) return FALSE; // mismatch\r
- }\r
- }\r
-\r
- // recursive wildcard match\r
-\r
- ASSERT(c=='*');\r
-\r
- while (*string == ' ') string++; // skip leading spaces\r
- *star++ = string; // remember beginning of star\r
-\r
- while ((c=*string++) != '\0') { // reject empty-string match\r
- if (c != ' ' && match_rec(string,pattern,star)) { // shortest match\r
- ASSERT(string>star[-1]);\r
- *string = '\0'; // truncate star\r
- return TRUE;\r
- }\r
- }\r
-\r
- return FALSE;\r
-}\r
-\r
-// parse_is_ok()\r
-\r
-bool parse_is_ok(const parse_t * parse) {\r
-\r
- if (parse == NULL) return FALSE;\r
- if (parse->string == NULL) return FALSE;\r
- if (parse->pos < 0 || parse->pos > (int) strlen(parse->string)) return FALSE;\r
- if (parse->keyword_nb < 0 || parse->keyword_nb >= KEYWORD_NUMBER) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// parse_open()\r
-\r
-void parse_open(parse_t * parse, const char string[]) {\r
-\r
- ASSERT(parse!=NULL);\r
- ASSERT(string!=NULL);\r
-\r
- parse->string = string;\r
- parse->pos = 0;\r
- parse->keyword_nb = 0;\r
-}\r
-\r
-// parse_close()\r
-\r
-void parse_close(parse_t * parse) {\r
-\r
- int i;\r
-\r
- ASSERT(parse_is_ok(parse));\r
-\r
- parse->string = NULL;\r
- parse->pos = 0;\r
-\r
- for (i = 0; i < parse->keyword_nb; i++) {\r
- my_string_clear(&parse->keyword[i]);\r
- }\r
-\r
- parse->keyword_nb = 0;\r
-}\r
-\r
-// parse_add_keyword()\r
-\r
-void parse_add_keyword(parse_t * parse, const char keyword[]) {\r
-\r
- const char * * string;\r
-\r
- ASSERT(parse_is_ok(parse));\r
- ASSERT(keyword!=NULL);\r
-\r
- if (parse->keyword_nb < KEYWORD_NUMBER) {\r
-\r
- string = &parse->keyword[parse->keyword_nb];\r
- parse->keyword_nb++;\r
-\r
- *string = NULL;\r
- my_string_set(string,keyword);\r
- }\r
-}\r
-\r
-// parse_get_word()\r
-\r
-bool parse_get_word(parse_t * parse, char string[], int size) {\r
-\r
- int pos;\r
- int c;\r
-\r
- ASSERT(parse!=NULL);\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=256);\r
-\r
- // skip blanks\r
-\r
- for (; parse->string[parse->pos] == ' '; parse->pos++)\r
- ;\r
-\r
- ASSERT(parse->string[parse->pos]!=' ');\r
-\r
- // copy word\r
-\r
- pos = 0;\r
-\r
- while (TRUE) {\r
-\r
- c = parse->string[parse->pos];\r
- if (c == ' ' || pos >= size-1) c = '\0';\r
-\r
- string[pos] = c;\r
- if (c == '\0') break;\r
-\r
- parse->pos++;\r
- pos++;\r
- }\r
-\r
- ASSERT(strchr(string,' ')==NULL);\r
-\r
- return pos > 0; // non-empty word?\r
-}\r
-\r
-// parse_get_string()\r
-\r
-bool parse_get_string(parse_t * parse, char string[], int size) {\r
-\r
- int pos;\r
- parse_t parse_2[1];\r
- char word[StringSize];\r
- int i;\r
- int c;\r
-\r
- ASSERT(parse!=NULL);\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=256);\r
-\r
- // skip blanks\r
-\r
- for (; parse->string[parse->pos] == ' '; parse->pos++)\r
- ;\r
-\r
- ASSERT(parse->string[parse->pos]!=' ');\r
-\r
- // copy string\r
-\r
- pos = 0;\r
-\r
- while (TRUE) {\r
-\r
- parse_open(parse_2,&parse->string[parse->pos]);\r
-\r
- if (!parse_get_word(parse_2,word,StringSize)) {\r
- string[pos] = '\0';\r
- parse_close(parse_2);\r
- goto finished;\r
- }\r
-\r
- for (i = 0; i < parse->keyword_nb; i++) {\r
- if (my_string_equal(parse->keyword[i],word)) {\r
- string[pos] = '\0';\r
- parse_close(parse_2);\r
- goto finished;\r
- }\r
- }\r
-\r
- parse_close(parse_2);\r
-\r
- // copy spaces\r
-\r
- while (TRUE) {\r
-\r
- c = parse->string[parse->pos];\r
- if (c != ' ') break;\r
-\r
- if (pos >= size-1) c = '\0';\r
-\r
- string[pos] = c;\r
- if (c == '\0') break;\r
-\r
- parse->pos++;\r
- pos++;\r
- }\r
-\r
- // copy non spaces\r
-\r
- while (TRUE) {\r
-\r
- c = parse->string[parse->pos];\r
- if (c == ' ' || pos >= size-1) c = '\0';\r
-\r
- string[pos] = c;\r
- if (c == '\0') break;\r
-\r
- parse->pos++;\r
- pos++;\r
- }\r
-\r
- string[pos] = '\0';\r
- }\r
-\r
-finished: ;\r
-\r
- return pos > 0; // non-empty string?\r
-}\r
-\r
-// end of parse.cpp\r
-\r
+
+// parse.c
+
+// includes
+
+#include <string.h>
+
+#include "parse.h"
+#include "util.h"
+
+// variables
+
+char * Star[STAR_NUMBER];
+
+// prototypes
+
+static bool match_rec (char string[], const char pattern[], char * star[]);
+
+// functions
+
+// match()
+
+bool match(char string[], const char pattern[]) {
+
+ ASSERT(string!=NULL);
+ ASSERT(pattern!=NULL);
+
+ ASSERT(strstr(pattern,"**")==NULL);
+
+ return match_rec(string,pattern,Star);
+}
+
+// match_rec()
+
+static bool match_rec(char string[], const char pattern[], char * star[]) {
+
+ int c;
+
+ ASSERT(string!=NULL);
+ ASSERT(pattern!=NULL);
+ ASSERT(star!=NULL);
+
+ // iterative matches
+
+ while ((c=*pattern++) != '*') {
+ if (FALSE) {
+ } else if (c == '\0') { // end of pattern
+ while (*string == ' ') string++; // skip trailing spaces
+ return *string == '\0';
+ } else if (c == ' ') { // spaces
+ if (*string++ != ' ') return FALSE; // mismatch
+ while (*string == ' ') string++; // skip trailing spaces
+ } else { // normal character
+ if (*string++ != c) return FALSE; // mismatch
+ }
+ }
+
+ // recursive wildcard match
+
+ ASSERT(c=='*');
+
+ while (*string == ' ') string++; // skip leading spaces
+ *star++ = string; // remember beginning of star
+
+ while ((c=*string++) != '\0') { // reject empty-string match
+ if (c != ' ' && match_rec(string,pattern,star)) { // shortest match
+ ASSERT(string>star[-1]);
+ *string = '\0'; // truncate star
+ return TRUE;
+ }
+ }
+
+ return FALSE;
+}
+
+// parse_is_ok()
+
+bool parse_is_ok(const parse_t * parse) {
+
+ if (parse == NULL) return FALSE;
+ if (parse->string == NULL) return FALSE;
+ if (parse->pos < 0 || parse->pos > (int) strlen(parse->string)) return FALSE;
+ if (parse->keyword_nb < 0 || parse->keyword_nb >= KEYWORD_NUMBER) return FALSE;
+
+ return TRUE;
+}
+
+// parse_open()
+
+void parse_open(parse_t * parse, const char string[]) {
+
+ ASSERT(parse!=NULL);
+ ASSERT(string!=NULL);
+
+ parse->string = string;
+ parse->pos = 0;
+ parse->keyword_nb = 0;
+}
+
+// parse_close()
+
+void parse_close(parse_t * parse) {
+
+ int i;
+
+ ASSERT(parse_is_ok(parse));
+
+ parse->string = NULL;
+ parse->pos = 0;
+
+ for (i = 0; i < parse->keyword_nb; i++) {
+ my_string_clear(&parse->keyword[i]);
+ }
+
+ parse->keyword_nb = 0;
+}
+
+// parse_add_keyword()
+
+void parse_add_keyword(parse_t * parse, const char keyword[]) {
+
+ const char * * string;
+
+ ASSERT(parse_is_ok(parse));
+ ASSERT(keyword!=NULL);
+
+ if (parse->keyword_nb < KEYWORD_NUMBER) {
+
+ string = &parse->keyword[parse->keyword_nb];
+ parse->keyword_nb++;
+
+ *string = NULL;
+ my_string_set(string,keyword);
+ }
+}
+
+// parse_get_word()
+
+bool parse_get_word(parse_t * parse, char string[], int size) {
+
+ int pos;
+ int c;
+
+ ASSERT(parse!=NULL);
+ ASSERT(string!=NULL);
+ ASSERT(size>=256);
+
+ // skip blanks
+
+ for (; parse->string[parse->pos] == ' '; parse->pos++)
+ ;
+
+ ASSERT(parse->string[parse->pos]!=' ');
+
+ // copy word
+
+ pos = 0;
+
+ while (TRUE) {
+
+ c = parse->string[parse->pos];
+ if (c == ' ' || pos >= size-1) c = '\0';
+
+ string[pos] = c;
+ if (c == '\0') break;
+
+ parse->pos++;
+ pos++;
+ }
+
+ ASSERT(strchr(string,' ')==NULL);
+
+ return pos > 0; // non-empty word?
+}
+
+// parse_get_string()
+
+bool parse_get_string(parse_t * parse, char string[], int size) {
+
+ int pos;
+ parse_t parse_2[1];
+ char word[StringSize];
+ int i;
+ int c;
+
+ ASSERT(parse!=NULL);
+ ASSERT(string!=NULL);
+ ASSERT(size>=256);
+
+ // skip blanks
+
+ for (; parse->string[parse->pos] == ' '; parse->pos++)
+ ;
+
+ ASSERT(parse->string[parse->pos]!=' ');
+
+ // copy string
+
+ pos = 0;
+
+ while (TRUE) {
+
+ parse_open(parse_2,&parse->string[parse->pos]);
+
+ if (!parse_get_word(parse_2,word,StringSize)) {
+ string[pos] = '\0';
+ parse_close(parse_2);
+ goto finished;
+ }
+
+ for (i = 0; i < parse->keyword_nb; i++) {
+ if (my_string_equal(parse->keyword[i],word)) {
+ string[pos] = '\0';
+ parse_close(parse_2);
+ goto finished;
+ }
+ }
+
+ parse_close(parse_2);
+
+ // copy spaces
+
+ while (TRUE) {
+
+ c = parse->string[parse->pos];
+ if (c != ' ') break;
+
+ if (pos >= size-1) c = '\0';
+
+ string[pos] = c;
+ if (c == '\0') break;
+
+ parse->pos++;
+ pos++;
+ }
+
+ // copy non spaces
+
+ while (TRUE) {
+
+ c = parse->string[parse->pos];
+ if (c == ' ' || pos >= size-1) c = '\0';
+
+ string[pos] = c;
+ if (c == '\0') break;
+
+ parse->pos++;
+ pos++;
+ }
+
+ string[pos] = '\0';
+ }
+
+finished: ;
+
+ return pos > 0; // non-empty string?
+}
+
+// end of parse.cpp
+
-\r
-// parse.h\r
-\r
-#ifndef PARSE_H\r
-#define PARSE_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// defined\r
-\r
-#define STAR_NUMBER 16\r
-#define KEYWORD_NUMBER 256\r
-\r
-// types\r
-\r
-typedef struct {\r
- const char * string;\r
- int pos;\r
- int keyword_nb;\r
- const char * keyword[KEYWORD_NUMBER];\r
-} parse_t;\r
-\r
-// variables\r
-\r
-extern char * Star[STAR_NUMBER];\r
-\r
-// functions\r
-\r
-extern bool match (char string[], const char pattern[]);\r
-\r
-extern void parse_open (parse_t * parse, const char string[]);\r
-extern void parse_close (parse_t * parse);\r
-\r
-extern void parse_add_keyword (parse_t * parse, const char keyword[]);\r
-\r
-extern bool parse_get_word (parse_t * parse, char string[], int size);\r
-extern bool parse_get_string (parse_t * parse, char string[], int size);\r
-\r
-#endif // !defined PARSE_H\r
-\r
-// end of parse.h\r
-\r
+
+// parse.h
+
+#ifndef PARSE_H
+#define PARSE_H
+
+// includes
+
+#include "util.h"
+
+// defined
+
+#define STAR_NUMBER 16
+#define KEYWORD_NUMBER 256
+
+// types
+
+typedef struct {
+ const char * string;
+ int pos;
+ int keyword_nb;
+ const char * keyword[KEYWORD_NUMBER];
+} parse_t;
+
+// variables
+
+extern char * Star[STAR_NUMBER];
+
+// functions
+
+extern bool match (char string[], const char pattern[]);
+
+extern void parse_open (parse_t * parse, const char string[]);
+extern void parse_close (parse_t * parse);
+
+extern void parse_add_keyword (parse_t * parse, const char keyword[]);
+
+extern bool parse_get_word (parse_t * parse, char string[], int size);
+extern bool parse_get_string (parse_t * parse, char string[], int size);
+
+#endif // !defined PARSE_H
+
+// end of parse.h
+
-\r
-// pgn.c\r
-\r
-// includes\r
-\r
-#include <ctype.h>\r
-#include <errno.h>\r
-#include <stdio.h>\r
-#include <string.h>\r
-\r
-#include "pgn.h"\r
-#include "util.h"\r
-\r
-// constants\r
-\r
-static const bool DispMove = FALSE;\r
-static const bool DispToken = FALSE;\r
-static const bool DispChar = FALSE;\r
-\r
-static const int TAB_SIZE = 8;\r
-\r
-static const int CHAR_EOF = 256;\r
-\r
-// types\r
-\r
-enum token_t {\r
- TOKEN_ERROR = -1,\r
- TOKEN_EOF = 256,\r
- TOKEN_SYMBOL = 257,\r
- TOKEN_STRING = 258,\r
- TOKEN_INTEGER = 259,\r
- TOKEN_NAG = 260,\r
- TOKEN_RESULT = 261\r
-};\r
-\r
-// prototypes\r
-\r
-static void pgn_token_read (pgn_t * pgn);\r
-static void pgn_token_unread (pgn_t * pgn);\r
-\r
-static void pgn_read_token (pgn_t * pgn);\r
-\r
-static bool is_symbol_start (int c);\r
-static bool is_symbol_next (int c);\r
-\r
-static void pgn_skip_blanks (pgn_t * pgn);\r
-\r
-static void pgn_char_read (pgn_t * pgn);\r
-static void pgn_char_unread (pgn_t * pgn);\r
-\r
-// functions\r
-\r
-// pgn_open()\r
-\r
-void pgn_open(pgn_t * pgn, const char file_name[]) {\r
-\r
- ASSERT(pgn!=NULL);\r
- ASSERT(file_name!=NULL);\r
-\r
- pgn->file = fopen(file_name,"r");\r
- if (pgn->file == NULL) my_fatal("pgn_open(): can't open file \"%s\": %s\n",file_name,strerror(errno));\r
-\r
- pgn->char_hack = CHAR_EOF; // DEBUG\r
- pgn->char_line = 1;\r
- pgn->char_column = 0;\r
- pgn->char_unread = FALSE;\r
- pgn->char_first = TRUE;\r
-\r
- pgn->token_type = TOKEN_ERROR; // DEBUG\r
- strcpy(pgn->token_string,"?"); // DEBUG\r
- pgn->token_length = -1; // DEBUG\r
- pgn->token_line = -1; // DEBUG\r
- pgn->token_column = -1; // DEBUG\r
- pgn->token_unread = FALSE;\r
- pgn->token_first = TRUE;\r
-\r
- strcpy(pgn->result,"?"); // DEBUG\r
- strcpy(pgn->fen,"?"); // DEBUG\r
-\r
- pgn->move_line = -1; // DEBUG\r
- pgn->move_column = -1; // DEBUG\r
-}\r
-\r
-// pgn_close()\r
-\r
-void pgn_close(pgn_t * pgn) {\r
-\r
- ASSERT(pgn!=NULL);\r
-\r
- fclose(pgn->file);\r
-}\r
-\r
-// pgn_next_game()\r
-\r
-bool pgn_next_game(pgn_t * pgn) {\r
-\r
- char name[PGN_STRING_SIZE];\r
- char value[PGN_STRING_SIZE];\r
-\r
- ASSERT(pgn!=NULL);\r
-\r
- // init\r
-\r
- strcpy(pgn->result,"*");\r
- strcpy(pgn->fen,"");\r
-\r
- // loop\r
-\r
- while (TRUE) {\r
-\r
- pgn_token_read(pgn);\r
-\r
- if (pgn->token_type != '[') break;\r
-\r
- // tag\r
-\r
- pgn_token_read(pgn);\r
- if (pgn->token_type != TOKEN_SYMBOL) {\r
- my_fatal("pgn_next_game(): malformed tag at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);\r
- }\r
- strcpy(name,pgn->token_string);\r
-\r
- pgn_token_read(pgn);\r
- if (pgn->token_type != TOKEN_STRING) {\r
- my_fatal("pgn_next_game(): malformed tag at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);\r
- }\r
- strcpy(value,pgn->token_string);\r
-\r
- pgn_token_read(pgn);\r
- if (pgn->token_type != ']') {\r
- my_fatal("pgn_next_game(): malformed tag at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);\r
- }\r
-\r
- // special tag?\r
-\r
- if (FALSE) {\r
- } else if (my_string_equal(name,"Result")) {\r
- strcpy(pgn->result,value);\r
- } else if (my_string_equal(name,"FEN")) {\r
- strcpy(pgn->fen,value);\r
- }\r
- }\r
-\r
- if (pgn->token_type == TOKEN_EOF) return FALSE;\r
-\r
- pgn_token_unread(pgn);\r
-\r
- return TRUE;\r
-}\r
-\r
-// pgn_next_move()\r
-\r
-bool pgn_next_move(pgn_t * pgn, char string[], int size) {\r
-\r
- int depth;\r
-\r
- ASSERT(pgn!=NULL);\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=PGN_STRING_SIZE);\r
-\r
- // init\r
-\r
- pgn->move_line = -1; // DEBUG\r
- pgn->move_column = -1; // DEBUG\r
-\r
- // loop\r
-\r
- depth = 0;\r
-\r
- while (TRUE) {\r
-\r
- pgn_token_read(pgn);\r
-\r
- if (FALSE) {\r
-\r
- } else if (pgn->token_type == '(') {\r
-\r
- // open RAV\r
-\r
- depth++;\r
-\r
- } else if (pgn->token_type == ')') {\r
-\r
- // close RAV\r
-\r
- if (depth == 0) {\r
- my_fatal("pgn_next_move(): malformed variation at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);\r
- }\r
-\r
- depth--;\r
- ASSERT(depth>=0);\r
-\r
- } else if (pgn->token_type == TOKEN_RESULT) {\r
-\r
- // game finished\r
-\r
- if (depth > 0) {\r
- my_fatal("pgn_next_move(): malformed variation at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);\r
- }\r
-\r
- return FALSE;\r
-\r
- } else {\r
-\r
- // skip optional move number\r
-\r
- if (pgn->token_type == TOKEN_INTEGER) {\r
- do pgn_token_read(pgn); while (pgn->token_type == '.');\r
- }\r
-\r
- // move must be a symbol\r
-\r
- if (pgn->token_type != TOKEN_SYMBOL) {\r
- my_fatal("pgn_next_move(): malformed move at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);\r
- }\r
-\r
- // store move for later use\r
-\r
- if (depth == 0) {\r
-\r
- if (pgn->token_length >= size) {\r
- my_fatal("pgn_next_move(): move too long at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);\r
- }\r
-\r
- strcpy(string,pgn->token_string);\r
- pgn->move_line = pgn->token_line;\r
- pgn->move_column = pgn->token_column;\r
- }\r
-\r
- // skip optional NAGs\r
-\r
- do pgn_token_read(pgn); while (pgn->token_type == TOKEN_NAG);\r
- pgn_token_unread(pgn);\r
-\r
- // return move\r
-\r
- if (depth == 0) {\r
- if (DispMove) printf("move=\"%s\"\n",string);\r
- return TRUE;\r
- }\r
- }\r
- }\r
-\r
- ASSERT(FALSE);\r
-\r
- return FALSE;\r
-}\r
-\r
-// pgn_token_read()\r
-\r
-static void pgn_token_read(pgn_t * pgn) {\r
-\r
- ASSERT(pgn!=NULL);\r
-\r
- // token "stack"\r
-\r
- if (pgn->token_unread) {\r
- pgn->token_unread = FALSE;\r
- return;\r
- }\r
-\r
- // consume the current token\r
-\r
- if (pgn->token_first) {\r
- pgn->token_first = FALSE;\r
- } else {\r
- ASSERT(pgn->token_type!=TOKEN_ERROR);\r
- ASSERT(pgn->token_type!=TOKEN_EOF);\r
- }\r
-\r
- // read a new token\r
-\r
- pgn_read_token(pgn);\r
- if (pgn->token_type == TOKEN_ERROR) my_fatal("pgn_token_read(): lexical error at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
-\r
- if (DispToken) printf("< L%d C%d \"%s\" (%03X)\n",pgn->token_line,pgn->token_column,pgn->token_string,pgn->token_type);\r
-}\r
-\r
-// pgn_token_unread()\r
-\r
-static void pgn_token_unread(pgn_t * pgn) {\r
-\r
- ASSERT(pgn!=NULL);\r
-\r
- ASSERT(!pgn->token_unread);\r
- ASSERT(!pgn->token_first);\r
-\r
- pgn->token_unread = TRUE;\r
-}\r
-\r
-// pgn_read_token()\r
-\r
-static void pgn_read_token(pgn_t * pgn) {\r
-\r
- ASSERT(pgn!=NULL);\r
-\r
- // skip white-space characters\r
-\r
- pgn_skip_blanks(pgn);\r
-\r
- // init\r
-\r
- pgn->token_type = TOKEN_ERROR;\r
- strcpy(pgn->token_string,"");\r
- pgn->token_length = 0;\r
- pgn->token_line = pgn->char_line;\r
- pgn->token_column = pgn->char_column;\r
-\r
- // determine token type\r
-\r
- if (FALSE) {\r
-\r
- } else if (pgn->char_hack == CHAR_EOF) {\r
-\r
- pgn->token_type = TOKEN_EOF;\r
-\r
- } else if (strchr(".[]()<>",pgn->char_hack) != NULL) {\r
-\r
- // single-character token\r
-\r
- pgn->token_type = pgn->char_hack;\r
- sprintf(pgn->token_string,"%c",pgn->char_hack);\r
- pgn->token_length = 1;\r
-\r
- } else if (pgn->char_hack == '*') {\r
-\r
- pgn->token_type = TOKEN_RESULT;\r
- sprintf(pgn->token_string,"%c",pgn->char_hack);\r
- pgn->token_length = 1;\r
-\r
- } else if (pgn->char_hack == '!') {\r
-\r
- pgn_char_read(pgn);\r
-\r
- if (FALSE) {\r
-\r
- } else if (pgn->char_hack == '!') { // "!!"\r
-\r
- pgn->token_type = TOKEN_NAG;\r
- strcpy(pgn->token_string,"3");\r
- pgn->token_length = 1;\r
-\r
- } else if (pgn->char_hack == '?') { // "!?"\r
-\r
- pgn->token_type = TOKEN_NAG;\r
- strcpy(pgn->token_string,"5");\r
- pgn->token_length = 1;\r
-\r
- } else { // "!"\r
-\r
- pgn_char_unread(pgn);\r
-\r
- pgn->token_type = TOKEN_NAG;\r
- strcpy(pgn->token_string,"1");\r
- pgn->token_length = 1;\r
- }\r
-\r
- } else if (pgn->char_hack == '?') {\r
-\r
- pgn_char_read(pgn);\r
-\r
- if (FALSE) {\r
-\r
- } else if (pgn->char_hack == '?') { // "??"\r
-\r
- pgn->token_type = TOKEN_NAG;\r
- strcpy(pgn->token_string,"4");\r
- pgn->token_length = 1;\r
-\r
- } else if (pgn->char_hack == '!') { // "?!"\r
-\r
- pgn->token_type = TOKEN_NAG;\r
- strcpy(pgn->token_string,"6");\r
- pgn->token_length = 1;\r
-\r
- } else { // "?"\r
-\r
- pgn_char_unread(pgn);\r
-\r
- pgn->token_type = TOKEN_NAG;\r
- strcpy(pgn->token_string,"2");\r
- pgn->token_length = 1;\r
- }\r
-\r
- } else if (is_symbol_start(pgn->char_hack)) {\r
-\r
- // symbol, integer, or result\r
-\r
- pgn->token_type = TOKEN_INTEGER;\r
- pgn->token_length = 0;\r
-\r
- do {\r
-\r
- if (pgn->token_length >= PGN_STRING_SIZE-1) {\r
- my_fatal("pgn_read_token(): symbol too long at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- if (!isdigit(pgn->char_hack)) pgn->token_type = TOKEN_SYMBOL;\r
-\r
- pgn->token_string[pgn->token_length++] = pgn->char_hack;\r
-\r
- pgn_char_read(pgn);\r
-\r
- } while (is_symbol_next(pgn->char_hack));\r
-\r
- pgn_char_unread(pgn);\r
-\r
- ASSERT(pgn->token_length>0&&pgn->token_length<PGN_STRING_SIZE);\r
- pgn->token_string[pgn->token_length] = '\0';\r
-\r
- if (my_string_equal(pgn->token_string,"1-0")\r
- || my_string_equal(pgn->token_string,"0-1")\r
- || my_string_equal(pgn->token_string,"1/2-1/2")) {\r
- pgn->token_type = TOKEN_RESULT;\r
- }\r
-\r
- } else if (pgn->char_hack == '"') {\r
-\r
- // string\r
-\r
- pgn->token_type = TOKEN_STRING;\r
- pgn->token_length = 0;\r
-\r
- while (TRUE) {\r
-\r
- pgn_char_read(pgn);\r
-\r
- if (pgn->char_hack == CHAR_EOF) {\r
- my_fatal("pgn_read_token(): EOF in string at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- if (pgn->char_hack == '"') break;\r
-\r
- if (pgn->char_hack == '\\') {\r
-\r
- pgn_char_read(pgn);\r
-\r
- if (pgn->char_hack == CHAR_EOF) {\r
- my_fatal("pgn_read_token(): EOF in string at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- if (pgn->char_hack != '"' && pgn->char_hack != '\\') {\r
-\r
- // bad escape, ignore\r
-\r
- if (pgn->token_length >= PGN_STRING_SIZE-1) {\r
- my_fatal("pgn_read_token(): string too long at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- pgn->token_string[pgn->token_length++] = '\\';\r
- }\r
- }\r
-\r
- if (pgn->token_length >= PGN_STRING_SIZE-1) {\r
- my_fatal("pgn_read_token(): string too long at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- pgn->token_string[pgn->token_length++] = pgn->char_hack;\r
- }\r
-\r
- ASSERT(pgn->token_length>=0&&pgn->token_length<PGN_STRING_SIZE);\r
- pgn->token_string[pgn->token_length] = '\0';\r
-\r
- } else if (pgn->char_hack == '$') {\r
-\r
- // NAG\r
-\r
- pgn->token_type = TOKEN_NAG;\r
- pgn->token_length = 0;\r
-\r
- while (TRUE) {\r
-\r
- pgn_char_read(pgn);\r
-\r
- if (!isdigit(pgn->char_hack)) break;\r
-\r
- if (pgn->token_length >= 3) {\r
- my_fatal("pgn_read_token(): NAG too long at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- pgn->token_string[pgn->token_length++] = pgn->char_hack;\r
- }\r
-\r
- pgn_char_unread(pgn);\r
-\r
- if (pgn->token_length == 0) {\r
- my_fatal("pgn_read_token(): malformed NAG at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- ASSERT(pgn->token_length>0&&pgn->token_length<=3);\r
- pgn->token_string[pgn->token_length] = '\0';\r
-\r
- } else {\r
-\r
- // unknown token\r
-\r
- my_fatal("lexical error at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-}\r
-\r
-// pgn_skip_blanks()\r
-\r
-static void pgn_skip_blanks(pgn_t * pgn) {\r
-\r
- ASSERT(pgn!=NULL);\r
-\r
- while (TRUE) {\r
-\r
- pgn_char_read(pgn);\r
-\r
- if (FALSE) {\r
- }else if(pgn->char_hack==CHAR_EOF){ break;\r
- } else if (isspace(pgn->char_hack)) {\r
-\r
- // skip white space\r
-\r
- } else if (pgn->char_hack == ';') {\r
-\r
- // skip comment to EOL\r
-\r
- do {\r
-\r
- pgn_char_read(pgn);\r
-\r
- if (pgn->char_hack == CHAR_EOF) {\r
- my_fatal("pgn_skip_blanks(): EOF in comment at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- } while (pgn->char_hack != '\n');\r
-\r
- } else if (pgn->char_hack == '%' && pgn->char_column == 0) {\r
-\r
- // skip comment to EOL\r
-\r
- do {\r
-\r
- pgn_char_read(pgn);\r
-\r
- if (pgn->char_hack == CHAR_EOF) {\r
- my_fatal("pgn_skip_blanks(): EOF in comment at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- } while (pgn->char_hack != '\n');\r
-\r
- } else if (pgn->char_hack == '{') {\r
-\r
- // skip comment to next '}'\r
-\r
- do {\r
-\r
- pgn_char_read(pgn);\r
-\r
- if (pgn->char_hack == CHAR_EOF) {\r
- my_fatal("pgn_skip_blanks(): EOF in comment at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);\r
- }\r
-\r
- } while (pgn->char_hack != '}');\r
-\r
- } else { // not a white space\r
-\r
- break;\r
- }\r
- }\r
-}\r
-\r
-// is_symbol_start()\r
-\r
-static bool is_symbol_start(int c) {\r
-\r
- return strchr("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",c) != NULL;\r
-}\r
-\r
-// is_symbol_next()\r
-\r
-static bool is_symbol_next(int c) {\r
-\r
- return strchr("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_+#=:-/",c) != NULL;\r
-}\r
-\r
-// pgn_char_read()\r
-\r
-static void pgn_char_read(pgn_t * pgn) {\r
-\r
- ASSERT(pgn!=NULL);\r
-\r
- // char "stack"\r
-\r
- if (pgn->char_unread) {\r
- pgn->char_unread = FALSE;\r
- return;\r
- }\r
-\r
- // consume the current character\r
-\r
- if (pgn->char_first) {\r
-\r
- pgn->char_first = FALSE;\r
-\r
- } else {\r
-\r
- // update counters\r
-\r
- ASSERT(pgn->char_hack!=CHAR_EOF);\r
-\r
- if (FALSE) {\r
- } else if (pgn->char_hack == '\n') {\r
- pgn->char_line++;\r
- pgn->char_column = 0;\r
- } else if (pgn->char_hack == '\t') {\r
- pgn->char_column += TAB_SIZE - (pgn->char_column % TAB_SIZE);\r
- } else {\r
- pgn->char_column++;\r
- }\r
- }\r
-\r
- // read a new character\r
-\r
- pgn->char_hack = fgetc(pgn->file);\r
-\r
- if (pgn->char_hack == EOF) {\r
- if (ferror(pgn->file)) my_fatal("pgn_char_read(): fgetc(): %s\n",strerror(errno));\r
- pgn->char_hack = CHAR_EOF;\r
- }\r
-\r
- if (DispChar) printf("< L%d C%d '%c' (%02X)\n",pgn->char_line,pgn->char_column,pgn->char_hack,pgn->char_hack);\r
-}\r
-\r
-// pgn_char_unread()\r
-\r
-static void pgn_char_unread(pgn_t * pgn) {\r
-\r
- ASSERT(pgn!=NULL);\r
-\r
- ASSERT(!pgn->char_unread);\r
- ASSERT(!pgn->char_first);\r
-\r
- pgn->char_unread = TRUE;\r
-}\r
-\r
-// end of pgn.cpp\r
-\r
+
+// pgn.c
+
+// includes
+
+#include <ctype.h>
+#include <errno.h>
+#include <stdio.h>
+#include <string.h>
+
+#include "pgn.h"
+#include "util.h"
+
+// constants
+
+static const bool DispMove = FALSE;
+static const bool DispToken = FALSE;
+static const bool DispChar = FALSE;
+
+static const int TAB_SIZE = 8;
+
+static const int CHAR_EOF = 256;
+
+// types
+
+enum token_t {
+ TOKEN_ERROR = -1,
+ TOKEN_EOF = 256,
+ TOKEN_SYMBOL = 257,
+ TOKEN_STRING = 258,
+ TOKEN_INTEGER = 259,
+ TOKEN_NAG = 260,
+ TOKEN_RESULT = 261
+};
+
+// prototypes
+
+static void pgn_token_read (pgn_t * pgn);
+static void pgn_token_unread (pgn_t * pgn);
+
+static void pgn_read_token (pgn_t * pgn);
+
+static bool is_symbol_start (int c);
+static bool is_symbol_next (int c);
+
+static void pgn_skip_blanks (pgn_t * pgn);
+
+static void pgn_char_read (pgn_t * pgn);
+static void pgn_char_unread (pgn_t * pgn);
+
+// functions
+
+// pgn_open()
+
+void pgn_open(pgn_t * pgn, const char file_name[]) {
+
+ ASSERT(pgn!=NULL);
+ ASSERT(file_name!=NULL);
+
+ pgn->file = fopen(file_name,"r");
+ if (pgn->file == NULL) my_fatal("pgn_open(): can't open file \"%s\": %s\n",file_name,strerror(errno));
+
+ pgn->char_hack = CHAR_EOF; // DEBUG
+ pgn->char_line = 1;
+ pgn->char_column = 0;
+ pgn->char_unread = FALSE;
+ pgn->char_first = TRUE;
+
+ pgn->token_type = TOKEN_ERROR; // DEBUG
+ strcpy(pgn->token_string,"?"); // DEBUG
+ pgn->token_length = -1; // DEBUG
+ pgn->token_line = -1; // DEBUG
+ pgn->token_column = -1; // DEBUG
+ pgn->token_unread = FALSE;
+ pgn->token_first = TRUE;
+
+ strcpy(pgn->result,"?"); // DEBUG
+ strcpy(pgn->fen,"?"); // DEBUG
+
+ pgn->move_line = -1; // DEBUG
+ pgn->move_column = -1; // DEBUG
+}
+
+// pgn_close()
+
+void pgn_close(pgn_t * pgn) {
+
+ ASSERT(pgn!=NULL);
+
+ fclose(pgn->file);
+}
+
+// pgn_next_game()
+
+bool pgn_next_game(pgn_t * pgn) {
+
+ char name[PGN_STRING_SIZE];
+ char value[PGN_STRING_SIZE];
+
+ ASSERT(pgn!=NULL);
+
+ // init
+
+ strcpy(pgn->result,"*");
+ strcpy(pgn->fen,"");
+
+ // loop
+
+ while (TRUE) {
+
+ pgn_token_read(pgn);
+
+ if (pgn->token_type != '[') break;
+
+ // tag
+
+ pgn_token_read(pgn);
+ if (pgn->token_type != TOKEN_SYMBOL) {
+ my_fatal("pgn_next_game(): malformed tag at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);
+ }
+ strcpy(name,pgn->token_string);
+
+ pgn_token_read(pgn);
+ if (pgn->token_type != TOKEN_STRING) {
+ my_fatal("pgn_next_game(): malformed tag at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);
+ }
+ strcpy(value,pgn->token_string);
+
+ pgn_token_read(pgn);
+ if (pgn->token_type != ']') {
+ my_fatal("pgn_next_game(): malformed tag at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);
+ }
+
+ // special tag?
+
+ if (FALSE) {
+ } else if (my_string_equal(name,"Result")) {
+ strcpy(pgn->result,value);
+ } else if (my_string_equal(name,"FEN")) {
+ strcpy(pgn->fen,value);
+ }
+ }
+
+ if (pgn->token_type == TOKEN_EOF) return FALSE;
+
+ pgn_token_unread(pgn);
+
+ return TRUE;
+}
+
+// pgn_next_move()
+
+bool pgn_next_move(pgn_t * pgn, char string[], int size) {
+
+ int depth;
+
+ ASSERT(pgn!=NULL);
+ ASSERT(string!=NULL);
+ ASSERT(size>=PGN_STRING_SIZE);
+
+ // init
+
+ pgn->move_line = -1; // DEBUG
+ pgn->move_column = -1; // DEBUG
+
+ // loop
+
+ depth = 0;
+
+ while (TRUE) {
+
+ pgn_token_read(pgn);
+
+ if (FALSE) {
+
+ } else if (pgn->token_type == '(') {
+
+ // open RAV
+
+ depth++;
+
+ } else if (pgn->token_type == ')') {
+
+ // close RAV
+
+ if (depth == 0) {
+ my_fatal("pgn_next_move(): malformed variation at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);
+ }
+
+ depth--;
+ ASSERT(depth>=0);
+
+ } else if (pgn->token_type == TOKEN_RESULT) {
+
+ // game finished
+
+ if (depth > 0) {
+ my_fatal("pgn_next_move(): malformed variation at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);
+ }
+
+ return FALSE;
+
+ } else {
+
+ // skip optional move number
+
+ if (pgn->token_type == TOKEN_INTEGER) {
+ do pgn_token_read(pgn); while (pgn->token_type == '.');
+ }
+
+ // move must be a symbol
+
+ if (pgn->token_type != TOKEN_SYMBOL) {
+ my_fatal("pgn_next_move(): malformed move at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);
+ }
+
+ // store move for later use
+
+ if (depth == 0) {
+
+ if (pgn->token_length >= size) {
+ my_fatal("pgn_next_move(): move too long at line %d, column %d, game %d\n",pgn->token_line,pgn->token_column,pgn->game_nb);
+ }
+
+ strcpy(string,pgn->token_string);
+ pgn->move_line = pgn->token_line;
+ pgn->move_column = pgn->token_column;
+ }
+
+ // skip optional NAGs
+
+ do pgn_token_read(pgn); while (pgn->token_type == TOKEN_NAG);
+ pgn_token_unread(pgn);
+
+ // return move
+
+ if (depth == 0) {
+ if (DispMove) printf("move=\"%s\"\n",string);
+ return TRUE;
+ }
+ }
+ }
+
+ ASSERT(FALSE);
+
+ return FALSE;
+}
+
+// pgn_token_read()
+
+static void pgn_token_read(pgn_t * pgn) {
+
+ ASSERT(pgn!=NULL);
+
+ // token "stack"
+
+ if (pgn->token_unread) {
+ pgn->token_unread = FALSE;
+ return;
+ }
+
+ // consume the current token
+
+ if (pgn->token_first) {
+ pgn->token_first = FALSE;
+ } else {
+ ASSERT(pgn->token_type!=TOKEN_ERROR);
+ ASSERT(pgn->token_type!=TOKEN_EOF);
+ }
+
+ // read a new token
+
+ pgn_read_token(pgn);
+ if (pgn->token_type == TOKEN_ERROR) my_fatal("pgn_token_read(): lexical error at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+
+ if (DispToken) printf("< L%d C%d \"%s\" (%03X)\n",pgn->token_line,pgn->token_column,pgn->token_string,pgn->token_type);
+}
+
+// pgn_token_unread()
+
+static void pgn_token_unread(pgn_t * pgn) {
+
+ ASSERT(pgn!=NULL);
+
+ ASSERT(!pgn->token_unread);
+ ASSERT(!pgn->token_first);
+
+ pgn->token_unread = TRUE;
+}
+
+// pgn_read_token()
+
+static void pgn_read_token(pgn_t * pgn) {
+
+ ASSERT(pgn!=NULL);
+
+ // skip white-space characters
+
+ pgn_skip_blanks(pgn);
+
+ // init
+
+ pgn->token_type = TOKEN_ERROR;
+ strcpy(pgn->token_string,"");
+ pgn->token_length = 0;
+ pgn->token_line = pgn->char_line;
+ pgn->token_column = pgn->char_column;
+
+ // determine token type
+
+ if (FALSE) {
+
+ } else if (pgn->char_hack == CHAR_EOF) {
+
+ pgn->token_type = TOKEN_EOF;
+
+ } else if (strchr(".[]()<>",pgn->char_hack) != NULL) {
+
+ // single-character token
+
+ pgn->token_type = pgn->char_hack;
+ sprintf(pgn->token_string,"%c",pgn->char_hack);
+ pgn->token_length = 1;
+
+ } else if (pgn->char_hack == '*') {
+
+ pgn->token_type = TOKEN_RESULT;
+ sprintf(pgn->token_string,"%c",pgn->char_hack);
+ pgn->token_length = 1;
+
+ } else if (pgn->char_hack == '!') {
+
+ pgn_char_read(pgn);
+
+ if (FALSE) {
+
+ } else if (pgn->char_hack == '!') { // "!!"
+
+ pgn->token_type = TOKEN_NAG;
+ strcpy(pgn->token_string,"3");
+ pgn->token_length = 1;
+
+ } else if (pgn->char_hack == '?') { // "!?"
+
+ pgn->token_type = TOKEN_NAG;
+ strcpy(pgn->token_string,"5");
+ pgn->token_length = 1;
+
+ } else { // "!"
+
+ pgn_char_unread(pgn);
+
+ pgn->token_type = TOKEN_NAG;
+ strcpy(pgn->token_string,"1");
+ pgn->token_length = 1;
+ }
+
+ } else if (pgn->char_hack == '?') {
+
+ pgn_char_read(pgn);
+
+ if (FALSE) {
+
+ } else if (pgn->char_hack == '?') { // "??"
+
+ pgn->token_type = TOKEN_NAG;
+ strcpy(pgn->token_string,"4");
+ pgn->token_length = 1;
+
+ } else if (pgn->char_hack == '!') { // "?!"
+
+ pgn->token_type = TOKEN_NAG;
+ strcpy(pgn->token_string,"6");
+ pgn->token_length = 1;
+
+ } else { // "?"
+
+ pgn_char_unread(pgn);
+
+ pgn->token_type = TOKEN_NAG;
+ strcpy(pgn->token_string,"2");
+ pgn->token_length = 1;
+ }
+
+ } else if (is_symbol_start(pgn->char_hack)) {
+
+ // symbol, integer, or result
+
+ pgn->token_type = TOKEN_INTEGER;
+ pgn->token_length = 0;
+
+ do {
+
+ if (pgn->token_length >= PGN_STRING_SIZE-1) {
+ my_fatal("pgn_read_token(): symbol too long at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ if (!isdigit(pgn->char_hack)) pgn->token_type = TOKEN_SYMBOL;
+
+ pgn->token_string[pgn->token_length++] = pgn->char_hack;
+
+ pgn_char_read(pgn);
+
+ } while (is_symbol_next(pgn->char_hack));
+
+ pgn_char_unread(pgn);
+
+ ASSERT(pgn->token_length>0&&pgn->token_length<PGN_STRING_SIZE);
+ pgn->token_string[pgn->token_length] = '\0';
+
+ if (my_string_equal(pgn->token_string,"1-0")
+ || my_string_equal(pgn->token_string,"0-1")
+ || my_string_equal(pgn->token_string,"1/2-1/2")) {
+ pgn->token_type = TOKEN_RESULT;
+ }
+
+ } else if (pgn->char_hack == '"') {
+
+ // string
+
+ pgn->token_type = TOKEN_STRING;
+ pgn->token_length = 0;
+
+ while (TRUE) {
+
+ pgn_char_read(pgn);
+
+ if (pgn->char_hack == CHAR_EOF) {
+ my_fatal("pgn_read_token(): EOF in string at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ if (pgn->char_hack == '"') break;
+
+ if (pgn->char_hack == '\\') {
+
+ pgn_char_read(pgn);
+
+ if (pgn->char_hack == CHAR_EOF) {
+ my_fatal("pgn_read_token(): EOF in string at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ if (pgn->char_hack != '"' && pgn->char_hack != '\\') {
+
+ // bad escape, ignore
+
+ if (pgn->token_length >= PGN_STRING_SIZE-1) {
+ my_fatal("pgn_read_token(): string too long at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ pgn->token_string[pgn->token_length++] = '\\';
+ }
+ }
+
+ if (pgn->token_length >= PGN_STRING_SIZE-1) {
+ my_fatal("pgn_read_token(): string too long at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ pgn->token_string[pgn->token_length++] = pgn->char_hack;
+ }
+
+ ASSERT(pgn->token_length>=0&&pgn->token_length<PGN_STRING_SIZE);
+ pgn->token_string[pgn->token_length] = '\0';
+
+ } else if (pgn->char_hack == '$') {
+
+ // NAG
+
+ pgn->token_type = TOKEN_NAG;
+ pgn->token_length = 0;
+
+ while (TRUE) {
+
+ pgn_char_read(pgn);
+
+ if (!isdigit(pgn->char_hack)) break;
+
+ if (pgn->token_length >= 3) {
+ my_fatal("pgn_read_token(): NAG too long at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ pgn->token_string[pgn->token_length++] = pgn->char_hack;
+ }
+
+ pgn_char_unread(pgn);
+
+ if (pgn->token_length == 0) {
+ my_fatal("pgn_read_token(): malformed NAG at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ ASSERT(pgn->token_length>0&&pgn->token_length<=3);
+ pgn->token_string[pgn->token_length] = '\0';
+
+ } else {
+
+ // unknown token
+
+ my_fatal("lexical error at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+}
+
+// pgn_skip_blanks()
+
+static void pgn_skip_blanks(pgn_t * pgn) {
+
+ ASSERT(pgn!=NULL);
+
+ while (TRUE) {
+
+ pgn_char_read(pgn);
+
+ if (FALSE) {
+ }else if(pgn->char_hack==CHAR_EOF){ break;
+ } else if (isspace(pgn->char_hack)) {
+
+ // skip white space
+
+ } else if (pgn->char_hack == ';') {
+
+ // skip comment to EOL
+
+ do {
+
+ pgn_char_read(pgn);
+
+ if (pgn->char_hack == CHAR_EOF) {
+ my_fatal("pgn_skip_blanks(): EOF in comment at line %d, column %d,game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ } while (pgn->char_hack != '\n');
+
+ } else if (pgn->char_hack == '%' && pgn->char_column == 0) {
+
+ // skip comment to EOL
+
+ do {
+
+ pgn_char_read(pgn);
+
+ if (pgn->char_hack == CHAR_EOF) {
+ my_fatal("pgn_skip_blanks(): EOF in comment at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ } while (pgn->char_hack != '\n');
+
+ } else if (pgn->char_hack == '{') {
+
+ // skip comment to next '}'
+
+ do {
+
+ pgn_char_read(pgn);
+
+ if (pgn->char_hack == CHAR_EOF) {
+ my_fatal("pgn_skip_blanks(): EOF in comment at line %d, column %d, game %d\n",pgn->char_line,pgn->char_column,pgn->game_nb);
+ }
+
+ } while (pgn->char_hack != '}');
+
+ } else { // not a white space
+
+ break;
+ }
+ }
+}
+
+// is_symbol_start()
+
+static bool is_symbol_start(int c) {
+
+ return strchr("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",c) != NULL;
+}
+
+// is_symbol_next()
+
+static bool is_symbol_next(int c) {
+
+ return strchr("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_+#=:-/",c) != NULL;
+}
+
+// pgn_char_read()
+
+static void pgn_char_read(pgn_t * pgn) {
+
+ ASSERT(pgn!=NULL);
+
+ // char "stack"
+
+ if (pgn->char_unread) {
+ pgn->char_unread = FALSE;
+ return;
+ }
+
+ // consume the current character
+
+ if (pgn->char_first) {
+
+ pgn->char_first = FALSE;
+
+ } else {
+
+ // update counters
+
+ ASSERT(pgn->char_hack!=CHAR_EOF);
+
+ if (FALSE) {
+ } else if (pgn->char_hack == '\n') {
+ pgn->char_line++;
+ pgn->char_column = 0;
+ } else if (pgn->char_hack == '\t') {
+ pgn->char_column += TAB_SIZE - (pgn->char_column % TAB_SIZE);
+ } else {
+ pgn->char_column++;
+ }
+ }
+
+ // read a new character
+
+ pgn->char_hack = fgetc(pgn->file);
+
+ if (pgn->char_hack == EOF) {
+ if (ferror(pgn->file)) my_fatal("pgn_char_read(): fgetc(): %s\n",strerror(errno));
+ pgn->char_hack = CHAR_EOF;
+ }
+
+ if (DispChar) printf("< L%d C%d '%c' (%02X)\n",pgn->char_line,pgn->char_column,pgn->char_hack,pgn->char_hack);
+}
+
+// pgn_char_unread()
+
+static void pgn_char_unread(pgn_t * pgn) {
+
+ ASSERT(pgn!=NULL);
+
+ ASSERT(!pgn->char_unread);
+ ASSERT(!pgn->char_first);
+
+ pgn->char_unread = TRUE;
+}
+
+// end of pgn.cpp
+
-\r
-// pgn.h\r
-\r
-#ifndef PGN_H\r
-#define PGN_H\r
-\r
-// includes\r
-\r
-#include <stdio.h>\r
-\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define PGN_STRING_SIZE 256\r
-\r
-// types\r
-\r
-typedef struct {\r
-\r
- FILE * file;\r
-\r
- int char_hack;\r
- int char_line;\r
- int char_column;\r
- bool char_unread;\r
- bool char_first;\r
-\r
- int token_type;\r
- char token_string[PGN_STRING_SIZE];\r
- int token_length;\r
- int token_line;\r
- int token_column;\r
- bool token_unread;\r
- bool token_first;\r
-\r
- char result[PGN_STRING_SIZE];\r
- char fen[PGN_STRING_SIZE];\r
-\r
- int move_line;\r
- int move_column;\r
- int game_nb;\r
-} pgn_t;\r
-\r
-// functions\r
-\r
-extern void pgn_open (pgn_t * pgn, const char file_name[]);\r
-extern void pgn_close (pgn_t * pgn);\r
-\r
-extern bool pgn_next_game (pgn_t * pgn);\r
-extern bool pgn_next_move (pgn_t * pgn, char string[], int size);\r
-\r
-#endif // !defined PGN_H\r
-\r
-// end of pgn.h\r
-\r
+
+// pgn.h
+
+#ifndef PGN_H
+#define PGN_H
+
+// includes
+
+#include <stdio.h>
+
+#include "util.h"
+
+// defines
+
+#define PGN_STRING_SIZE 256
+
+// types
+
+typedef struct {
+
+ FILE * file;
+
+ int char_hack;
+ int char_line;
+ int char_column;
+ bool char_unread;
+ bool char_first;
+
+ int token_type;
+ char token_string[PGN_STRING_SIZE];
+ int token_length;
+ int token_line;
+ int token_column;
+ bool token_unread;
+ bool token_first;
+
+ char result[PGN_STRING_SIZE];
+ char fen[PGN_STRING_SIZE];
+
+ int move_line;
+ int move_column;
+ int game_nb;
+} pgn_t;
+
+// functions
+
+extern void pgn_open (pgn_t * pgn, const char file_name[]);
+extern void pgn_close (pgn_t * pgn);
+
+extern bool pgn_next_game (pgn_t * pgn);
+extern bool pgn_next_move (pgn_t * pgn, char string[], int size);
+
+#endif // !defined PGN_H
+
+// end of pgn.h
+
-\r
-// piece.c\r
-\r
-// includes\r
-\r
-#include <string.h>\r
-\r
-#include "colour.h"\r
-#include "piece.h"\r
-#include "util.h"\r
-\r
-// "constants"\r
-\r
-static const uint8 MakePawn[ColourNb] = { PieceNone256, BlackPawn256, WhitePawn256 }; // -BW\r
-\r
-static const uint8 PieceFrom12[12] = {\r
- BlackPawn256, WhitePawn256,\r
- BlackKnight256, WhiteKnight256,\r
- BlackBishop256, WhiteBishop256,\r
- BlackRook256, WhiteRook256,\r
- BlackQueen256, WhiteQueen256,\r
- BlackKing256, WhiteKing256,\r
-};\r
-\r
-static const char PieceString[12+1] = "pPnNbBrRqQkK";\r
-\r
-// variables\r
-\r
-static sint8 PieceTo12[256];\r
-\r
-// functions\r
-\r
-// piece_init()\r
-\r
-void piece_init() {\r
-\r
- int piece;\r
-\r
- for (piece = 0; piece < 256; piece++) PieceTo12[piece] = -1;\r
-\r
- for (piece = 0; piece < 12; piece++) {\r
- PieceTo12[PieceFrom12[piece]] = piece;\r
- }\r
-}\r
-\r
-// piece_is_ok()\r
-\r
-bool piece_is_ok(int piece) {\r
-\r
- if (piece < 0 || piece >= 256) return FALSE;\r
-\r
- if (PieceTo12[piece] < 0) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// piece_make_pawn()\r
-\r
-int piece_make_pawn(int colour) {\r
-\r
- ASSERT(colour_is_ok(colour));\r
-\r
- return MakePawn[colour];\r
-}\r
-\r
-// piece_pawn_opp()\r
-\r
-int piece_pawn_opp(int piece) {\r
-\r
- ASSERT(piece==BlackPawn256||piece==WhitePawn256);\r
-\r
- return piece ^ 15;\r
-}\r
-\r
-// piece_colour()\r
-\r
-int piece_colour(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return piece & 3;\r
-}\r
-\r
-// piece_type()\r
-\r
-int piece_type(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return piece & ~3;\r
-}\r
-\r
-// piece_is_pawn()\r
-\r
-bool piece_is_pawn(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return (piece & PawnFlags) != 0;\r
-}\r
-\r
-// piece_is_knight()\r
-\r
-bool piece_is_knight(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return (piece & KnightFlag) != 0;\r
-}\r
-\r
-// piece_is_bishop()\r
-\r
-bool piece_is_bishop(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return (piece & QueenFlags) == BishopFlag;\r
-}\r
-\r
-// piece_is_rook()\r
-\r
-bool piece_is_rook(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return (piece & QueenFlags) == RookFlag;\r
-}\r
-\r
-// piece_is_queen()\r
-\r
-bool piece_is_queen(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return (piece & QueenFlags) == QueenFlags;\r
-}\r
-\r
-// piece_is_king()\r
-\r
-bool piece_is_king(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return (piece & KingFlag) != 0;\r
-}\r
-\r
-// piece_is_slider()\r
-\r
-bool piece_is_slider(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return (piece & QueenFlags) != 0;\r
-}\r
-\r
-// piece_to_12()\r
-\r
-int piece_to_12(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return PieceTo12[piece];\r
-}\r
-\r
-// piece_from_12()\r
-\r
-int piece_from_12(int piece) {\r
-\r
- ASSERT(piece>=0&&piece<12);\r
-\r
- return PieceFrom12[piece];\r
-}\r
-\r
-// piece_to_char()\r
-\r
-int piece_to_char(int piece) {\r
-\r
- ASSERT(piece_is_ok(piece));\r
-\r
- return PieceString[piece_to_12(piece)];\r
-}\r
-\r
-// piece_from_char()\r
-\r
-int piece_from_char(int c) {\r
-\r
- const char * ptr;\r
-\r
- ptr = strchr(PieceString,c);\r
- if (ptr == NULL) return PieceNone256;\r
-\r
- return piece_from_12(ptr-PieceString);\r
-}\r
-\r
-// char_is_piece()\r
-\r
-bool char_is_piece(int c) {\r
-\r
- return strchr("PNBRQK",c) != NULL;\r
-}\r
-\r
-// end of piece.cpp\r
-\r
+
+// piece.c
+
+// includes
+
+#include <string.h>
+
+#include "colour.h"
+#include "piece.h"
+#include "util.h"
+
+// "constants"
+
+static const uint8 MakePawn[ColourNb] = { PieceNone256, BlackPawn256, WhitePawn256 }; // -BW
+
+static const uint8 PieceFrom12[12] = {
+ BlackPawn256, WhitePawn256,
+ BlackKnight256, WhiteKnight256,
+ BlackBishop256, WhiteBishop256,
+ BlackRook256, WhiteRook256,
+ BlackQueen256, WhiteQueen256,
+ BlackKing256, WhiteKing256,
+};
+
+static const char PieceString[12+1] = "pPnNbBrRqQkK";
+
+// variables
+
+static sint8 PieceTo12[256];
+
+// functions
+
+// piece_init()
+
+void piece_init() {
+
+ int piece;
+
+ for (piece = 0; piece < 256; piece++) PieceTo12[piece] = -1;
+
+ for (piece = 0; piece < 12; piece++) {
+ PieceTo12[PieceFrom12[piece]] = piece;
+ }
+}
+
+// piece_is_ok()
+
+bool piece_is_ok(int piece) {
+
+ if (piece < 0 || piece >= 256) return FALSE;
+
+ if (PieceTo12[piece] < 0) return FALSE;
+
+ return TRUE;
+}
+
+// piece_make_pawn()
+
+int piece_make_pawn(int colour) {
+
+ ASSERT(colour_is_ok(colour));
+
+ return MakePawn[colour];
+}
+
+// piece_pawn_opp()
+
+int piece_pawn_opp(int piece) {
+
+ ASSERT(piece==BlackPawn256||piece==WhitePawn256);
+
+ return piece ^ 15;
+}
+
+// piece_colour()
+
+int piece_colour(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return piece & 3;
+}
+
+// piece_type()
+
+int piece_type(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return piece & ~3;
+}
+
+// piece_is_pawn()
+
+bool piece_is_pawn(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return (piece & PawnFlags) != 0;
+}
+
+// piece_is_knight()
+
+bool piece_is_knight(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return (piece & KnightFlag) != 0;
+}
+
+// piece_is_bishop()
+
+bool piece_is_bishop(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return (piece & QueenFlags) == BishopFlag;
+}
+
+// piece_is_rook()
+
+bool piece_is_rook(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return (piece & QueenFlags) == RookFlag;
+}
+
+// piece_is_queen()
+
+bool piece_is_queen(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return (piece & QueenFlags) == QueenFlags;
+}
+
+// piece_is_king()
+
+bool piece_is_king(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return (piece & KingFlag) != 0;
+}
+
+// piece_is_slider()
+
+bool piece_is_slider(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return (piece & QueenFlags) != 0;
+}
+
+// piece_to_12()
+
+int piece_to_12(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return PieceTo12[piece];
+}
+
+// piece_from_12()
+
+int piece_from_12(int piece) {
+
+ ASSERT(piece>=0&&piece<12);
+
+ return PieceFrom12[piece];
+}
+
+// piece_to_char()
+
+int piece_to_char(int piece) {
+
+ ASSERT(piece_is_ok(piece));
+
+ return PieceString[piece_to_12(piece)];
+}
+
+// piece_from_char()
+
+int piece_from_char(int c) {
+
+ const char * ptr;
+
+ ptr = strchr(PieceString,c);
+ if (ptr == NULL) return PieceNone256;
+
+ return piece_from_12(ptr-PieceString);
+}
+
+// char_is_piece()
+
+bool char_is_piece(int c) {
+
+ return strchr("PNBRQK",c) != NULL;
+}
+
+// end of piece.cpp
+
-\r
-// piece.h\r
-\r
-#ifndef PIECE_H\r
-#define PIECE_H\r
-\r
-// includes\r
-\r
-#include "colour.h"\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define BlackPawnFlag (1 << 2)\r
-#define WhitePawnFlag (1 << 3)\r
-#define KnightFlag (1 << 4)\r
-#define BishopFlag (1 << 5)\r
-#define RookFlag (1 << 6)\r
-#define KingFlag (1 << 7)\r
-\r
-#define PawnFlags (BlackPawnFlag | WhitePawnFlag)\r
-#define QueenFlags (BishopFlag | RookFlag)\r
-\r
-#define PieceNone64 (0)\r
-#define BlackPawn64 (BlackPawnFlag)\r
-#define WhitePawn64 (WhitePawnFlag)\r
-#define Knight64 (KnightFlag)\r
-#define Bishop64 (BishopFlag)\r
-#define Rook64 (RookFlag)\r
-#define Queen64 (QueenFlags)\r
-#define King64 (KingFlag)\r
-\r
-#define PieceNone256 (0)\r
-#define BlackPawn256 (BlackPawn64 | Black)\r
-#define WhitePawn256 (WhitePawn64 | White)\r
-#define BlackKnight256 (Knight64 | Black)\r
-#define WhiteKnight256 (Knight64 | White)\r
-#define BlackBishop256 (Bishop64 | Black)\r
-#define WhiteBishop256 (Bishop64 | White)\r
-#define BlackRook256 (Rook64 | Black)\r
-#define WhiteRook256 (Rook64 | White)\r
-#define BlackQueen256 (Queen64 | Black)\r
-#define WhiteQueen256 (Queen64 | White)\r
-#define BlackKing256 (King64 | Black)\r
-#define WhiteKing256 (King64 | White)\r
-\r
-#define BlackPawn12 (0)\r
-#define WhitePawn12 (1)\r
-#define BlackKnight12 (2)\r
-#define WhiteKnight12 (3)\r
-#define BlackBishop12 (4)\r
-#define WhiteBishop12 (5)\r
-#define BlackRook12 (6)\r
-#define WhiteRook12 (7)\r
-#define BlackQueen12 (8)\r
-#define WhiteQueen12 (9)\r
-#define BlackKing12 (10)\r
-#define WhiteKing12 (11)\r
-\r
-// functions\r
-\r
-extern void piece_init ();\r
-\r
-extern bool piece_is_ok (int piece);\r
-\r
-extern int piece_make_pawn (int colour);\r
-extern int piece_pawn_opp (int piece);\r
-\r
-extern int piece_colour (int piece);\r
-extern int piece_type (int piece);\r
-\r
-extern bool piece_is_pawn (int piece);\r
-extern bool piece_is_knight (int piece);\r
-extern bool piece_is_bishop (int piece);\r
-extern bool piece_is_rook (int piece);\r
-extern bool piece_is_queen (int piece);\r
-extern bool piece_is_king (int piece);\r
-\r
-extern bool piece_is_slider (int piece);\r
-\r
-extern int piece_to_12 (int piece);\r
-extern int piece_from_12 (int piece);\r
-\r
-extern int piece_to_char (int piece);\r
-extern int piece_from_char (int c);\r
-\r
-extern bool char_is_piece (int c);\r
-\r
-#endif // !defined PIECE_H\r
-\r
-// end of piece.h\r
-\r
+
+// piece.h
+
+#ifndef PIECE_H
+#define PIECE_H
+
+// includes
+
+#include "colour.h"
+#include "util.h"
+
+// defines
+
+#define BlackPawnFlag (1 << 2)
+#define WhitePawnFlag (1 << 3)
+#define KnightFlag (1 << 4)
+#define BishopFlag (1 << 5)
+#define RookFlag (1 << 6)
+#define KingFlag (1 << 7)
+
+#define PawnFlags (BlackPawnFlag | WhitePawnFlag)
+#define QueenFlags (BishopFlag | RookFlag)
+
+#define PieceNone64 (0)
+#define BlackPawn64 (BlackPawnFlag)
+#define WhitePawn64 (WhitePawnFlag)
+#define Knight64 (KnightFlag)
+#define Bishop64 (BishopFlag)
+#define Rook64 (RookFlag)
+#define Queen64 (QueenFlags)
+#define King64 (KingFlag)
+
+#define PieceNone256 (0)
+#define BlackPawn256 (BlackPawn64 | Black)
+#define WhitePawn256 (WhitePawn64 | White)
+#define BlackKnight256 (Knight64 | Black)
+#define WhiteKnight256 (Knight64 | White)
+#define BlackBishop256 (Bishop64 | Black)
+#define WhiteBishop256 (Bishop64 | White)
+#define BlackRook256 (Rook64 | Black)
+#define WhiteRook256 (Rook64 | White)
+#define BlackQueen256 (Queen64 | Black)
+#define WhiteQueen256 (Queen64 | White)
+#define BlackKing256 (King64 | Black)
+#define WhiteKing256 (King64 | White)
+
+#define BlackPawn12 (0)
+#define WhitePawn12 (1)
+#define BlackKnight12 (2)
+#define WhiteKnight12 (3)
+#define BlackBishop12 (4)
+#define WhiteBishop12 (5)
+#define BlackRook12 (6)
+#define WhiteRook12 (7)
+#define BlackQueen12 (8)
+#define WhiteQueen12 (9)
+#define BlackKing12 (10)
+#define WhiteKing12 (11)
+
+// functions
+
+extern void piece_init ();
+
+extern bool piece_is_ok (int piece);
+
+extern int piece_make_pawn (int colour);
+extern int piece_pawn_opp (int piece);
+
+extern int piece_colour (int piece);
+extern int piece_type (int piece);
+
+extern bool piece_is_pawn (int piece);
+extern bool piece_is_knight (int piece);
+extern bool piece_is_bishop (int piece);
+extern bool piece_is_rook (int piece);
+extern bool piece_is_queen (int piece);
+extern bool piece_is_king (int piece);
+
+extern bool piece_is_slider (int piece);
+
+extern int piece_to_12 (int piece);
+extern int piece_from_12 (int piece);
+
+extern int piece_to_char (int piece);
+extern int piece_from_char (int c);
+
+extern bool char_is_piece (int c);
+
+#endif // !defined PIECE_H
+
+// end of piece.h
+
#include <sys/wait.h>
#include "pipex.h"
-// constants
-
-static const unsigned int StringSize = 4096;
-
// prototypes
static void my_close(int fd);
Summary: A Winboard protocol to UCI protocol adapter
Name: polyglot
-Version: 1.4.61b
+Version: 1.4.63b
Release: 1
License: GPL
Group: Amusement/Games
-\r
-// random.c\r
-\r
-// includes\r
-\r
-#include "random.h"\r
-#include "util.h"\r
-\r
-// "constants"\r
-\r
-const uint64 Random64[RandomNb] = {\r
- U64(0x9D39247E33776D41), U64(0x2AF7398005AAA5C7), U64(0x44DB015024623547), U64(0x9C15F73E62A76AE2),\r
- U64(0x75834465489C0C89), U64(0x3290AC3A203001BF), U64(0x0FBBAD1F61042279), U64(0xE83A908FF2FB60CA),\r
- U64(0x0D7E765D58755C10), U64(0x1A083822CEAFE02D), U64(0x9605D5F0E25EC3B0), U64(0xD021FF5CD13A2ED5),\r
- U64(0x40BDF15D4A672E32), U64(0x011355146FD56395), U64(0x5DB4832046F3D9E5), U64(0x239F8B2D7FF719CC),\r
- U64(0x05D1A1AE85B49AA1), U64(0x679F848F6E8FC971), U64(0x7449BBFF801FED0B), U64(0x7D11CDB1C3B7ADF0),\r
- U64(0x82C7709E781EB7CC), U64(0xF3218F1C9510786C), U64(0x331478F3AF51BBE6), U64(0x4BB38DE5E7219443),\r
- U64(0xAA649C6EBCFD50FC), U64(0x8DBD98A352AFD40B), U64(0x87D2074B81D79217), U64(0x19F3C751D3E92AE1),\r
- U64(0xB4AB30F062B19ABF), U64(0x7B0500AC42047AC4), U64(0xC9452CA81A09D85D), U64(0x24AA6C514DA27500),\r
- U64(0x4C9F34427501B447), U64(0x14A68FD73C910841), U64(0xA71B9B83461CBD93), U64(0x03488B95B0F1850F),\r
- U64(0x637B2B34FF93C040), U64(0x09D1BC9A3DD90A94), U64(0x3575668334A1DD3B), U64(0x735E2B97A4C45A23),\r
- U64(0x18727070F1BD400B), U64(0x1FCBACD259BF02E7), U64(0xD310A7C2CE9B6555), U64(0xBF983FE0FE5D8244),\r
- U64(0x9F74D14F7454A824), U64(0x51EBDC4AB9BA3035), U64(0x5C82C505DB9AB0FA), U64(0xFCF7FE8A3430B241),\r
- U64(0x3253A729B9BA3DDE), U64(0x8C74C368081B3075), U64(0xB9BC6C87167C33E7), U64(0x7EF48F2B83024E20),\r
- U64(0x11D505D4C351BD7F), U64(0x6568FCA92C76A243), U64(0x4DE0B0F40F32A7B8), U64(0x96D693460CC37E5D),\r
- U64(0x42E240CB63689F2F), U64(0x6D2BDCDAE2919661), U64(0x42880B0236E4D951), U64(0x5F0F4A5898171BB6),\r
- U64(0x39F890F579F92F88), U64(0x93C5B5F47356388B), U64(0x63DC359D8D231B78), U64(0xEC16CA8AEA98AD76),\r
- U64(0x5355F900C2A82DC7), U64(0x07FB9F855A997142), U64(0x5093417AA8A7ED5E), U64(0x7BCBC38DA25A7F3C),\r
- U64(0x19FC8A768CF4B6D4), U64(0x637A7780DECFC0D9), U64(0x8249A47AEE0E41F7), U64(0x79AD695501E7D1E8),\r
- U64(0x14ACBAF4777D5776), U64(0xF145B6BECCDEA195), U64(0xDABF2AC8201752FC), U64(0x24C3C94DF9C8D3F6),\r
- U64(0xBB6E2924F03912EA), U64(0x0CE26C0B95C980D9), U64(0xA49CD132BFBF7CC4), U64(0xE99D662AF4243939),\r
- U64(0x27E6AD7891165C3F), U64(0x8535F040B9744FF1), U64(0x54B3F4FA5F40D873), U64(0x72B12C32127FED2B),\r
- U64(0xEE954D3C7B411F47), U64(0x9A85AC909A24EAA1), U64(0x70AC4CD9F04F21F5), U64(0xF9B89D3E99A075C2),\r
- U64(0x87B3E2B2B5C907B1), U64(0xA366E5B8C54F48B8), U64(0xAE4A9346CC3F7CF2), U64(0x1920C04D47267BBD),\r
- U64(0x87BF02C6B49E2AE9), U64(0x092237AC237F3859), U64(0xFF07F64EF8ED14D0), U64(0x8DE8DCA9F03CC54E),\r
- U64(0x9C1633264DB49C89), U64(0xB3F22C3D0B0B38ED), U64(0x390E5FB44D01144B), U64(0x5BFEA5B4712768E9),\r
- U64(0x1E1032911FA78984), U64(0x9A74ACB964E78CB3), U64(0x4F80F7A035DAFB04), U64(0x6304D09A0B3738C4),\r
- U64(0x2171E64683023A08), U64(0x5B9B63EB9CEFF80C), U64(0x506AACF489889342), U64(0x1881AFC9A3A701D6),\r
- U64(0x6503080440750644), U64(0xDFD395339CDBF4A7), U64(0xEF927DBCF00C20F2), U64(0x7B32F7D1E03680EC),\r
- U64(0xB9FD7620E7316243), U64(0x05A7E8A57DB91B77), U64(0xB5889C6E15630A75), U64(0x4A750A09CE9573F7),\r
- U64(0xCF464CEC899A2F8A), U64(0xF538639CE705B824), U64(0x3C79A0FF5580EF7F), U64(0xEDE6C87F8477609D),\r
- U64(0x799E81F05BC93F31), U64(0x86536B8CF3428A8C), U64(0x97D7374C60087B73), U64(0xA246637CFF328532),\r
- U64(0x043FCAE60CC0EBA0), U64(0x920E449535DD359E), U64(0x70EB093B15B290CC), U64(0x73A1921916591CBD),\r
- U64(0x56436C9FE1A1AA8D), U64(0xEFAC4B70633B8F81), U64(0xBB215798D45DF7AF), U64(0x45F20042F24F1768),\r
- U64(0x930F80F4E8EB7462), U64(0xFF6712FFCFD75EA1), U64(0xAE623FD67468AA70), U64(0xDD2C5BC84BC8D8FC),\r
- U64(0x7EED120D54CF2DD9), U64(0x22FE545401165F1C), U64(0xC91800E98FB99929), U64(0x808BD68E6AC10365),\r
- U64(0xDEC468145B7605F6), U64(0x1BEDE3A3AEF53302), U64(0x43539603D6C55602), U64(0xAA969B5C691CCB7A),\r
- U64(0xA87832D392EFEE56), U64(0x65942C7B3C7E11AE), U64(0xDED2D633CAD004F6), U64(0x21F08570F420E565),\r
- U64(0xB415938D7DA94E3C), U64(0x91B859E59ECB6350), U64(0x10CFF333E0ED804A), U64(0x28AED140BE0BB7DD),\r
- U64(0xC5CC1D89724FA456), U64(0x5648F680F11A2741), U64(0x2D255069F0B7DAB3), U64(0x9BC5A38EF729ABD4),\r
- U64(0xEF2F054308F6A2BC), U64(0xAF2042F5CC5C2858), U64(0x480412BAB7F5BE2A), U64(0xAEF3AF4A563DFE43),\r
- U64(0x19AFE59AE451497F), U64(0x52593803DFF1E840), U64(0xF4F076E65F2CE6F0), U64(0x11379625747D5AF3),\r
- U64(0xBCE5D2248682C115), U64(0x9DA4243DE836994F), U64(0x066F70B33FE09017), U64(0x4DC4DE189B671A1C),\r
- U64(0x51039AB7712457C3), U64(0xC07A3F80C31FB4B4), U64(0xB46EE9C5E64A6E7C), U64(0xB3819A42ABE61C87),\r
- U64(0x21A007933A522A20), U64(0x2DF16F761598AA4F), U64(0x763C4A1371B368FD), U64(0xF793C46702E086A0),\r
- U64(0xD7288E012AEB8D31), U64(0xDE336A2A4BC1C44B), U64(0x0BF692B38D079F23), U64(0x2C604A7A177326B3),\r
- U64(0x4850E73E03EB6064), U64(0xCFC447F1E53C8E1B), U64(0xB05CA3F564268D99), U64(0x9AE182C8BC9474E8),\r
- U64(0xA4FC4BD4FC5558CA), U64(0xE755178D58FC4E76), U64(0x69B97DB1A4C03DFE), U64(0xF9B5B7C4ACC67C96),\r
- U64(0xFC6A82D64B8655FB), U64(0x9C684CB6C4D24417), U64(0x8EC97D2917456ED0), U64(0x6703DF9D2924E97E),\r
- U64(0xC547F57E42A7444E), U64(0x78E37644E7CAD29E), U64(0xFE9A44E9362F05FA), U64(0x08BD35CC38336615),\r
- U64(0x9315E5EB3A129ACE), U64(0x94061B871E04DF75), U64(0xDF1D9F9D784BA010), U64(0x3BBA57B68871B59D),\r
- U64(0xD2B7ADEEDED1F73F), U64(0xF7A255D83BC373F8), U64(0xD7F4F2448C0CEB81), U64(0xD95BE88CD210FFA7),\r
- U64(0x336F52F8FF4728E7), U64(0xA74049DAC312AC71), U64(0xA2F61BB6E437FDB5), U64(0x4F2A5CB07F6A35B3),\r
- U64(0x87D380BDA5BF7859), U64(0x16B9F7E06C453A21), U64(0x7BA2484C8A0FD54E), U64(0xF3A678CAD9A2E38C),\r
- U64(0x39B0BF7DDE437BA2), U64(0xFCAF55C1BF8A4424), U64(0x18FCF680573FA594), U64(0x4C0563B89F495AC3),\r
- U64(0x40E087931A00930D), U64(0x8CFFA9412EB642C1), U64(0x68CA39053261169F), U64(0x7A1EE967D27579E2),\r
- U64(0x9D1D60E5076F5B6F), U64(0x3810E399B6F65BA2), U64(0x32095B6D4AB5F9B1), U64(0x35CAB62109DD038A),\r
- U64(0xA90B24499FCFAFB1), U64(0x77A225A07CC2C6BD), U64(0x513E5E634C70E331), U64(0x4361C0CA3F692F12),\r
- U64(0xD941ACA44B20A45B), U64(0x528F7C8602C5807B), U64(0x52AB92BEB9613989), U64(0x9D1DFA2EFC557F73),\r
- U64(0x722FF175F572C348), U64(0x1D1260A51107FE97), U64(0x7A249A57EC0C9BA2), U64(0x04208FE9E8F7F2D6),\r
- U64(0x5A110C6058B920A0), U64(0x0CD9A497658A5698), U64(0x56FD23C8F9715A4C), U64(0x284C847B9D887AAE),\r
- U64(0x04FEABFBBDB619CB), U64(0x742E1E651C60BA83), U64(0x9A9632E65904AD3C), U64(0x881B82A13B51B9E2),\r
- U64(0x506E6744CD974924), U64(0xB0183DB56FFC6A79), U64(0x0ED9B915C66ED37E), U64(0x5E11E86D5873D484),\r
- U64(0xF678647E3519AC6E), U64(0x1B85D488D0F20CC5), U64(0xDAB9FE6525D89021), U64(0x0D151D86ADB73615),\r
- U64(0xA865A54EDCC0F019), U64(0x93C42566AEF98FFB), U64(0x99E7AFEABE000731), U64(0x48CBFF086DDF285A),\r
- U64(0x7F9B6AF1EBF78BAF), U64(0x58627E1A149BBA21), U64(0x2CD16E2ABD791E33), U64(0xD363EFF5F0977996),\r
- U64(0x0CE2A38C344A6EED), U64(0x1A804AADB9CFA741), U64(0x907F30421D78C5DE), U64(0x501F65EDB3034D07),\r
- U64(0x37624AE5A48FA6E9), U64(0x957BAF61700CFF4E), U64(0x3A6C27934E31188A), U64(0xD49503536ABCA345),\r
- U64(0x088E049589C432E0), U64(0xF943AEE7FEBF21B8), U64(0x6C3B8E3E336139D3), U64(0x364F6FFA464EE52E),\r
- U64(0xD60F6DCEDC314222), U64(0x56963B0DCA418FC0), U64(0x16F50EDF91E513AF), U64(0xEF1955914B609F93),\r
- U64(0x565601C0364E3228), U64(0xECB53939887E8175), U64(0xBAC7A9A18531294B), U64(0xB344C470397BBA52),\r
- U64(0x65D34954DAF3CEBD), U64(0xB4B81B3FA97511E2), U64(0xB422061193D6F6A7), U64(0x071582401C38434D),\r
- U64(0x7A13F18BBEDC4FF5), U64(0xBC4097B116C524D2), U64(0x59B97885E2F2EA28), U64(0x99170A5DC3115544),\r
- U64(0x6F423357E7C6A9F9), U64(0x325928EE6E6F8794), U64(0xD0E4366228B03343), U64(0x565C31F7DE89EA27),\r
- U64(0x30F5611484119414), U64(0xD873DB391292ED4F), U64(0x7BD94E1D8E17DEBC), U64(0xC7D9F16864A76E94),\r
- U64(0x947AE053EE56E63C), U64(0xC8C93882F9475F5F), U64(0x3A9BF55BA91F81CA), U64(0xD9A11FBB3D9808E4),\r
- U64(0x0FD22063EDC29FCA), U64(0xB3F256D8ACA0B0B9), U64(0xB03031A8B4516E84), U64(0x35DD37D5871448AF),\r
- U64(0xE9F6082B05542E4E), U64(0xEBFAFA33D7254B59), U64(0x9255ABB50D532280), U64(0xB9AB4CE57F2D34F3),\r
- U64(0x693501D628297551), U64(0xC62C58F97DD949BF), U64(0xCD454F8F19C5126A), U64(0xBBE83F4ECC2BDECB),\r
- U64(0xDC842B7E2819E230), U64(0xBA89142E007503B8), U64(0xA3BC941D0A5061CB), U64(0xE9F6760E32CD8021),\r
- U64(0x09C7E552BC76492F), U64(0x852F54934DA55CC9), U64(0x8107FCCF064FCF56), U64(0x098954D51FFF6580),\r
- U64(0x23B70EDB1955C4BF), U64(0xC330DE426430F69D), U64(0x4715ED43E8A45C0A), U64(0xA8D7E4DAB780A08D),\r
- U64(0x0572B974F03CE0BB), U64(0xB57D2E985E1419C7), U64(0xE8D9ECBE2CF3D73F), U64(0x2FE4B17170E59750),\r
- U64(0x11317BA87905E790), U64(0x7FBF21EC8A1F45EC), U64(0x1725CABFCB045B00), U64(0x964E915CD5E2B207),\r
- U64(0x3E2B8BCBF016D66D), U64(0xBE7444E39328A0AC), U64(0xF85B2B4FBCDE44B7), U64(0x49353FEA39BA63B1),\r
- U64(0x1DD01AAFCD53486A), U64(0x1FCA8A92FD719F85), U64(0xFC7C95D827357AFA), U64(0x18A6A990C8B35EBD),\r
- U64(0xCCCB7005C6B9C28D), U64(0x3BDBB92C43B17F26), U64(0xAA70B5B4F89695A2), U64(0xE94C39A54A98307F),\r
- U64(0xB7A0B174CFF6F36E), U64(0xD4DBA84729AF48AD), U64(0x2E18BC1AD9704A68), U64(0x2DE0966DAF2F8B1C),\r
- U64(0xB9C11D5B1E43A07E), U64(0x64972D68DEE33360), U64(0x94628D38D0C20584), U64(0xDBC0D2B6AB90A559),\r
- U64(0xD2733C4335C6A72F), U64(0x7E75D99D94A70F4D), U64(0x6CED1983376FA72B), U64(0x97FCAACBF030BC24),\r
- U64(0x7B77497B32503B12), U64(0x8547EDDFB81CCB94), U64(0x79999CDFF70902CB), U64(0xCFFE1939438E9B24),\r
- U64(0x829626E3892D95D7), U64(0x92FAE24291F2B3F1), U64(0x63E22C147B9C3403), U64(0xC678B6D860284A1C),\r
- U64(0x5873888850659AE7), U64(0x0981DCD296A8736D), U64(0x9F65789A6509A440), U64(0x9FF38FED72E9052F),\r
- U64(0xE479EE5B9930578C), U64(0xE7F28ECD2D49EECD), U64(0x56C074A581EA17FE), U64(0x5544F7D774B14AEF),\r
- U64(0x7B3F0195FC6F290F), U64(0x12153635B2C0CF57), U64(0x7F5126DBBA5E0CA7), U64(0x7A76956C3EAFB413),\r
- U64(0x3D5774A11D31AB39), U64(0x8A1B083821F40CB4), U64(0x7B4A38E32537DF62), U64(0x950113646D1D6E03),\r
- U64(0x4DA8979A0041E8A9), U64(0x3BC36E078F7515D7), U64(0x5D0A12F27AD310D1), U64(0x7F9D1A2E1EBE1327),\r
- U64(0xDA3A361B1C5157B1), U64(0xDCDD7D20903D0C25), U64(0x36833336D068F707), U64(0xCE68341F79893389),\r
- U64(0xAB9090168DD05F34), U64(0x43954B3252DC25E5), U64(0xB438C2B67F98E5E9), U64(0x10DCD78E3851A492),\r
- U64(0xDBC27AB5447822BF), U64(0x9B3CDB65F82CA382), U64(0xB67B7896167B4C84), U64(0xBFCED1B0048EAC50),\r
- U64(0xA9119B60369FFEBD), U64(0x1FFF7AC80904BF45), U64(0xAC12FB171817EEE7), U64(0xAF08DA9177DDA93D),\r
- U64(0x1B0CAB936E65C744), U64(0xB559EB1D04E5E932), U64(0xC37B45B3F8D6F2BA), U64(0xC3A9DC228CAAC9E9),\r
- U64(0xF3B8B6675A6507FF), U64(0x9FC477DE4ED681DA), U64(0x67378D8ECCEF96CB), U64(0x6DD856D94D259236),\r
- U64(0xA319CE15B0B4DB31), U64(0x073973751F12DD5E), U64(0x8A8E849EB32781A5), U64(0xE1925C71285279F5),\r
- U64(0x74C04BF1790C0EFE), U64(0x4DDA48153C94938A), U64(0x9D266D6A1CC0542C), U64(0x7440FB816508C4FE),\r
- U64(0x13328503DF48229F), U64(0xD6BF7BAEE43CAC40), U64(0x4838D65F6EF6748F), U64(0x1E152328F3318DEA),\r
- U64(0x8F8419A348F296BF), U64(0x72C8834A5957B511), U64(0xD7A023A73260B45C), U64(0x94EBC8ABCFB56DAE),\r
- U64(0x9FC10D0F989993E0), U64(0xDE68A2355B93CAE6), U64(0xA44CFE79AE538BBE), U64(0x9D1D84FCCE371425),\r
- U64(0x51D2B1AB2DDFB636), U64(0x2FD7E4B9E72CD38C), U64(0x65CA5B96B7552210), U64(0xDD69A0D8AB3B546D),\r
- U64(0x604D51B25FBF70E2), U64(0x73AA8A564FB7AC9E), U64(0x1A8C1E992B941148), U64(0xAAC40A2703D9BEA0),\r
- U64(0x764DBEAE7FA4F3A6), U64(0x1E99B96E70A9BE8B), U64(0x2C5E9DEB57EF4743), U64(0x3A938FEE32D29981),\r
- U64(0x26E6DB8FFDF5ADFE), U64(0x469356C504EC9F9D), U64(0xC8763C5B08D1908C), U64(0x3F6C6AF859D80055),\r
- U64(0x7F7CC39420A3A545), U64(0x9BFB227EBDF4C5CE), U64(0x89039D79D6FC5C5C), U64(0x8FE88B57305E2AB6),\r
- U64(0xA09E8C8C35AB96DE), U64(0xFA7E393983325753), U64(0xD6B6D0ECC617C699), U64(0xDFEA21EA9E7557E3),\r
- U64(0xB67C1FA481680AF8), U64(0xCA1E3785A9E724E5), U64(0x1CFC8BED0D681639), U64(0xD18D8549D140CAEA),\r
- U64(0x4ED0FE7E9DC91335), U64(0xE4DBF0634473F5D2), U64(0x1761F93A44D5AEFE), U64(0x53898E4C3910DA55),\r
- U64(0x734DE8181F6EC39A), U64(0x2680B122BAA28D97), U64(0x298AF231C85BAFAB), U64(0x7983EED3740847D5),\r
- U64(0x66C1A2A1A60CD889), U64(0x9E17E49642A3E4C1), U64(0xEDB454E7BADC0805), U64(0x50B704CAB602C329),\r
- U64(0x4CC317FB9CDDD023), U64(0x66B4835D9EAFEA22), U64(0x219B97E26FFC81BD), U64(0x261E4E4C0A333A9D),\r
- U64(0x1FE2CCA76517DB90), U64(0xD7504DFA8816EDBB), U64(0xB9571FA04DC089C8), U64(0x1DDC0325259B27DE),\r
- U64(0xCF3F4688801EB9AA), U64(0xF4F5D05C10CAB243), U64(0x38B6525C21A42B0E), U64(0x36F60E2BA4FA6800),\r
- U64(0xEB3593803173E0CE), U64(0x9C4CD6257C5A3603), U64(0xAF0C317D32ADAA8A), U64(0x258E5A80C7204C4B),\r
- U64(0x8B889D624D44885D), U64(0xF4D14597E660F855), U64(0xD4347F66EC8941C3), U64(0xE699ED85B0DFB40D),\r
- U64(0x2472F6207C2D0484), U64(0xC2A1E7B5B459AEB5), U64(0xAB4F6451CC1D45EC), U64(0x63767572AE3D6174),\r
- U64(0xA59E0BD101731A28), U64(0x116D0016CB948F09), U64(0x2CF9C8CA052F6E9F), U64(0x0B090A7560A968E3),\r
- U64(0xABEEDDB2DDE06FF1), U64(0x58EFC10B06A2068D), U64(0xC6E57A78FBD986E0), U64(0x2EAB8CA63CE802D7),\r
- U64(0x14A195640116F336), U64(0x7C0828DD624EC390), U64(0xD74BBE77E6116AC7), U64(0x804456AF10F5FB53),\r
- U64(0xEBE9EA2ADF4321C7), U64(0x03219A39EE587A30), U64(0x49787FEF17AF9924), U64(0xA1E9300CD8520548),\r
- U64(0x5B45E522E4B1B4EF), U64(0xB49C3B3995091A36), U64(0xD4490AD526F14431), U64(0x12A8F216AF9418C2),\r
- U64(0x001F837CC7350524), U64(0x1877B51E57A764D5), U64(0xA2853B80F17F58EE), U64(0x993E1DE72D36D310),\r
- U64(0xB3598080CE64A656), U64(0x252F59CF0D9F04BB), U64(0xD23C8E176D113600), U64(0x1BDA0492E7E4586E),\r
- U64(0x21E0BD5026C619BF), U64(0x3B097ADAF088F94E), U64(0x8D14DEDB30BE846E), U64(0xF95CFFA23AF5F6F4),\r
- U64(0x3871700761B3F743), U64(0xCA672B91E9E4FA16), U64(0x64C8E531BFF53B55), U64(0x241260ED4AD1E87D),\r
- U64(0x106C09B972D2E822), U64(0x7FBA195410E5CA30), U64(0x7884D9BC6CB569D8), U64(0x0647DFEDCD894A29),\r
- U64(0x63573FF03E224774), U64(0x4FC8E9560F91B123), U64(0x1DB956E450275779), U64(0xB8D91274B9E9D4FB),\r
- U64(0xA2EBEE47E2FBFCE1), U64(0xD9F1F30CCD97FB09), U64(0xEFED53D75FD64E6B), U64(0x2E6D02C36017F67F),\r
- U64(0xA9AA4D20DB084E9B), U64(0xB64BE8D8B25396C1), U64(0x70CB6AF7C2D5BCF0), U64(0x98F076A4F7A2322E),\r
- U64(0xBF84470805E69B5F), U64(0x94C3251F06F90CF3), U64(0x3E003E616A6591E9), U64(0xB925A6CD0421AFF3),\r
- U64(0x61BDD1307C66E300), U64(0xBF8D5108E27E0D48), U64(0x240AB57A8B888B20), U64(0xFC87614BAF287E07),\r
- U64(0xEF02CDD06FFDB432), U64(0xA1082C0466DF6C0A), U64(0x8215E577001332C8), U64(0xD39BB9C3A48DB6CF),\r
- U64(0x2738259634305C14), U64(0x61CF4F94C97DF93D), U64(0x1B6BACA2AE4E125B), U64(0x758F450C88572E0B),\r
- U64(0x959F587D507A8359), U64(0xB063E962E045F54D), U64(0x60E8ED72C0DFF5D1), U64(0x7B64978555326F9F),\r
- U64(0xFD080D236DA814BA), U64(0x8C90FD9B083F4558), U64(0x106F72FE81E2C590), U64(0x7976033A39F7D952),\r
- U64(0xA4EC0132764CA04B), U64(0x733EA705FAE4FA77), U64(0xB4D8F77BC3E56167), U64(0x9E21F4F903B33FD9),\r
- U64(0x9D765E419FB69F6D), U64(0xD30C088BA61EA5EF), U64(0x5D94337FBFAF7F5B), U64(0x1A4E4822EB4D7A59),\r
- U64(0x6FFE73E81B637FB3), U64(0xDDF957BC36D8B9CA), U64(0x64D0E29EEA8838B3), U64(0x08DD9BDFD96B9F63),\r
- U64(0x087E79E5A57D1D13), U64(0xE328E230E3E2B3FB), U64(0x1C2559E30F0946BE), U64(0x720BF5F26F4D2EAA),\r
- U64(0xB0774D261CC609DB), U64(0x443F64EC5A371195), U64(0x4112CF68649A260E), U64(0xD813F2FAB7F5C5CA),\r
- U64(0x660D3257380841EE), U64(0x59AC2C7873F910A3), U64(0xE846963877671A17), U64(0x93B633ABFA3469F8),\r
- U64(0xC0C0F5A60EF4CDCF), U64(0xCAF21ECD4377B28C), U64(0x57277707199B8175), U64(0x506C11B9D90E8B1D),\r
- U64(0xD83CC2687A19255F), U64(0x4A29C6465A314CD1), U64(0xED2DF21216235097), U64(0xB5635C95FF7296E2),\r
- U64(0x22AF003AB672E811), U64(0x52E762596BF68235), U64(0x9AEBA33AC6ECC6B0), U64(0x944F6DE09134DFB6),\r
- U64(0x6C47BEC883A7DE39), U64(0x6AD047C430A12104), U64(0xA5B1CFDBA0AB4067), U64(0x7C45D833AFF07862),\r
- U64(0x5092EF950A16DA0B), U64(0x9338E69C052B8E7B), U64(0x455A4B4CFE30E3F5), U64(0x6B02E63195AD0CF8),\r
- U64(0x6B17B224BAD6BF27), U64(0xD1E0CCD25BB9C169), U64(0xDE0C89A556B9AE70), U64(0x50065E535A213CF6),\r
- U64(0x9C1169FA2777B874), U64(0x78EDEFD694AF1EED), U64(0x6DC93D9526A50E68), U64(0xEE97F453F06791ED),\r
- U64(0x32AB0EDB696703D3), U64(0x3A6853C7E70757A7), U64(0x31865CED6120F37D), U64(0x67FEF95D92607890),\r
- U64(0x1F2B1D1F15F6DC9C), U64(0xB69E38A8965C6B65), U64(0xAA9119FF184CCCF4), U64(0xF43C732873F24C13),\r
- U64(0xFB4A3D794A9A80D2), U64(0x3550C2321FD6109C), U64(0x371F77E76BB8417E), U64(0x6BFA9AAE5EC05779),\r
- U64(0xCD04F3FF001A4778), U64(0xE3273522064480CA), U64(0x9F91508BFFCFC14A), U64(0x049A7F41061A9E60),\r
- U64(0xFCB6BE43A9F2FE9B), U64(0x08DE8A1C7797DA9B), U64(0x8F9887E6078735A1), U64(0xB5B4071DBFC73A66),\r
- U64(0x230E343DFBA08D33), U64(0x43ED7F5A0FAE657D), U64(0x3A88A0FBBCB05C63), U64(0x21874B8B4D2DBC4F),\r
- U64(0x1BDEA12E35F6A8C9), U64(0x53C065C6C8E63528), U64(0xE34A1D250E7A8D6B), U64(0xD6B04D3B7651DD7E),\r
- U64(0x5E90277E7CB39E2D), U64(0x2C046F22062DC67D), U64(0xB10BB459132D0A26), U64(0x3FA9DDFB67E2F199),\r
- U64(0x0E09B88E1914F7AF), U64(0x10E8B35AF3EEAB37), U64(0x9EEDECA8E272B933), U64(0xD4C718BC4AE8AE5F),\r
- U64(0x81536D601170FC20), U64(0x91B534F885818A06), U64(0xEC8177F83F900978), U64(0x190E714FADA5156E),\r
- U64(0xB592BF39B0364963), U64(0x89C350C893AE7DC1), U64(0xAC042E70F8B383F2), U64(0xB49B52E587A1EE60),\r
- U64(0xFB152FE3FF26DA89), U64(0x3E666E6F69AE2C15), U64(0x3B544EBE544C19F9), U64(0xE805A1E290CF2456),\r
- U64(0x24B33C9D7ED25117), U64(0xE74733427B72F0C1), U64(0x0A804D18B7097475), U64(0x57E3306D881EDB4F),\r
- U64(0x4AE7D6A36EB5DBCB), U64(0x2D8D5432157064C8), U64(0xD1E649DE1E7F268B), U64(0x8A328A1CEDFE552C),\r
- U64(0x07A3AEC79624C7DA), U64(0x84547DDC3E203C94), U64(0x990A98FD5071D263), U64(0x1A4FF12616EEFC89),\r
- U64(0xF6F7FD1431714200), U64(0x30C05B1BA332F41C), U64(0x8D2636B81555A786), U64(0x46C9FEB55D120902),\r
- U64(0xCCEC0A73B49C9921), U64(0x4E9D2827355FC492), U64(0x19EBB029435DCB0F), U64(0x4659D2B743848A2C),\r
- U64(0x963EF2C96B33BE31), U64(0x74F85198B05A2E7D), U64(0x5A0F544DD2B1FB18), U64(0x03727073C2E134B1),\r
- U64(0xC7F6AA2DE59AEA61), U64(0x352787BAA0D7C22F), U64(0x9853EAB63B5E0B35), U64(0xABBDCDD7ED5C0860),\r
- U64(0xCF05DAF5AC8D77B0), U64(0x49CAD48CEBF4A71E), U64(0x7A4C10EC2158C4A6), U64(0xD9E92AA246BF719E),\r
- U64(0x13AE978D09FE5557), U64(0x730499AF921549FF), U64(0x4E4B705B92903BA4), U64(0xFF577222C14F0A3A),\r
- U64(0x55B6344CF97AAFAE), U64(0xB862225B055B6960), U64(0xCAC09AFBDDD2CDB4), U64(0xDAF8E9829FE96B5F),\r
- U64(0xB5FDFC5D3132C498), U64(0x310CB380DB6F7503), U64(0xE87FBB46217A360E), U64(0x2102AE466EBB1148),\r
- U64(0xF8549E1A3AA5E00D), U64(0x07A69AFDCC42261A), U64(0xC4C118BFE78FEAAE), U64(0xF9F4892ED96BD438),\r
- U64(0x1AF3DBE25D8F45DA), U64(0xF5B4B0B0D2DEEEB4), U64(0x962ACEEFA82E1C84), U64(0x046E3ECAAF453CE9),\r
- U64(0xF05D129681949A4C), U64(0x964781CE734B3C84), U64(0x9C2ED44081CE5FBD), U64(0x522E23F3925E319E),\r
- U64(0x177E00F9FC32F791), U64(0x2BC60A63A6F3B3F2), U64(0x222BBFAE61725606), U64(0x486289DDCC3D6780),\r
- U64(0x7DC7785B8EFDFC80), U64(0x8AF38731C02BA980), U64(0x1FAB64EA29A2DDF7), U64(0xE4D9429322CD065A),\r
- U64(0x9DA058C67844F20C), U64(0x24C0E332B70019B0), U64(0x233003B5A6CFE6AD), U64(0xD586BD01C5C217F6),\r
- U64(0x5E5637885F29BC2B), U64(0x7EBA726D8C94094B), U64(0x0A56A5F0BFE39272), U64(0xD79476A84EE20D06),\r
- U64(0x9E4C1269BAA4BF37), U64(0x17EFEE45B0DEE640), U64(0x1D95B0A5FCF90BC6), U64(0x93CBE0B699C2585D),\r
- U64(0x65FA4F227A2B6D79), U64(0xD5F9E858292504D5), U64(0xC2B5A03F71471A6F), U64(0x59300222B4561E00),\r
- U64(0xCE2F8642CA0712DC), U64(0x7CA9723FBB2E8988), U64(0x2785338347F2BA08), U64(0xC61BB3A141E50E8C),\r
- U64(0x150F361DAB9DEC26), U64(0x9F6A419D382595F4), U64(0x64A53DC924FE7AC9), U64(0x142DE49FFF7A7C3D),\r
- U64(0x0C335248857FA9E7), U64(0x0A9C32D5EAE45305), U64(0xE6C42178C4BBB92E), U64(0x71F1CE2490D20B07),\r
- U64(0xF1BCC3D275AFE51A), U64(0xE728E8C83C334074), U64(0x96FBF83A12884624), U64(0x81A1549FD6573DA5),\r
- U64(0x5FA7867CAF35E149), U64(0x56986E2EF3ED091B), U64(0x917F1DD5F8886C61), U64(0xD20D8C88C8FFE65F),\r
- U64(0x31D71DCE64B2C310), U64(0xF165B587DF898190), U64(0xA57E6339DD2CF3A0), U64(0x1EF6E6DBB1961EC9),\r
- U64(0x70CC73D90BC26E24), U64(0xE21A6B35DF0C3AD7), U64(0x003A93D8B2806962), U64(0x1C99DED33CB890A1),\r
- U64(0xCF3145DE0ADD4289), U64(0xD0E4427A5514FB72), U64(0x77C621CC9FB3A483), U64(0x67A34DAC4356550B),\r
- U64(0xF8D626AAAF278509),\r
-};\r
-\r
-// functions\r
-\r
-// random_init()\r
-\r
-void random_init() {\r
-\r
- if ((Random64[RandomNb-1] >> 32) != 0xF8D626AA) { // upper half of the last element of the array\r
- my_fatal("random_init(): broken 64-bit types\n");\r
- }\r
-}\r
-\r
-// random_64()\r
-\r
-uint64 random_64(int n) {\r
-\r
- ASSERT(n>=0&&n<RandomNb);\r
-\r
- return Random64[n];\r
-}\r
-\r
-// end of random.cpp\r
-\r
+
+// random.c
+
+// includes
+
+#include "random.h"
+#include "util.h"
+
+// "constants"
+
+const uint64 Random64[RandomNb] = {
+ U64(0x9D39247E33776D41), U64(0x2AF7398005AAA5C7), U64(0x44DB015024623547), U64(0x9C15F73E62A76AE2),
+ U64(0x75834465489C0C89), U64(0x3290AC3A203001BF), U64(0x0FBBAD1F61042279), U64(0xE83A908FF2FB60CA),
+ U64(0x0D7E765D58755C10), U64(0x1A083822CEAFE02D), U64(0x9605D5F0E25EC3B0), U64(0xD021FF5CD13A2ED5),
+ U64(0x40BDF15D4A672E32), U64(0x011355146FD56395), U64(0x5DB4832046F3D9E5), U64(0x239F8B2D7FF719CC),
+ U64(0x05D1A1AE85B49AA1), U64(0x679F848F6E8FC971), U64(0x7449BBFF801FED0B), U64(0x7D11CDB1C3B7ADF0),
+ U64(0x82C7709E781EB7CC), U64(0xF3218F1C9510786C), U64(0x331478F3AF51BBE6), U64(0x4BB38DE5E7219443),
+ U64(0xAA649C6EBCFD50FC), U64(0x8DBD98A352AFD40B), U64(0x87D2074B81D79217), U64(0x19F3C751D3E92AE1),
+ U64(0xB4AB30F062B19ABF), U64(0x7B0500AC42047AC4), U64(0xC9452CA81A09D85D), U64(0x24AA6C514DA27500),
+ U64(0x4C9F34427501B447), U64(0x14A68FD73C910841), U64(0xA71B9B83461CBD93), U64(0x03488B95B0F1850F),
+ U64(0x637B2B34FF93C040), U64(0x09D1BC9A3DD90A94), U64(0x3575668334A1DD3B), U64(0x735E2B97A4C45A23),
+ U64(0x18727070F1BD400B), U64(0x1FCBACD259BF02E7), U64(0xD310A7C2CE9B6555), U64(0xBF983FE0FE5D8244),
+ U64(0x9F74D14F7454A824), U64(0x51EBDC4AB9BA3035), U64(0x5C82C505DB9AB0FA), U64(0xFCF7FE8A3430B241),
+ U64(0x3253A729B9BA3DDE), U64(0x8C74C368081B3075), U64(0xB9BC6C87167C33E7), U64(0x7EF48F2B83024E20),
+ U64(0x11D505D4C351BD7F), U64(0x6568FCA92C76A243), U64(0x4DE0B0F40F32A7B8), U64(0x96D693460CC37E5D),
+ U64(0x42E240CB63689F2F), U64(0x6D2BDCDAE2919661), U64(0x42880B0236E4D951), U64(0x5F0F4A5898171BB6),
+ U64(0x39F890F579F92F88), U64(0x93C5B5F47356388B), U64(0x63DC359D8D231B78), U64(0xEC16CA8AEA98AD76),
+ U64(0x5355F900C2A82DC7), U64(0x07FB9F855A997142), U64(0x5093417AA8A7ED5E), U64(0x7BCBC38DA25A7F3C),
+ U64(0x19FC8A768CF4B6D4), U64(0x637A7780DECFC0D9), U64(0x8249A47AEE0E41F7), U64(0x79AD695501E7D1E8),
+ U64(0x14ACBAF4777D5776), U64(0xF145B6BECCDEA195), U64(0xDABF2AC8201752FC), U64(0x24C3C94DF9C8D3F6),
+ U64(0xBB6E2924F03912EA), U64(0x0CE26C0B95C980D9), U64(0xA49CD132BFBF7CC4), U64(0xE99D662AF4243939),
+ U64(0x27E6AD7891165C3F), U64(0x8535F040B9744FF1), U64(0x54B3F4FA5F40D873), U64(0x72B12C32127FED2B),
+ U64(0xEE954D3C7B411F47), U64(0x9A85AC909A24EAA1), U64(0x70AC4CD9F04F21F5), U64(0xF9B89D3E99A075C2),
+ U64(0x87B3E2B2B5C907B1), U64(0xA366E5B8C54F48B8), U64(0xAE4A9346CC3F7CF2), U64(0x1920C04D47267BBD),
+ U64(0x87BF02C6B49E2AE9), U64(0x092237AC237F3859), U64(0xFF07F64EF8ED14D0), U64(0x8DE8DCA9F03CC54E),
+ U64(0x9C1633264DB49C89), U64(0xB3F22C3D0B0B38ED), U64(0x390E5FB44D01144B), U64(0x5BFEA5B4712768E9),
+ U64(0x1E1032911FA78984), U64(0x9A74ACB964E78CB3), U64(0x4F80F7A035DAFB04), U64(0x6304D09A0B3738C4),
+ U64(0x2171E64683023A08), U64(0x5B9B63EB9CEFF80C), U64(0x506AACF489889342), U64(0x1881AFC9A3A701D6),
+ U64(0x6503080440750644), U64(0xDFD395339CDBF4A7), U64(0xEF927DBCF00C20F2), U64(0x7B32F7D1E03680EC),
+ U64(0xB9FD7620E7316243), U64(0x05A7E8A57DB91B77), U64(0xB5889C6E15630A75), U64(0x4A750A09CE9573F7),
+ U64(0xCF464CEC899A2F8A), U64(0xF538639CE705B824), U64(0x3C79A0FF5580EF7F), U64(0xEDE6C87F8477609D),
+ U64(0x799E81F05BC93F31), U64(0x86536B8CF3428A8C), U64(0x97D7374C60087B73), U64(0xA246637CFF328532),
+ U64(0x043FCAE60CC0EBA0), U64(0x920E449535DD359E), U64(0x70EB093B15B290CC), U64(0x73A1921916591CBD),
+ U64(0x56436C9FE1A1AA8D), U64(0xEFAC4B70633B8F81), U64(0xBB215798D45DF7AF), U64(0x45F20042F24F1768),
+ U64(0x930F80F4E8EB7462), U64(0xFF6712FFCFD75EA1), U64(0xAE623FD67468AA70), U64(0xDD2C5BC84BC8D8FC),
+ U64(0x7EED120D54CF2DD9), U64(0x22FE545401165F1C), U64(0xC91800E98FB99929), U64(0x808BD68E6AC10365),
+ U64(0xDEC468145B7605F6), U64(0x1BEDE3A3AEF53302), U64(0x43539603D6C55602), U64(0xAA969B5C691CCB7A),
+ U64(0xA87832D392EFEE56), U64(0x65942C7B3C7E11AE), U64(0xDED2D633CAD004F6), U64(0x21F08570F420E565),
+ U64(0xB415938D7DA94E3C), U64(0x91B859E59ECB6350), U64(0x10CFF333E0ED804A), U64(0x28AED140BE0BB7DD),
+ U64(0xC5CC1D89724FA456), U64(0x5648F680F11A2741), U64(0x2D255069F0B7DAB3), U64(0x9BC5A38EF729ABD4),
+ U64(0xEF2F054308F6A2BC), U64(0xAF2042F5CC5C2858), U64(0x480412BAB7F5BE2A), U64(0xAEF3AF4A563DFE43),
+ U64(0x19AFE59AE451497F), U64(0x52593803DFF1E840), U64(0xF4F076E65F2CE6F0), U64(0x11379625747D5AF3),
+ U64(0xBCE5D2248682C115), U64(0x9DA4243DE836994F), U64(0x066F70B33FE09017), U64(0x4DC4DE189B671A1C),
+ U64(0x51039AB7712457C3), U64(0xC07A3F80C31FB4B4), U64(0xB46EE9C5E64A6E7C), U64(0xB3819A42ABE61C87),
+ U64(0x21A007933A522A20), U64(0x2DF16F761598AA4F), U64(0x763C4A1371B368FD), U64(0xF793C46702E086A0),
+ U64(0xD7288E012AEB8D31), U64(0xDE336A2A4BC1C44B), U64(0x0BF692B38D079F23), U64(0x2C604A7A177326B3),
+ U64(0x4850E73E03EB6064), U64(0xCFC447F1E53C8E1B), U64(0xB05CA3F564268D99), U64(0x9AE182C8BC9474E8),
+ U64(0xA4FC4BD4FC5558CA), U64(0xE755178D58FC4E76), U64(0x69B97DB1A4C03DFE), U64(0xF9B5B7C4ACC67C96),
+ U64(0xFC6A82D64B8655FB), U64(0x9C684CB6C4D24417), U64(0x8EC97D2917456ED0), U64(0x6703DF9D2924E97E),
+ U64(0xC547F57E42A7444E), U64(0x78E37644E7CAD29E), U64(0xFE9A44E9362F05FA), U64(0x08BD35CC38336615),
+ U64(0x9315E5EB3A129ACE), U64(0x94061B871E04DF75), U64(0xDF1D9F9D784BA010), U64(0x3BBA57B68871B59D),
+ U64(0xD2B7ADEEDED1F73F), U64(0xF7A255D83BC373F8), U64(0xD7F4F2448C0CEB81), U64(0xD95BE88CD210FFA7),
+ U64(0x336F52F8FF4728E7), U64(0xA74049DAC312AC71), U64(0xA2F61BB6E437FDB5), U64(0x4F2A5CB07F6A35B3),
+ U64(0x87D380BDA5BF7859), U64(0x16B9F7E06C453A21), U64(0x7BA2484C8A0FD54E), U64(0xF3A678CAD9A2E38C),
+ U64(0x39B0BF7DDE437BA2), U64(0xFCAF55C1BF8A4424), U64(0x18FCF680573FA594), U64(0x4C0563B89F495AC3),
+ U64(0x40E087931A00930D), U64(0x8CFFA9412EB642C1), U64(0x68CA39053261169F), U64(0x7A1EE967D27579E2),
+ U64(0x9D1D60E5076F5B6F), U64(0x3810E399B6F65BA2), U64(0x32095B6D4AB5F9B1), U64(0x35CAB62109DD038A),
+ U64(0xA90B24499FCFAFB1), U64(0x77A225A07CC2C6BD), U64(0x513E5E634C70E331), U64(0x4361C0CA3F692F12),
+ U64(0xD941ACA44B20A45B), U64(0x528F7C8602C5807B), U64(0x52AB92BEB9613989), U64(0x9D1DFA2EFC557F73),
+ U64(0x722FF175F572C348), U64(0x1D1260A51107FE97), U64(0x7A249A57EC0C9BA2), U64(0x04208FE9E8F7F2D6),
+ U64(0x5A110C6058B920A0), U64(0x0CD9A497658A5698), U64(0x56FD23C8F9715A4C), U64(0x284C847B9D887AAE),
+ U64(0x04FEABFBBDB619CB), U64(0x742E1E651C60BA83), U64(0x9A9632E65904AD3C), U64(0x881B82A13B51B9E2),
+ U64(0x506E6744CD974924), U64(0xB0183DB56FFC6A79), U64(0x0ED9B915C66ED37E), U64(0x5E11E86D5873D484),
+ U64(0xF678647E3519AC6E), U64(0x1B85D488D0F20CC5), U64(0xDAB9FE6525D89021), U64(0x0D151D86ADB73615),
+ U64(0xA865A54EDCC0F019), U64(0x93C42566AEF98FFB), U64(0x99E7AFEABE000731), U64(0x48CBFF086DDF285A),
+ U64(0x7F9B6AF1EBF78BAF), U64(0x58627E1A149BBA21), U64(0x2CD16E2ABD791E33), U64(0xD363EFF5F0977996),
+ U64(0x0CE2A38C344A6EED), U64(0x1A804AADB9CFA741), U64(0x907F30421D78C5DE), U64(0x501F65EDB3034D07),
+ U64(0x37624AE5A48FA6E9), U64(0x957BAF61700CFF4E), U64(0x3A6C27934E31188A), U64(0xD49503536ABCA345),
+ U64(0x088E049589C432E0), U64(0xF943AEE7FEBF21B8), U64(0x6C3B8E3E336139D3), U64(0x364F6FFA464EE52E),
+ U64(0xD60F6DCEDC314222), U64(0x56963B0DCA418FC0), U64(0x16F50EDF91E513AF), U64(0xEF1955914B609F93),
+ U64(0x565601C0364E3228), U64(0xECB53939887E8175), U64(0xBAC7A9A18531294B), U64(0xB344C470397BBA52),
+ U64(0x65D34954DAF3CEBD), U64(0xB4B81B3FA97511E2), U64(0xB422061193D6F6A7), U64(0x071582401C38434D),
+ U64(0x7A13F18BBEDC4FF5), U64(0xBC4097B116C524D2), U64(0x59B97885E2F2EA28), U64(0x99170A5DC3115544),
+ U64(0x6F423357E7C6A9F9), U64(0x325928EE6E6F8794), U64(0xD0E4366228B03343), U64(0x565C31F7DE89EA27),
+ U64(0x30F5611484119414), U64(0xD873DB391292ED4F), U64(0x7BD94E1D8E17DEBC), U64(0xC7D9F16864A76E94),
+ U64(0x947AE053EE56E63C), U64(0xC8C93882F9475F5F), U64(0x3A9BF55BA91F81CA), U64(0xD9A11FBB3D9808E4),
+ U64(0x0FD22063EDC29FCA), U64(0xB3F256D8ACA0B0B9), U64(0xB03031A8B4516E84), U64(0x35DD37D5871448AF),
+ U64(0xE9F6082B05542E4E), U64(0xEBFAFA33D7254B59), U64(0x9255ABB50D532280), U64(0xB9AB4CE57F2D34F3),
+ U64(0x693501D628297551), U64(0xC62C58F97DD949BF), U64(0xCD454F8F19C5126A), U64(0xBBE83F4ECC2BDECB),
+ U64(0xDC842B7E2819E230), U64(0xBA89142E007503B8), U64(0xA3BC941D0A5061CB), U64(0xE9F6760E32CD8021),
+ U64(0x09C7E552BC76492F), U64(0x852F54934DA55CC9), U64(0x8107FCCF064FCF56), U64(0x098954D51FFF6580),
+ U64(0x23B70EDB1955C4BF), U64(0xC330DE426430F69D), U64(0x4715ED43E8A45C0A), U64(0xA8D7E4DAB780A08D),
+ U64(0x0572B974F03CE0BB), U64(0xB57D2E985E1419C7), U64(0xE8D9ECBE2CF3D73F), U64(0x2FE4B17170E59750),
+ U64(0x11317BA87905E790), U64(0x7FBF21EC8A1F45EC), U64(0x1725CABFCB045B00), U64(0x964E915CD5E2B207),
+ U64(0x3E2B8BCBF016D66D), U64(0xBE7444E39328A0AC), U64(0xF85B2B4FBCDE44B7), U64(0x49353FEA39BA63B1),
+ U64(0x1DD01AAFCD53486A), U64(0x1FCA8A92FD719F85), U64(0xFC7C95D827357AFA), U64(0x18A6A990C8B35EBD),
+ U64(0xCCCB7005C6B9C28D), U64(0x3BDBB92C43B17F26), U64(0xAA70B5B4F89695A2), U64(0xE94C39A54A98307F),
+ U64(0xB7A0B174CFF6F36E), U64(0xD4DBA84729AF48AD), U64(0x2E18BC1AD9704A68), U64(0x2DE0966DAF2F8B1C),
+ U64(0xB9C11D5B1E43A07E), U64(0x64972D68DEE33360), U64(0x94628D38D0C20584), U64(0xDBC0D2B6AB90A559),
+ U64(0xD2733C4335C6A72F), U64(0x7E75D99D94A70F4D), U64(0x6CED1983376FA72B), U64(0x97FCAACBF030BC24),
+ U64(0x7B77497B32503B12), U64(0x8547EDDFB81CCB94), U64(0x79999CDFF70902CB), U64(0xCFFE1939438E9B24),
+ U64(0x829626E3892D95D7), U64(0x92FAE24291F2B3F1), U64(0x63E22C147B9C3403), U64(0xC678B6D860284A1C),
+ U64(0x5873888850659AE7), U64(0x0981DCD296A8736D), U64(0x9F65789A6509A440), U64(0x9FF38FED72E9052F),
+ U64(0xE479EE5B9930578C), U64(0xE7F28ECD2D49EECD), U64(0x56C074A581EA17FE), U64(0x5544F7D774B14AEF),
+ U64(0x7B3F0195FC6F290F), U64(0x12153635B2C0CF57), U64(0x7F5126DBBA5E0CA7), U64(0x7A76956C3EAFB413),
+ U64(0x3D5774A11D31AB39), U64(0x8A1B083821F40CB4), U64(0x7B4A38E32537DF62), U64(0x950113646D1D6E03),
+ U64(0x4DA8979A0041E8A9), U64(0x3BC36E078F7515D7), U64(0x5D0A12F27AD310D1), U64(0x7F9D1A2E1EBE1327),
+ U64(0xDA3A361B1C5157B1), U64(0xDCDD7D20903D0C25), U64(0x36833336D068F707), U64(0xCE68341F79893389),
+ U64(0xAB9090168DD05F34), U64(0x43954B3252DC25E5), U64(0xB438C2B67F98E5E9), U64(0x10DCD78E3851A492),
+ U64(0xDBC27AB5447822BF), U64(0x9B3CDB65F82CA382), U64(0xB67B7896167B4C84), U64(0xBFCED1B0048EAC50),
+ U64(0xA9119B60369FFEBD), U64(0x1FFF7AC80904BF45), U64(0xAC12FB171817EEE7), U64(0xAF08DA9177DDA93D),
+ U64(0x1B0CAB936E65C744), U64(0xB559EB1D04E5E932), U64(0xC37B45B3F8D6F2BA), U64(0xC3A9DC228CAAC9E9),
+ U64(0xF3B8B6675A6507FF), U64(0x9FC477DE4ED681DA), U64(0x67378D8ECCEF96CB), U64(0x6DD856D94D259236),
+ U64(0xA319CE15B0B4DB31), U64(0x073973751F12DD5E), U64(0x8A8E849EB32781A5), U64(0xE1925C71285279F5),
+ U64(0x74C04BF1790C0EFE), U64(0x4DDA48153C94938A), U64(0x9D266D6A1CC0542C), U64(0x7440FB816508C4FE),
+ U64(0x13328503DF48229F), U64(0xD6BF7BAEE43CAC40), U64(0x4838D65F6EF6748F), U64(0x1E152328F3318DEA),
+ U64(0x8F8419A348F296BF), U64(0x72C8834A5957B511), U64(0xD7A023A73260B45C), U64(0x94EBC8ABCFB56DAE),
+ U64(0x9FC10D0F989993E0), U64(0xDE68A2355B93CAE6), U64(0xA44CFE79AE538BBE), U64(0x9D1D84FCCE371425),
+ U64(0x51D2B1AB2DDFB636), U64(0x2FD7E4B9E72CD38C), U64(0x65CA5B96B7552210), U64(0xDD69A0D8AB3B546D),
+ U64(0x604D51B25FBF70E2), U64(0x73AA8A564FB7AC9E), U64(0x1A8C1E992B941148), U64(0xAAC40A2703D9BEA0),
+ U64(0x764DBEAE7FA4F3A6), U64(0x1E99B96E70A9BE8B), U64(0x2C5E9DEB57EF4743), U64(0x3A938FEE32D29981),
+ U64(0x26E6DB8FFDF5ADFE), U64(0x469356C504EC9F9D), U64(0xC8763C5B08D1908C), U64(0x3F6C6AF859D80055),
+ U64(0x7F7CC39420A3A545), U64(0x9BFB227EBDF4C5CE), U64(0x89039D79D6FC5C5C), U64(0x8FE88B57305E2AB6),
+ U64(0xA09E8C8C35AB96DE), U64(0xFA7E393983325753), U64(0xD6B6D0ECC617C699), U64(0xDFEA21EA9E7557E3),
+ U64(0xB67C1FA481680AF8), U64(0xCA1E3785A9E724E5), U64(0x1CFC8BED0D681639), U64(0xD18D8549D140CAEA),
+ U64(0x4ED0FE7E9DC91335), U64(0xE4DBF0634473F5D2), U64(0x1761F93A44D5AEFE), U64(0x53898E4C3910DA55),
+ U64(0x734DE8181F6EC39A), U64(0x2680B122BAA28D97), U64(0x298AF231C85BAFAB), U64(0x7983EED3740847D5),
+ U64(0x66C1A2A1A60CD889), U64(0x9E17E49642A3E4C1), U64(0xEDB454E7BADC0805), U64(0x50B704CAB602C329),
+ U64(0x4CC317FB9CDDD023), U64(0x66B4835D9EAFEA22), U64(0x219B97E26FFC81BD), U64(0x261E4E4C0A333A9D),
+ U64(0x1FE2CCA76517DB90), U64(0xD7504DFA8816EDBB), U64(0xB9571FA04DC089C8), U64(0x1DDC0325259B27DE),
+ U64(0xCF3F4688801EB9AA), U64(0xF4F5D05C10CAB243), U64(0x38B6525C21A42B0E), U64(0x36F60E2BA4FA6800),
+ U64(0xEB3593803173E0CE), U64(0x9C4CD6257C5A3603), U64(0xAF0C317D32ADAA8A), U64(0x258E5A80C7204C4B),
+ U64(0x8B889D624D44885D), U64(0xF4D14597E660F855), U64(0xD4347F66EC8941C3), U64(0xE699ED85B0DFB40D),
+ U64(0x2472F6207C2D0484), U64(0xC2A1E7B5B459AEB5), U64(0xAB4F6451CC1D45EC), U64(0x63767572AE3D6174),
+ U64(0xA59E0BD101731A28), U64(0x116D0016CB948F09), U64(0x2CF9C8CA052F6E9F), U64(0x0B090A7560A968E3),
+ U64(0xABEEDDB2DDE06FF1), U64(0x58EFC10B06A2068D), U64(0xC6E57A78FBD986E0), U64(0x2EAB8CA63CE802D7),
+ U64(0x14A195640116F336), U64(0x7C0828DD624EC390), U64(0xD74BBE77E6116AC7), U64(0x804456AF10F5FB53),
+ U64(0xEBE9EA2ADF4321C7), U64(0x03219A39EE587A30), U64(0x49787FEF17AF9924), U64(0xA1E9300CD8520548),
+ U64(0x5B45E522E4B1B4EF), U64(0xB49C3B3995091A36), U64(0xD4490AD526F14431), U64(0x12A8F216AF9418C2),
+ U64(0x001F837CC7350524), U64(0x1877B51E57A764D5), U64(0xA2853B80F17F58EE), U64(0x993E1DE72D36D310),
+ U64(0xB3598080CE64A656), U64(0x252F59CF0D9F04BB), U64(0xD23C8E176D113600), U64(0x1BDA0492E7E4586E),
+ U64(0x21E0BD5026C619BF), U64(0x3B097ADAF088F94E), U64(0x8D14DEDB30BE846E), U64(0xF95CFFA23AF5F6F4),
+ U64(0x3871700761B3F743), U64(0xCA672B91E9E4FA16), U64(0x64C8E531BFF53B55), U64(0x241260ED4AD1E87D),
+ U64(0x106C09B972D2E822), U64(0x7FBA195410E5CA30), U64(0x7884D9BC6CB569D8), U64(0x0647DFEDCD894A29),
+ U64(0x63573FF03E224774), U64(0x4FC8E9560F91B123), U64(0x1DB956E450275779), U64(0xB8D91274B9E9D4FB),
+ U64(0xA2EBEE47E2FBFCE1), U64(0xD9F1F30CCD97FB09), U64(0xEFED53D75FD64E6B), U64(0x2E6D02C36017F67F),
+ U64(0xA9AA4D20DB084E9B), U64(0xB64BE8D8B25396C1), U64(0x70CB6AF7C2D5BCF0), U64(0x98F076A4F7A2322E),
+ U64(0xBF84470805E69B5F), U64(0x94C3251F06F90CF3), U64(0x3E003E616A6591E9), U64(0xB925A6CD0421AFF3),
+ U64(0x61BDD1307C66E300), U64(0xBF8D5108E27E0D48), U64(0x240AB57A8B888B20), U64(0xFC87614BAF287E07),
+ U64(0xEF02CDD06FFDB432), U64(0xA1082C0466DF6C0A), U64(0x8215E577001332C8), U64(0xD39BB9C3A48DB6CF),
+ U64(0x2738259634305C14), U64(0x61CF4F94C97DF93D), U64(0x1B6BACA2AE4E125B), U64(0x758F450C88572E0B),
+ U64(0x959F587D507A8359), U64(0xB063E962E045F54D), U64(0x60E8ED72C0DFF5D1), U64(0x7B64978555326F9F),
+ U64(0xFD080D236DA814BA), U64(0x8C90FD9B083F4558), U64(0x106F72FE81E2C590), U64(0x7976033A39F7D952),
+ U64(0xA4EC0132764CA04B), U64(0x733EA705FAE4FA77), U64(0xB4D8F77BC3E56167), U64(0x9E21F4F903B33FD9),
+ U64(0x9D765E419FB69F6D), U64(0xD30C088BA61EA5EF), U64(0x5D94337FBFAF7F5B), U64(0x1A4E4822EB4D7A59),
+ U64(0x6FFE73E81B637FB3), U64(0xDDF957BC36D8B9CA), U64(0x64D0E29EEA8838B3), U64(0x08DD9BDFD96B9F63),
+ U64(0x087E79E5A57D1D13), U64(0xE328E230E3E2B3FB), U64(0x1C2559E30F0946BE), U64(0x720BF5F26F4D2EAA),
+ U64(0xB0774D261CC609DB), U64(0x443F64EC5A371195), U64(0x4112CF68649A260E), U64(0xD813F2FAB7F5C5CA),
+ U64(0x660D3257380841EE), U64(0x59AC2C7873F910A3), U64(0xE846963877671A17), U64(0x93B633ABFA3469F8),
+ U64(0xC0C0F5A60EF4CDCF), U64(0xCAF21ECD4377B28C), U64(0x57277707199B8175), U64(0x506C11B9D90E8B1D),
+ U64(0xD83CC2687A19255F), U64(0x4A29C6465A314CD1), U64(0xED2DF21216235097), U64(0xB5635C95FF7296E2),
+ U64(0x22AF003AB672E811), U64(0x52E762596BF68235), U64(0x9AEBA33AC6ECC6B0), U64(0x944F6DE09134DFB6),
+ U64(0x6C47BEC883A7DE39), U64(0x6AD047C430A12104), U64(0xA5B1CFDBA0AB4067), U64(0x7C45D833AFF07862),
+ U64(0x5092EF950A16DA0B), U64(0x9338E69C052B8E7B), U64(0x455A4B4CFE30E3F5), U64(0x6B02E63195AD0CF8),
+ U64(0x6B17B224BAD6BF27), U64(0xD1E0CCD25BB9C169), U64(0xDE0C89A556B9AE70), U64(0x50065E535A213CF6),
+ U64(0x9C1169FA2777B874), U64(0x78EDEFD694AF1EED), U64(0x6DC93D9526A50E68), U64(0xEE97F453F06791ED),
+ U64(0x32AB0EDB696703D3), U64(0x3A6853C7E70757A7), U64(0x31865CED6120F37D), U64(0x67FEF95D92607890),
+ U64(0x1F2B1D1F15F6DC9C), U64(0xB69E38A8965C6B65), U64(0xAA9119FF184CCCF4), U64(0xF43C732873F24C13),
+ U64(0xFB4A3D794A9A80D2), U64(0x3550C2321FD6109C), U64(0x371F77E76BB8417E), U64(0x6BFA9AAE5EC05779),
+ U64(0xCD04F3FF001A4778), U64(0xE3273522064480CA), U64(0x9F91508BFFCFC14A), U64(0x049A7F41061A9E60),
+ U64(0xFCB6BE43A9F2FE9B), U64(0x08DE8A1C7797DA9B), U64(0x8F9887E6078735A1), U64(0xB5B4071DBFC73A66),
+ U64(0x230E343DFBA08D33), U64(0x43ED7F5A0FAE657D), U64(0x3A88A0FBBCB05C63), U64(0x21874B8B4D2DBC4F),
+ U64(0x1BDEA12E35F6A8C9), U64(0x53C065C6C8E63528), U64(0xE34A1D250E7A8D6B), U64(0xD6B04D3B7651DD7E),
+ U64(0x5E90277E7CB39E2D), U64(0x2C046F22062DC67D), U64(0xB10BB459132D0A26), U64(0x3FA9DDFB67E2F199),
+ U64(0x0E09B88E1914F7AF), U64(0x10E8B35AF3EEAB37), U64(0x9EEDECA8E272B933), U64(0xD4C718BC4AE8AE5F),
+ U64(0x81536D601170FC20), U64(0x91B534F885818A06), U64(0xEC8177F83F900978), U64(0x190E714FADA5156E),
+ U64(0xB592BF39B0364963), U64(0x89C350C893AE7DC1), U64(0xAC042E70F8B383F2), U64(0xB49B52E587A1EE60),
+ U64(0xFB152FE3FF26DA89), U64(0x3E666E6F69AE2C15), U64(0x3B544EBE544C19F9), U64(0xE805A1E290CF2456),
+ U64(0x24B33C9D7ED25117), U64(0xE74733427B72F0C1), U64(0x0A804D18B7097475), U64(0x57E3306D881EDB4F),
+ U64(0x4AE7D6A36EB5DBCB), U64(0x2D8D5432157064C8), U64(0xD1E649DE1E7F268B), U64(0x8A328A1CEDFE552C),
+ U64(0x07A3AEC79624C7DA), U64(0x84547DDC3E203C94), U64(0x990A98FD5071D263), U64(0x1A4FF12616EEFC89),
+ U64(0xF6F7FD1431714200), U64(0x30C05B1BA332F41C), U64(0x8D2636B81555A786), U64(0x46C9FEB55D120902),
+ U64(0xCCEC0A73B49C9921), U64(0x4E9D2827355FC492), U64(0x19EBB029435DCB0F), U64(0x4659D2B743848A2C),
+ U64(0x963EF2C96B33BE31), U64(0x74F85198B05A2E7D), U64(0x5A0F544DD2B1FB18), U64(0x03727073C2E134B1),
+ U64(0xC7F6AA2DE59AEA61), U64(0x352787BAA0D7C22F), U64(0x9853EAB63B5E0B35), U64(0xABBDCDD7ED5C0860),
+ U64(0xCF05DAF5AC8D77B0), U64(0x49CAD48CEBF4A71E), U64(0x7A4C10EC2158C4A6), U64(0xD9E92AA246BF719E),
+ U64(0x13AE978D09FE5557), U64(0x730499AF921549FF), U64(0x4E4B705B92903BA4), U64(0xFF577222C14F0A3A),
+ U64(0x55B6344CF97AAFAE), U64(0xB862225B055B6960), U64(0xCAC09AFBDDD2CDB4), U64(0xDAF8E9829FE96B5F),
+ U64(0xB5FDFC5D3132C498), U64(0x310CB380DB6F7503), U64(0xE87FBB46217A360E), U64(0x2102AE466EBB1148),
+ U64(0xF8549E1A3AA5E00D), U64(0x07A69AFDCC42261A), U64(0xC4C118BFE78FEAAE), U64(0xF9F4892ED96BD438),
+ U64(0x1AF3DBE25D8F45DA), U64(0xF5B4B0B0D2DEEEB4), U64(0x962ACEEFA82E1C84), U64(0x046E3ECAAF453CE9),
+ U64(0xF05D129681949A4C), U64(0x964781CE734B3C84), U64(0x9C2ED44081CE5FBD), U64(0x522E23F3925E319E),
+ U64(0x177E00F9FC32F791), U64(0x2BC60A63A6F3B3F2), U64(0x222BBFAE61725606), U64(0x486289DDCC3D6780),
+ U64(0x7DC7785B8EFDFC80), U64(0x8AF38731C02BA980), U64(0x1FAB64EA29A2DDF7), U64(0xE4D9429322CD065A),
+ U64(0x9DA058C67844F20C), U64(0x24C0E332B70019B0), U64(0x233003B5A6CFE6AD), U64(0xD586BD01C5C217F6),
+ U64(0x5E5637885F29BC2B), U64(0x7EBA726D8C94094B), U64(0x0A56A5F0BFE39272), U64(0xD79476A84EE20D06),
+ U64(0x9E4C1269BAA4BF37), U64(0x17EFEE45B0DEE640), U64(0x1D95B0A5FCF90BC6), U64(0x93CBE0B699C2585D),
+ U64(0x65FA4F227A2B6D79), U64(0xD5F9E858292504D5), U64(0xC2B5A03F71471A6F), U64(0x59300222B4561E00),
+ U64(0xCE2F8642CA0712DC), U64(0x7CA9723FBB2E8988), U64(0x2785338347F2BA08), U64(0xC61BB3A141E50E8C),
+ U64(0x150F361DAB9DEC26), U64(0x9F6A419D382595F4), U64(0x64A53DC924FE7AC9), U64(0x142DE49FFF7A7C3D),
+ U64(0x0C335248857FA9E7), U64(0x0A9C32D5EAE45305), U64(0xE6C42178C4BBB92E), U64(0x71F1CE2490D20B07),
+ U64(0xF1BCC3D275AFE51A), U64(0xE728E8C83C334074), U64(0x96FBF83A12884624), U64(0x81A1549FD6573DA5),
+ U64(0x5FA7867CAF35E149), U64(0x56986E2EF3ED091B), U64(0x917F1DD5F8886C61), U64(0xD20D8C88C8FFE65F),
+ U64(0x31D71DCE64B2C310), U64(0xF165B587DF898190), U64(0xA57E6339DD2CF3A0), U64(0x1EF6E6DBB1961EC9),
+ U64(0x70CC73D90BC26E24), U64(0xE21A6B35DF0C3AD7), U64(0x003A93D8B2806962), U64(0x1C99DED33CB890A1),
+ U64(0xCF3145DE0ADD4289), U64(0xD0E4427A5514FB72), U64(0x77C621CC9FB3A483), U64(0x67A34DAC4356550B),
+ U64(0xF8D626AAAF278509),
+};
+
+// functions
+
+// random_init()
+
+void random_init() {
+
+ if ((Random64[RandomNb-1] >> 32) != 0xF8D626AA) { // upper half of the last element of the array
+ my_fatal("random_init(): broken 64-bit types\n");
+ }
+}
+
+// random_64()
+
+uint64 random_64(int n) {
+
+ ASSERT(n>=0&&n<RandomNb);
+
+ return Random64[n];
+}
+
+// end of random.cpp
+
-\r
-// random.h\r
-\r
-#ifndef RANDOM_H\r
-#define RANDOM_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define RandomNb 781\r
-\r
-// macros\r
-\r
-#define RANDOM_64(n) (Random64[(n)])\r
-\r
-// "constants"\r
-\r
-extern const uint64 Random64[RandomNb];\r
-\r
-// functions\r
-\r
-extern void random_init ();\r
-extern uint64 random_64 (int n);\r
-\r
-#endif // !defined RANDOM_H\r
-\r
-// end of random.h\r
-\r
+
+// random.h
+
+#ifndef RANDOM_H
+#define RANDOM_H
+
+// includes
+
+#include "util.h"
+
+// defines
+
+#define RandomNb 781
+
+// macros
+
+#define RANDOM_64(n) (Random64[(n)])
+
+// "constants"
+
+extern const uint64 Random64[RandomNb];
+
+// functions
+
+extern void random_init ();
+extern uint64 random_64 (int n);
+
+#endif // !defined RANDOM_H
+
+// end of random.h
+
-\r
-// san.c\r
-\r
-// includes\r
-\r
-#include <ctype.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "attack.h"\r
-#include "board.h"\r
-#include "list.h"\r
-#include "move.h"\r
-#include "move_gen.h"\r
-#include "move_legal.h"\r
-#include "piece.h"\r
-#include "san.h"\r
-#include "square.h"\r
-#include "util.h"\r
-\r
-// constants\r
-\r
-static const bool UseSlowDebug = FALSE;\r
-\r
-enum ambiguity_t {\r
- AMBIGUITY_NONE,\r
- AMBIGUITY_FILE,\r
- AMBIGUITY_RANK,\r
- AMBIGUITY_SQUARE\r
-};\r
-\r
-// functions\r
-\r
-static bool san_to_lan (const char san[], const board_t * board, char string[], int size);\r
-static int move_from_lan (const char string[], const board_t * board);\r
-\r
-static int ambiguity (int move, const board_t * board);\r
-\r
-// move_to_san()\r
-\r
-bool move_to_san(int move, const board_t * board, char string[], int size) {\r
-\r
- int from, to, piece;\r
- char tmp_string[256];\r
-\r
- ASSERT(move_is_ok(move));\r
- ASSERT(board_is_ok(board));\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=8);\r
-\r
- ASSERT(move_is_legal(move,board));\r
-\r
- if (size < 8) return FALSE;\r
-\r
- // init\r
-\r
- from = move_from(move);\r
- to = move_to(move);\r
-\r
- string[0] = '\0';\r
-\r
- // castle\r
-\r
- if (move_is_castle(move,board)) {\r
-\r
- if (to > from) {\r
- strcat(string,"O-O");\r
- } else {\r
- strcat(string,"O-O-O");\r
- }\r
-\r
- goto check;\r
- }\r
-\r
- // from\r
-\r
- piece = board->square[from];\r
-\r
- if (piece_is_pawn(piece)) {\r
-\r
- // pawn\r
-\r
- if (move_is_capture(move,board)) {\r
- sprintf(tmp_string,"%c",file_to_char(square_file(from)));\r
- strcat(string,tmp_string);\r
- }\r
-\r
- } else {\r
-\r
- // piece\r
-\r
- sprintf(tmp_string,"%c",toupper(piece_to_char(piece)));\r
- strcat(string,tmp_string);\r
-\r
- // ambiguity\r
-\r
- switch (ambiguity(move,board)) {\r
- case AMBIGUITY_NONE:\r
- break;\r
- case AMBIGUITY_FILE:\r
- sprintf(tmp_string,"%c",file_to_char(square_file(from)));\r
- strcat(string,tmp_string);\r
- break;\r
- case AMBIGUITY_RANK:\r
- sprintf(tmp_string,"%c",rank_to_char(square_rank(from)));\r
- strcat(string,tmp_string);\r
- break;\r
- case AMBIGUITY_SQUARE:\r
- if (!square_to_string(from,tmp_string,256)) return FALSE;\r
- strcat(string,tmp_string);\r
- break;\r
- default:\r
- ASSERT(FALSE);\r
- break;\r
- }\r
- }\r
-\r
- // capture\r
-\r
- if (move_is_capture(move,board)) strcat(string,"x");\r
-\r
- // to\r
-\r
- if (!square_to_string(to,tmp_string,256)) return FALSE;\r
- strcat(string,tmp_string);\r
-\r
- // promote\r
-\r
- if (move_is_promote(move)) {\r
- sprintf(tmp_string,"=%c",toupper(piece_to_char(move_promote(move,board))));\r
- strcat(string,tmp_string);\r
- }\r
-\r
- // check\r
-\r
-check:\r
-\r
- if (move_is_mate(move,board)) {\r
- strcat(string,"#");\r
- } else if (move_is_check(move,board)) {\r
- strcat(string,"+");\r
- }\r
-\r
- return TRUE;\r
-}\r
-\r
-// move_from_san()\r
-\r
-int move_from_san(const char string[], const board_t * board) {\r
-\r
- char s[256];\r
- int move;\r
-\r
- ASSERT(string!=NULL);\r
- ASSERT(board_is_ok(board));\r
-\r
- san_to_lan(string,board,s,256);\r
- move = move_from_lan(s,board);\r
-\r
- ASSERT(!UseSlowDebug||move==move_from_san_debug(string,board));\r
-\r
- return move;\r
-}\r
-\r
-// move_from_san_debug()\r
-\r
-int move_from_san_debug(const char string[], const board_t * board) {\r
-\r
- list_t list[1];\r
- int i, move;\r
- char move_string[256];\r
-\r
- ASSERT(string!=NULL);\r
- ASSERT(board_is_ok(board));\r
-\r
- gen_legal_moves(list,board);\r
-\r
- for (i = 0; i < list_size(list); i++) {\r
- move = list_move(list,i);\r
- if (!move_to_san(move,board,move_string,256)) ASSERT(FALSE);\r
- if (my_string_equal(move_string,string)) return move;\r
- }\r
-\r
- return MoveNone;\r
-}\r
-\r
-// san_to_lan()\r
-\r
-static bool san_to_lan(const char san[], const board_t * board, char string[], int size) {\r
-\r
- int len;\r
- int left, right;\r
- int c;\r
- int king, rook;\r
- char king_string[3], rook_string[3];\r
-\r
- ASSERT(san!=NULL);\r
- ASSERT(board_is_ok(board));\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=8);\r
-\r
- // init\r
-\r
- if (size < 8) return FALSE;\r
- strcpy(string,"???????");\r
-\r
- len = strlen(san);\r
-\r
- left = 0;\r
- right = len;\r
-\r
- // skip trailing '+' or '#'\r
-\r
- if (left < right) {\r
- c = san[right-1];\r
- if (c == '+' || c == '#') right--;\r
- }\r
-\r
- // castling\r
-\r
- ASSERT(left==0);\r
-\r
- if (FALSE) {\r
-\r
- } else if (right == 3 && strncmp(san,"O-O",3) == 0) {\r
-\r
- if (board->castle[board->turn][SideH] == SquareNone) return FALSE;\r
-\r
- king = king_pos(board,board->turn);\r
- rook = board->castle[board->turn][SideH];\r
-\r
- square_to_string(king,king_string,3);\r
- square_to_string(rook,rook_string,3);\r
-\r
- sprintf(string,"K%s?%s?",king_string,rook_string);\r
-\r
- } else if (right == 5 && strncmp(san,"O-O-O",5) == 0) {\r
-\r
- if (board->castle[board->turn][SideA] == SquareNone) return FALSE;\r
-\r
- king = king_pos(board,board->turn);\r
- rook = board->castle[board->turn][SideA];\r
-\r
- square_to_string(king,king_string,3);\r
- square_to_string(rook,rook_string,3);\r
-\r
- sprintf(string,"K%s?%s?",king_string,rook_string);\r
-\r
- } else {\r
-\r
- // moved piece\r
-\r
- if (left < right) {\r
-\r
- c = san[left];\r
-\r
- if (char_is_piece(c)) {\r
- string[0] = c;\r
- left++;\r
- }\r
- }\r
-\r
- // promotion\r
-\r
- if (left < right) {\r
-\r
- c = toupper(san[right-1]);\r
-\r
- if (char_is_piece(c)) {\r
-\r
- string[6] = c;\r
- right--;\r
-\r
- // skip '='\r
-\r
- if (left < right && san[right-1] == '=') right--;\r
- }\r
- }\r
-\r
- // to-square rank\r
-\r
- if (left < right) {\r
-\r
- c = san[right-1];\r
-\r
- if (char_is_rank(c)) {\r
- string[5] = c;\r
- right--;\r
- }\r
- }\r
-\r
- // to-square file\r
-\r
- if (left < right) {\r
-\r
- c = san[right-1];\r
-\r
- if (char_is_file(c)) {\r
- string[4] = c;\r
- right--;\r
- }\r
- }\r
-\r
- // captured piece\r
-\r
- if (left < right) {\r
-\r
- c = san[right-1];\r
-\r
- if (char_is_piece(c)) {\r
- string[3] = c;\r
- right--;\r
- }\r
- }\r
-\r
- // skip middle '-' or 'x'\r
-\r
- if (left < right) {\r
- c = san[right-1];\r
- if (c == '-' || c == 'x') right--;\r
- }\r
-\r
- // from-square file\r
-\r
- if (left < right) {\r
-\r
- c = san[left];\r
-\r
- if (char_is_file(c)) {\r
- string[1] = c;\r
- left++;\r
- }\r
- }\r
-\r
- // from-square rank\r
-\r
- if (left < right) {\r
-\r
- c = san[left];\r
-\r
- if (char_is_rank(c)) {\r
- string[2] = c;\r
- left++;\r
- }\r
- }\r
-\r
- if (left != right) return FALSE;\r
- }\r
-\r
- // end\r
-\r
- return TRUE;\r
-}\r
-\r
-// move_from_lan()\r
-\r
-static int move_from_lan(const char string[], const board_t * board) {\r
-\r
- int len;\r
- int move;\r
- int promote;\r
- char s[256];\r
- int from, to;\r
- int colour;\r
- int inc;\r
- int piece_char;\r
- int n;\r
- const uint8 * ptr;\r
- int piece;\r
- int side;\r
-\r
- ASSERT(string!=NULL);\r
- ASSERT(board_is_ok(board));\r
-\r
- // init\r
-\r
- len = strlen(string);\r
- if (len != 7) return MoveNone;\r
-\r
- move = MoveNone;\r
- colour = board->turn;\r
-\r
- // promote\r
-\r
- promote = 0;\r
-\r
- switch (string[6]) {\r
- case '?': // not a promotion\r
- break;\r
- case 'N':\r
- promote = MovePromoteKnight;\r
- break;\r
- case 'B':\r
- promote = MovePromoteBishop;\r
- break;\r
- case 'R':\r
- promote = MovePromoteRook;\r
- break;\r
- case 'Q':\r
- promote = MovePromoteQueen;\r
- break;\r
- default:\r
- return MoveNone;\r
- break;\r
- }\r
-\r
- // to square\r
-\r
- s[0] = string[4];\r
- s[1] = string[5];\r
- s[2] = '\0';\r
-\r
- to = square_from_string(s);\r
- if (to == SquareNone) return MoveNone;\r
-\r
- // known from square?\r
-\r
- if (string[1] != '?' && string[2] != '?') {\r
-\r
- // from square\r
-\r
- s[0] = string[1];\r
- s[1] = string[2];\r
- s[2] = '\0';\r
-\r
- from = square_from_string(s);\r
- if (from == SquareNone) return MoveNone;\r
-\r
- // convert "king slide" castling to KxR\r
-\r
- if (piece_is_king(board->square[from])\r
- && square_rank(to) == square_rank(from)\r
- && abs(to-from) > 1) {\r
- side = (to > from) ? SideH : SideA;\r
- to = board->castle[colour][side];\r
- if (to == SquareNone) return MoveNone;\r
- }\r
-\r
- // move\r
-\r
- move = move_make(from,to) | promote;\r
-\r
- return move;\r
- }\r
-\r
- // pawn non-capture?\r
-\r
- if (string[0] == '?' && string[1] == '?') {\r
-\r
- if (board->square[to] != Empty) return MoveNone; // useful?\r
-\r
- inc = (colour_is_white(colour)) ? +16 : -16;\r
-\r
- from = to - inc;\r
- if (board->square[from] == Empty && square_side_rank(to,colour) == Rank4) {\r
- from -= inc;\r
- }\r
-\r
- if (board->square[from] != piece_make_pawn(colour)) { // useful?\r
- return MoveNone;\r
- }\r
-\r
- // move\r
-\r
- move = move_make(from,to) | promote;\r
-\r
- return move;\r
- }\r
-\r
- // pawn capture?\r
-\r
- piece_char = string[0];\r
-\r
- if (piece_char == '?' && string[1] != '?') {\r
- piece_char = 'P';\r
- }\r
-\r
- // attack loop\r
-\r
- n = 0;\r
-\r
- for (ptr = board->list[colour]; (from=*ptr) != SquareNone; ptr++) {\r
-\r
- piece = board->square[from];\r
-\r
- if (toupper(piece_to_char(piece)) == piece_char) {\r
- if (piece_attack(board,piece,from,to)) {\r
- if (TRUE\r
- && (string[1] == '?' || file_to_char(square_file(from)) == string[1])\r
- && (string[2] == '?' || rank_to_char(square_rank(from)) == string[2])) {\r
- if (!is_pinned(board,from,to,colour)) {\r
- move = move_make(from,to) | promote;\r
- n++;\r
- }\r
- }\r
- }\r
- }\r
- }\r
-\r
- if (n != 1) move = MoveNone;\r
-\r
- return move;\r
-}\r
-\r
-// ambiguity()\r
-\r
-static int ambiguity(int move, const board_t * board) {\r
-\r
- int from, to, piece;\r
- list_t list[1];\r
- int i, n, m;\r
-\r
- // init\r
-\r
- from = move_from(move);\r
- to = move_to(move);\r
- piece = move_piece(move,board);\r
-\r
- gen_legal_moves(list,board);\r
-\r
- // no ambiguity?\r
-\r
- n = 0;\r
-\r
- for (i = 0; i < list_size(list); i++) {\r
- m = list_move(list,i);\r
- if (move_piece(m,board) == piece && move_to(m) == to) {\r
- n++;\r
- }\r
- }\r
-\r
- if (n == 1) return AMBIGUITY_NONE;\r
-\r
- // file ambiguity?\r
-\r
- n = 0;\r
-\r
- for (i = 0; i < list_size(list); i++) {\r
- m = list_move(list,i);\r
- if (move_piece(m,board) == piece && move_to(m) == to) {\r
- if (square_file(move_from(m)) == square_file(from)) n++;\r
- }\r
- }\r
-\r
- if (n == 1) return AMBIGUITY_FILE;\r
-\r
- // rank ambiguity?\r
-\r
- n = 0;\r
-\r
- for (i = 0; i < list_size(list); i++) {\r
- m = list_move(list,i);\r
- if (move_piece(m,board) == piece && move_to(m) == to) {\r
- if (square_rank(move_from(m)) == square_rank(from)) n++;\r
- }\r
- }\r
-\r
- if (n == 1) return AMBIGUITY_RANK;\r
-\r
- // square ambiguity\r
-\r
- return AMBIGUITY_SQUARE;\r
-}\r
-\r
-// end of san.cpp\r
-\r
+
+// san.c
+
+// includes
+
+#include <ctype.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "attack.h"
+#include "board.h"
+#include "list.h"
+#include "move.h"
+#include "move_gen.h"
+#include "move_legal.h"
+#include "piece.h"
+#include "san.h"
+#include "square.h"
+#include "util.h"
+
+// constants
+
+static const bool UseSlowDebug = FALSE;
+
+enum ambiguity_t {
+ AMBIGUITY_NONE,
+ AMBIGUITY_FILE,
+ AMBIGUITY_RANK,
+ AMBIGUITY_SQUARE
+};
+
+// functions
+
+static bool san_to_lan (const char san[], const board_t * board, char string[], int size);
+static int move_from_lan (const char string[], const board_t * board);
+
+static int ambiguity (int move, const board_t * board);
+
+// move_to_san()
+
+bool move_to_san(int move, const board_t * board, char string[], int size) {
+
+ int from, to, piece;
+ char tmp_string[256];
+
+ ASSERT(move_is_ok(move));
+ ASSERT(board_is_ok(board));
+ ASSERT(string!=NULL);
+ ASSERT(size>=8);
+
+ ASSERT(move_is_legal(move,board));
+
+ if (size < 8) return FALSE;
+
+ // init
+
+ from = move_from(move);
+ to = move_to(move);
+
+ string[0] = '\0';
+
+ // castle
+
+ if (move_is_castle(move,board)) {
+
+ if (to > from) {
+ strcat(string,"O-O");
+ } else {
+ strcat(string,"O-O-O");
+ }
+
+ goto check;
+ }
+
+ // from
+
+ piece = board->square[from];
+
+ if (piece_is_pawn(piece)) {
+
+ // pawn
+
+ if (move_is_capture(move,board)) {
+ sprintf(tmp_string,"%c",file_to_char(square_file(from)));
+ strcat(string,tmp_string);
+ }
+
+ } else {
+
+ // piece
+
+ sprintf(tmp_string,"%c",toupper(piece_to_char(piece)));
+ strcat(string,tmp_string);
+
+ // ambiguity
+
+ switch (ambiguity(move,board)) {
+ case AMBIGUITY_NONE:
+ break;
+ case AMBIGUITY_FILE:
+ sprintf(tmp_string,"%c",file_to_char(square_file(from)));
+ strcat(string,tmp_string);
+ break;
+ case AMBIGUITY_RANK:
+ sprintf(tmp_string,"%c",rank_to_char(square_rank(from)));
+ strcat(string,tmp_string);
+ break;
+ case AMBIGUITY_SQUARE:
+ if (!square_to_string(from,tmp_string,256)) return FALSE;
+ strcat(string,tmp_string);
+ break;
+ default:
+ ASSERT(FALSE);
+ break;
+ }
+ }
+
+ // capture
+
+ if (move_is_capture(move,board)) strcat(string,"x");
+
+ // to
+
+ if (!square_to_string(to,tmp_string,256)) return FALSE;
+ strcat(string,tmp_string);
+
+ // promote
+
+ if (move_is_promote(move)) {
+ sprintf(tmp_string,"=%c",toupper(piece_to_char(move_promote(move,board))));
+ strcat(string,tmp_string);
+ }
+
+ // check
+
+check:
+
+ if (move_is_mate(move,board)) {
+ strcat(string,"#");
+ } else if (move_is_check(move,board)) {
+ strcat(string,"+");
+ }
+
+ return TRUE;
+}
+
+// move_from_san()
+
+int move_from_san(const char string[], const board_t * board) {
+
+ char s[256];
+ int move;
+
+ ASSERT(string!=NULL);
+ ASSERT(board_is_ok(board));
+
+ san_to_lan(string,board,s,256);
+ move = move_from_lan(s,board);
+
+ ASSERT(!UseSlowDebug||move==move_from_san_debug(string,board));
+
+ return move;
+}
+
+// move_from_san_debug()
+
+int move_from_san_debug(const char string[], const board_t * board) {
+
+ list_t list[1];
+ int i, move;
+ char move_string[256];
+
+ ASSERT(string!=NULL);
+ ASSERT(board_is_ok(board));
+
+ gen_legal_moves(list,board);
+
+ for (i = 0; i < list_size(list); i++) {
+ move = list_move(list,i);
+ if (!move_to_san(move,board,move_string,256)) ASSERT(FALSE);
+ if (my_string_equal(move_string,string)) return move;
+ }
+
+ return MoveNone;
+}
+
+// san_to_lan()
+
+static bool san_to_lan(const char san[], const board_t * board, char string[], int size) {
+
+ int len;
+ int left, right;
+ int c;
+ int king, rook;
+ char king_string[3], rook_string[3];
+
+ ASSERT(san!=NULL);
+ ASSERT(board_is_ok(board));
+ ASSERT(string!=NULL);
+ ASSERT(size>=8);
+
+ // init
+
+ if (size < 8) return FALSE;
+ strcpy(string,"???????");
+
+ len = strlen(san);
+
+ left = 0;
+ right = len;
+
+ // skip trailing '+' or '#'
+
+ if (left < right) {
+ c = san[right-1];
+ if (c == '+' || c == '#') right--;
+ }
+
+ // castling
+
+ ASSERT(left==0);
+
+ if (FALSE) {
+
+ } else if (right == 3 && strncmp(san,"O-O",3) == 0) {
+
+ if (board->castle[board->turn][SideH] == SquareNone) return FALSE;
+
+ king = king_pos(board,board->turn);
+ rook = board->castle[board->turn][SideH];
+
+ square_to_string(king,king_string,3);
+ square_to_string(rook,rook_string,3);
+
+ sprintf(string,"K%s?%s?",king_string,rook_string);
+
+ } else if (right == 5 && strncmp(san,"O-O-O",5) == 0) {
+
+ if (board->castle[board->turn][SideA] == SquareNone) return FALSE;
+
+ king = king_pos(board,board->turn);
+ rook = board->castle[board->turn][SideA];
+
+ square_to_string(king,king_string,3);
+ square_to_string(rook,rook_string,3);
+
+ sprintf(string,"K%s?%s?",king_string,rook_string);
+
+ } else {
+
+ // moved piece
+
+ if (left < right) {
+
+ c = san[left];
+
+ if (char_is_piece(c)) {
+ string[0] = c;
+ left++;
+ }
+ }
+
+ // promotion
+
+ if (left < right) {
+
+ c = toupper(san[right-1]);
+
+ if (char_is_piece(c)) {
+
+ string[6] = c;
+ right--;
+
+ // skip '='
+
+ if (left < right && san[right-1] == '=') right--;
+ }
+ }
+
+ // to-square rank
+
+ if (left < right) {
+
+ c = san[right-1];
+
+ if (char_is_rank(c)) {
+ string[5] = c;
+ right--;
+ }
+ }
+
+ // to-square file
+
+ if (left < right) {
+
+ c = san[right-1];
+
+ if (char_is_file(c)) {
+ string[4] = c;
+ right--;
+ }
+ }
+
+ // captured piece
+
+ if (left < right) {
+
+ c = san[right-1];
+
+ if (char_is_piece(c)) {
+ string[3] = c;
+ right--;
+ }
+ }
+
+ // skip middle '-' or 'x'
+
+ if (left < right) {
+ c = san[right-1];
+ if (c == '-' || c == 'x') right--;
+ }
+
+ // from-square file
+
+ if (left < right) {
+
+ c = san[left];
+
+ if (char_is_file(c)) {
+ string[1] = c;
+ left++;
+ }
+ }
+
+ // from-square rank
+
+ if (left < right) {
+
+ c = san[left];
+
+ if (char_is_rank(c)) {
+ string[2] = c;
+ left++;
+ }
+ }
+
+ if (left != right) return FALSE;
+ }
+
+ // end
+
+ return TRUE;
+}
+
+// move_from_lan()
+
+static int move_from_lan(const char string[], const board_t * board) {
+
+ int len;
+ int move;
+ int promote;
+ char s[256];
+ int from, to;
+ int colour;
+ int inc;
+ int piece_char;
+ int n;
+ const uint8 * ptr;
+ int piece;
+ int side;
+
+ ASSERT(string!=NULL);
+ ASSERT(board_is_ok(board));
+
+ // init
+
+ len = strlen(string);
+ if (len != 7) return MoveNone;
+
+ move = MoveNone;
+ colour = board->turn;
+
+ // promote
+
+ promote = 0;
+
+ switch (string[6]) {
+ case '?': // not a promotion
+ break;
+ case 'N':
+ promote = MovePromoteKnight;
+ break;
+ case 'B':
+ promote = MovePromoteBishop;
+ break;
+ case 'R':
+ promote = MovePromoteRook;
+ break;
+ case 'Q':
+ promote = MovePromoteQueen;
+ break;
+ default:
+ return MoveNone;
+ break;
+ }
+
+ // to square
+
+ s[0] = string[4];
+ s[1] = string[5];
+ s[2] = '\0';
+
+ to = square_from_string(s);
+ if (to == SquareNone) return MoveNone;
+
+ // known from square?
+
+ if (string[1] != '?' && string[2] != '?') {
+
+ // from square
+
+ s[0] = string[1];
+ s[1] = string[2];
+ s[2] = '\0';
+
+ from = square_from_string(s);
+ if (from == SquareNone) return MoveNone;
+
+ // convert "king slide" castling to KxR
+
+ if (piece_is_king(board->square[from])
+ && square_rank(to) == square_rank(from)
+ && abs(to-from) > 1) {
+ side = (to > from) ? SideH : SideA;
+ to = board->castle[colour][side];
+ if (to == SquareNone) return MoveNone;
+ }
+
+ // move
+
+ move = move_make(from,to) | promote;
+
+ return move;
+ }
+
+ // pawn non-capture?
+
+ if (string[0] == '?' && string[1] == '?') {
+
+ if (board->square[to] != Empty) return MoveNone; // useful?
+
+ inc = (colour_is_white(colour)) ? +16 : -16;
+
+ from = to - inc;
+ if (board->square[from] == Empty && square_side_rank(to,colour) == Rank4) {
+ from -= inc;
+ }
+
+ if (board->square[from] != piece_make_pawn(colour)) { // useful?
+ return MoveNone;
+ }
+
+ // move
+
+ move = move_make(from,to) | promote;
+
+ return move;
+ }
+
+ // pawn capture?
+
+ piece_char = string[0];
+
+ if (piece_char == '?' && string[1] != '?') {
+ piece_char = 'P';
+ }
+
+ // attack loop
+
+ n = 0;
+
+ for (ptr = board->list[colour]; (from=*ptr) != SquareNone; ptr++) {
+
+ piece = board->square[from];
+
+ if (toupper(piece_to_char(piece)) == piece_char) {
+ if (piece_attack(board,piece,from,to)) {
+ if (TRUE
+ && (string[1] == '?' || file_to_char(square_file(from)) == string[1])
+ && (string[2] == '?' || rank_to_char(square_rank(from)) == string[2])) {
+ if (!is_pinned(board,from,to,colour)) {
+ move = move_make(from,to) | promote;
+ n++;
+ }
+ }
+ }
+ }
+ }
+
+ if (n != 1) move = MoveNone;
+
+ return move;
+}
+
+// ambiguity()
+
+static int ambiguity(int move, const board_t * board) {
+
+ int from, to, piece;
+ list_t list[1];
+ int i, n, m;
+
+ // init
+
+ from = move_from(move);
+ to = move_to(move);
+ piece = move_piece(move,board);
+
+ gen_legal_moves(list,board);
+
+ // no ambiguity?
+
+ n = 0;
+
+ for (i = 0; i < list_size(list); i++) {
+ m = list_move(list,i);
+ if (move_piece(m,board) == piece && move_to(m) == to) {
+ n++;
+ }
+ }
+
+ if (n == 1) return AMBIGUITY_NONE;
+
+ // file ambiguity?
+
+ n = 0;
+
+ for (i = 0; i < list_size(list); i++) {
+ m = list_move(list,i);
+ if (move_piece(m,board) == piece && move_to(m) == to) {
+ if (square_file(move_from(m)) == square_file(from)) n++;
+ }
+ }
+
+ if (n == 1) return AMBIGUITY_FILE;
+
+ // rank ambiguity?
+
+ n = 0;
+
+ for (i = 0; i < list_size(list); i++) {
+ m = list_move(list,i);
+ if (move_piece(m,board) == piece && move_to(m) == to) {
+ if (square_rank(move_from(m)) == square_rank(from)) n++;
+ }
+ }
+
+ if (n == 1) return AMBIGUITY_RANK;
+
+ // square ambiguity
+
+ return AMBIGUITY_SQUARE;
+}
+
+// end of san.cpp
+
-\r
-// san.h\r
-\r
-#ifndef SAN_H\r
-#define SAN_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "util.h"\r
-\r
-// functions\r
-\r
-extern bool move_to_san (int move, const board_t * board, char string[], int size);\r
-extern int move_from_san (const char string[], const board_t * board);\r
-\r
-extern int move_from_san_debug (const char string[], const board_t * board);\r
-\r
-#endif // !defined SAN_H\r
-\r
-// end of san.h\r
-\r
+
+// san.h
+
+#ifndef SAN_H
+#define SAN_H
+
+// includes
+
+#include "board.h"
+#include "util.h"
+
+// functions
+
+extern bool move_to_san (int move, const board_t * board, char string[], int size);
+extern int move_from_san (const char string[], const board_t * board);
+
+extern int move_from_san_debug (const char string[], const board_t * board);
+
+#endif // !defined SAN_H
+
+// end of san.h
+
-// search.c\r
-\r
-// includes\r
-\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "attack.h"\r
-#include "board.h"\r
-#include "colour.h"\r
-#include "engine.h"\r
-#include "fen.h"\r
-#include "line.h"\r
-#include "list.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_gen.h"\r
-#include "move_legal.h"\r
-#include "option.h"\r
-#include "parse.h"\r
-#include "san.h"\r
-#include "search.h"\r
-#include "uci.h"\r
-#include "util.h"\r
-\r
-// constants\r
-\r
-#define StringSize ((int)4096)\r
-\r
-// variables\r
-\r
-static int Depth;\r
-\r
-static int BestMove;\r
-static int BestValue;\r
-static move_t BestPV[LineSize];\r
-\r
-static sint64 NodeNb;\r
-static sint64 LeafNb;\r
-static double Time;\r
-\r
-static int Move;\r
-static int MovePos;\r
-static int MoveNb;\r
-\r
-// prototypes\r
-\r
-static bool depth_is_ok (int depth);\r
-static void perft (const board_t * board, int depth);\r
-\r
-// functions\r
-\r
-// depth_is_ok()\r
-\r
-static bool depth_is_ok(int depth) {\r
-\r
- return depth >= 0 && depth < DepthMax;\r
-}\r
-\r
-// search()\r
-\r
-void search(const board_t * board, int depth_max, double time_max) {\r
-\r
- char string[256];\r
-\r
- ASSERT(board_is_ok(board));\r
- ASSERT(depth_max>=1&&depth_max<DepthMax);\r
- ASSERT(time_max>=0.0);\r
-\r
- // engine\r
-\r
- Depth = 0;\r
-\r
- BestMove = MoveNone;\r
- BestValue = 0;\r
- line_clear(BestPV);\r
-\r
- NodeNb = 0;\r
- LeafNb = 0;\r
- Time = 0.0;\r
-\r
- Move = MoveNone;\r
- MovePos = 0;\r
- MoveNb = 0;\r
-\r
- // init\r
-\r
- uci_send_ucinewgame(Uci);\r
- uci_send_isready_sync(Uci);\r
-\r
- // position\r
-\r
- if (!board_to_fen(board,string,256)) ASSERT(FALSE);\r
- engine_send(Engine,"position fen %s",string);\r
-\r
- // search\r
-\r
- engine_send_queue(Engine,"go");\r
-\r
- engine_send_queue(Engine," movetime %.0f",time_max*1000.0);\r
- engine_send_queue(Engine," depth %d",depth_max);\r
-\r
- engine_send(Engine,""); // newline\r
-\r
- // wait for feed-back\r
-\r
- while (!engine_eof(Engine)) {\r
-\r
- engine_get(Engine,string);\r
-\r
- if (FALSE) {\r
-\r
- } else if (match(string,"bestmove * ponder *")) {\r
-\r
- BestMove = move_from_can(Star[0],board);\r
- ASSERT(BestMove!=MoveNone&&move_is_legal(BestMove,board));\r
-\r
- break;\r
-\r
- } else if (match(string,"bestmove *")) {\r
-\r
- BestMove = move_from_can(Star[0],board);\r
- ASSERT(BestMove!=MoveNone&&move_is_legal(BestMove,board));\r
-\r
- break;\r
- }\r
- }\r
-\r
- printf("\n");\r
-}\r
-\r
-// do_perft()\r
-\r
-void do_perft(int argc,char * argv[]){\r
- const char * fen=NULL;\r
- int depth=1;\r
- board_t board[1];\r
- int i;\r
- for (i = 1; i < argc; i++) {\r
- if (FALSE) {\r
- } else if (my_string_equal(argv[i],"perft")) {\r
- // skip\r
- } else if (my_string_equal(argv[i],"-fen")) {\r
- i++;\r
- if (argv[i] == NULL) my_fatal("do_perft(): missing argument\n");\r
- my_string_set(&fen,argv[i]);\r
- } else if (my_string_equal(argv[i],"-max-depth")){\r
- i++;\r
- if (argv[i] == NULL) my_fatal("do_perft(): missing argument\n");\r
- depth=atoi(argv[i]);\r
- if(depth<1) my_fatal("do_perft(): illegal depth %d\n",depth);\r
- } else {\r
- my_fatal("do_perft(): unknown option \"%s\"\n",argv[i]);\r
- }\r
- }\r
- if(fen==NULL){\r
- my_string_set(&fen,StartFen);\r
- }\r
- board_from_fen(board,fen);\r
- search_perft(board,depth);\r
-}\r
-\r
-// search_perft()\r
-\r
-void search_perft(const board_t * board, int depth_max) {\r
-\r
- int depth;\r
- my_timer_t timer[1];\r
- double time, speed;\r
- char node_string[StringSize];\r
- char leafnode_string[StringSize];\r
-\r
- ASSERT(board_is_ok(board));\r
- ASSERT(depth_max>=1&&depth_max<DepthMax);\r
-\r
- // init\r
-\r
- board_disp(board);\r
-\r
- // iterative deepening\r
-\r
- for (depth = 1; depth <= depth_max; depth++) {\r
-\r
- // init\r
-\r
- NodeNb = 0;\r
- LeafNb = 0;\r
-\r
- my_timer_reset(timer);\r
-\r
- my_timer_start(timer);\r
- perft(board,depth);\r
- my_timer_stop(timer);\r
-\r
- time = my_timer_elapsed_real(timer);//my_timer_elapsed_cpu(timer);\r
- speed = (time < 0.01) ? 0.0 : ((double)NodeNb) / time;\r
-\r
- snprintf(node_string,StringSize,S64_FORMAT,NodeNb);\r
- snprintf(leafnode_string,StringSize,S64_FORMAT,LeafNb);\r
-\r
- printf("depth=%2d nodes=%12s leafnodes=%12s time=%7.2fs nps=%8.0f\n",depth,node_string,leafnode_string,time,speed);\r
- }\r
-\r
-}\r
-\r
-// perft()\r
-\r
-static void perft(const board_t * board, int depth) {\r
-\r
- int me;\r
- list_t list[1];\r
- int i, move;\r
- board_t new_board[1];\r
-\r
- ASSERT(board_is_ok(board));\r
- ASSERT(depth_is_ok(depth));\r
-\r
- ASSERT(!is_in_check(board,colour_opp(board->turn)));\r
-\r
- // init\r
-\r
- NodeNb++;\r
-\r
- // leaf\r
-\r
- if (depth == 0) {\r
- LeafNb++;\r
- return;\r
- }\r
-\r
- // more init\r
-\r
- me = board->turn;\r
-\r
- // move loop\r
-\r
- gen_moves(list,board);\r
-\r
- for (i = 0; i < list_size(list); i++) {\r
-\r
- move = list_move(list,i);\r
-\r
- board_copy(new_board,board);\r
- move_do(new_board,move);\r
-\r
- if (!is_in_check(new_board,me)) perft(new_board,depth-1);\r
- }\r
-}\r
-\r
-// end of search.cpp\r
-\r
+// search.c
+
+// includes
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "attack.h"
+#include "board.h"
+#include "colour.h"
+#include "engine.h"
+#include "fen.h"
+#include "line.h"
+#include "list.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_gen.h"
+#include "move_legal.h"
+#include "option.h"
+#include "parse.h"
+#include "san.h"
+#include "search.h"
+#include "uci.h"
+#include "util.h"
+
+// variables
+
+static int Depth;
+
+static int BestMove;
+static int BestValue;
+static move_t BestPV[LineSize];
+
+static sint64 NodeNb;
+static sint64 LeafNb;
+static double Time;
+
+static int Move;
+static int MovePos;
+static int MoveNb;
+
+// prototypes
+
+static bool depth_is_ok (int depth);
+static void perft (const board_t * board, int depth);
+
+// functions
+
+// depth_is_ok()
+
+static bool depth_is_ok(int depth) {
+
+ return depth >= 0 && depth < DepthMax;
+}
+
+// search()
+
+void search(const board_t * board, int depth_max, double time_max) {
+
+ char string[256];
+
+ ASSERT(board_is_ok(board));
+ ASSERT(depth_max>=1&&depth_max<DepthMax);
+ ASSERT(time_max>=0.0);
+
+ // engine
+
+ Depth = 0;
+
+ BestMove = MoveNone;
+ BestValue = 0;
+ line_clear(BestPV);
+
+ NodeNb = 0;
+ LeafNb = 0;
+ Time = 0.0;
+
+ Move = MoveNone;
+ MovePos = 0;
+ MoveNb = 0;
+
+ // init
+
+ uci_send_ucinewgame(Uci);
+ uci_send_isready_sync(Uci);
+
+ // position
+
+ if (!board_to_fen(board,string,256)) ASSERT(FALSE);
+ engine_send(Engine,"position fen %s",string);
+
+ // search
+
+ engine_send_queue(Engine,"go");
+
+ engine_send_queue(Engine," movetime %.0f",time_max*1000.0);
+ engine_send_queue(Engine," depth %d",depth_max);
+
+ engine_send(Engine,""); // newline
+
+ // wait for feed-back
+
+ while (!engine_eof(Engine)) {
+
+ engine_get(Engine,string);
+
+ if (FALSE) {
+
+ } else if (match(string,"bestmove * ponder *")) {
+
+ BestMove = move_from_can(Star[0],board);
+ ASSERT(BestMove!=MoveNone&&move_is_legal(BestMove,board));
+
+ break;
+
+ } else if (match(string,"bestmove *")) {
+
+ BestMove = move_from_can(Star[0],board);
+ ASSERT(BestMove!=MoveNone&&move_is_legal(BestMove,board));
+
+ break;
+ }
+ }
+
+ printf("\n");
+}
+
+// do_perft()
+
+void do_perft(int argc,char * argv[]){
+ const char * fen=NULL;
+ int depth=1;
+ board_t board[1];
+ int i;
+ for (i = 1; i < argc; i++) {
+ if (FALSE) {
+ } else if (my_string_equal(argv[i],"perft")) {
+ // skip
+ } else if (my_string_equal(argv[i],"-fen")) {
+ i++;
+ if (argv[i] == NULL) my_fatal("do_perft(): missing argument\n");
+ my_string_set(&fen,argv[i]);
+ } else if (my_string_equal(argv[i],"-max-depth")){
+ i++;
+ if (argv[i] == NULL) my_fatal("do_perft(): missing argument\n");
+ depth=atoi(argv[i]);
+ if(depth<1) my_fatal("do_perft(): illegal depth %d\n",depth);
+ } else {
+ my_fatal("do_perft(): unknown option \"%s\"\n",argv[i]);
+ }
+ }
+ if(fen==NULL){
+ my_string_set(&fen,StartFen);
+ }
+ board_from_fen(board,fen);
+ search_perft(board,depth);
+}
+
+// search_perft()
+
+void search_perft(const board_t * board, int depth_max) {
+
+ int depth;
+ my_timer_t timer[1];
+ double time, speed;
+ char node_string[StringSize];
+ char leafnode_string[StringSize];
+
+ ASSERT(board_is_ok(board));
+ ASSERT(depth_max>=1&&depth_max<DepthMax);
+
+ // init
+
+ board_disp(board);
+
+ // iterative deepening
+
+ for (depth = 1; depth <= depth_max; depth++) {
+
+ // init
+
+ NodeNb = 0;
+ LeafNb = 0;
+
+ my_timer_reset(timer);
+
+ my_timer_start(timer);
+ perft(board,depth);
+ my_timer_stop(timer);
+
+ time = my_timer_elapsed_real(timer);//my_timer_elapsed_cpu(timer);
+ speed = (time < 0.01) ? 0.0 : ((double)NodeNb) / time;
+
+ snprintf(node_string,StringSize,S64_FORMAT,NodeNb);
+ snprintf(leafnode_string,StringSize,S64_FORMAT,LeafNb);
+
+ printf("depth=%2d nodes=%12s leafnodes=%12s time=%7.2fs nps=%8.0f\n",depth,node_string,leafnode_string,time,speed);
+ }
+
+}
+
+// perft()
+
+static void perft(const board_t * board, int depth) {
+
+ int me;
+ list_t list[1];
+ int i, move;
+ board_t new_board[1];
+
+ ASSERT(board_is_ok(board));
+ ASSERT(depth_is_ok(depth));
+
+ ASSERT(!is_in_check(board,colour_opp(board->turn)));
+
+ // init
+
+ NodeNb++;
+
+ // leaf
+
+ if (depth == 0) {
+ LeafNb++;
+ return;
+ }
+
+ // more init
+
+ me = board->turn;
+
+ // move loop
+
+ gen_moves(list,board);
+
+ for (i = 0; i < list_size(list); i++) {
+
+ move = list_move(list,i);
+
+ board_copy(new_board,board);
+ move_do(new_board,move);
+
+ if (!is_in_check(new_board,me)) perft(new_board,depth-1);
+ }
+}
+
+// end of search.cpp
+
-// search.h\r
-\r
-#ifndef SEARCH_H\r
-#define SEARCH_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define DepthMax 63\r
-\r
-// functions\r
-\r
-extern void search (const board_t * board, int depth_max, double time_max);\r
-extern void search_perft (const board_t * board, int depth_max);\r
-\r
-extern void do_perft (int argc, char * argv[]);\r
-\r
-#endif // !defined SEARCH_H\r
-\r
-// end of search.h\r
-\r
+// search.h
+
+#ifndef SEARCH_H
+#define SEARCH_H
+
+// includes
+
+#include "board.h"
+#include "util.h"
+
+// defines
+
+#define DepthMax 63
+
+// functions
+
+extern void search (const board_t * board, int depth_max, double time_max);
+extern void search_perft (const board_t * board, int depth_max);
+
+extern void do_perft (int argc, char * argv[]);
+
+#endif // !defined SEARCH_H
+
+// end of search.h
+
-\r
-// square.c\r
-\r
-// includes\r
-\r
-#include "colour.h"\r
-#include "square.h"\r
-#include "util.h"\r
-\r
-// "constants"\r
-\r
-static const uint8 SquareFrom64[64] = {\r
- A1, B1, C1, D1, E1, F1, G1, H1,\r
- A2, B2, C2, D2, E2, F2, G2, H2,\r
- A3, B3, C3, D3, E3, F3, G3, H3,\r
- A4, B4, C4, D4, E4, F4, G4, H4,\r
- A5, B5, C5, D5, E5, F5, G5, H5,\r
- A6, B6, C6, D6, E6, F6, G6, H6,\r
- A7, B7, C7, D7, E7, F7, G7, H7,\r
- A8, B8, C8, D8, E8, F8, G8, H8,\r
-};\r
-\r
-// variables\r
-\r
-static sint8 SquareTo64[SquareNb];\r
-\r
-// functions\r
-\r
-// square_init()\r
-\r
-void square_init() {\r
-\r
- int sq;\r
-\r
- for (sq = 0; sq < SquareNb; sq++) SquareTo64[sq] = -1;\r
-\r
- for (sq = 0; sq < 64; sq++) {\r
- SquareTo64[SquareFrom64[sq]] = sq;\r
- }\r
-}\r
-\r
-// square_is_ok()\r
-\r
-bool square_is_ok(int square) {\r
-\r
- if (square < 0 || square >= SquareNb) return FALSE;\r
-\r
- if (SquareTo64[square] < 0) return FALSE;\r
-\r
- return TRUE;\r
-}\r
-\r
-// square_make()\r
-\r
-int square_make(int file, int rank) {\r
-\r
- int sq_64;\r
-\r
- ASSERT(file>=0&&file<8);\r
- ASSERT(rank>=0&&rank<8);\r
-\r
- sq_64 = (rank << 3) | file;\r
-\r
- return square_from_64(sq_64);\r
-}\r
-\r
-// square_file()\r
-\r
-int square_file(int square) {\r
-\r
- int file;\r
-\r
- ASSERT(square_is_ok(square));\r
-\r
- file = (square - 4) & 7;\r
- ASSERT(file==(square_to_64(square)&7));\r
-\r
- return file;\r
-}\r
-\r
-// square_rank()\r
-\r
-int square_rank(int square) {\r
-\r
- int rank;\r
-\r
- ASSERT(square_is_ok(square));\r
-\r
- rank = (square >> 4) - 2;\r
- ASSERT(rank==square_to_64(square)>>3);\r
-\r
- return rank;\r
-}\r
-\r
-// square_side_rank()\r
-\r
-int square_side_rank(int square, int colour) {\r
-\r
- int rank;\r
-\r
- ASSERT(square_is_ok(square));\r
- ASSERT(colour_is_ok(colour));\r
-\r
- rank = square_rank(square);\r
- if (colour_is_black(colour)) rank = 7-rank;\r
-\r
- return rank;\r
-}\r
-\r
-// square_from_64()\r
-\r
-int square_from_64(int square) {\r
-\r
- ASSERT(square>=0&&square<64);\r
-\r
- return SquareFrom64[square];\r
-}\r
-\r
-// square_to_64()\r
-\r
-int square_to_64(int square) {\r
-\r
- ASSERT(square_is_ok(square));\r
-\r
- return SquareTo64[square];\r
-}\r
-\r
-// square_is_promote()\r
-\r
-bool square_is_promote(int square) {\r
-\r
- int rank;\r
-\r
- ASSERT(square_is_ok(square));\r
-\r
- rank = square_rank(square);\r
-\r
- return rank == Rank1 || rank == Rank8;\r
-}\r
-\r
-// square_ep_dual()\r
-\r
-int square_ep_dual(int square) {\r
-\r
- ASSERT(square_is_ok(square));\r
- ASSERT(square_rank(square)>=2&&square_rank(square)<=5);\r
-\r
- return square ^ 16;\r
-}\r
-\r
-// square_colour()\r
-\r
-int square_colour(int square) {\r
-\r
- ASSERT(square_is_ok(square));\r
-\r
- return (square ^ (square >> 4)) & 1;\r
-}\r
-\r
-// file_from_char()\r
-\r
-int file_from_char(int c) {\r
-\r
- ASSERT(c>='a'&&c<='h');\r
-\r
- return c - 'a';\r
-}\r
-\r
-// rank_from_char()\r
-\r
-int rank_from_char(int c) {\r
-\r
- ASSERT(c>='1'&&c<='8');\r
-\r
- return c - '1';\r
-}\r
-\r
-// file_to_char()\r
-\r
-int file_to_char(int file) {\r
-\r
- ASSERT(file>=0&&file<8);\r
-\r
- return 'a' + file;\r
-}\r
-\r
-// rank_to_char()\r
-\r
-int rank_to_char(int rank) {\r
-\r
- ASSERT(rank>=0&&rank<8);\r
-\r
- return '1' + rank;\r
-}\r
-\r
-// char_is_file()\r
-\r
-bool char_is_file(int c) {\r
-\r
- return c >= 'a' && c <= 'h';\r
-}\r
-\r
-// char_is_rank()\r
-\r
-bool char_is_rank(int c) {\r
-\r
- return c >= '1' && c <= '8';\r
-}\r
-\r
-// square_to_string()\r
-\r
-bool square_to_string(int square, char string[], int size) {\r
-\r
- ASSERT(square_is_ok(square));\r
- ASSERT(string!=NULL);\r
- ASSERT(size>=3);\r
-\r
- if (size < 3) return FALSE;\r
-\r
- string[0] = 'a' + square_file(square);\r
- string[1] = '1' + square_rank(square);\r
- string[2] = '\0';\r
-\r
- return TRUE;\r
-}\r
-\r
-// square_from_string()\r
-\r
-int square_from_string(const char string[]) {\r
-\r
- int file, rank;\r
-\r
- ASSERT(string!=NULL);\r
-\r
- if (string[0] < 'a' || string[0] > 'h') return SquareNone;\r
- if (string[1] < '1' || string[1] > '8') return SquareNone;\r
- if (string[2] != '\0') return SquareNone;\r
-\r
- file = file_from_char(string[0]);\r
- rank = rank_from_char(string[1]);\r
-\r
- return square_make(file,rank);\r
-}\r
-\r
-// end of square.cpp\r
-\r
+
+// square.c
+
+// includes
+
+#include "colour.h"
+#include "square.h"
+#include "util.h"
+
+// "constants"
+
+static const uint8 SquareFrom64[64] = {
+ A1, B1, C1, D1, E1, F1, G1, H1,
+ A2, B2, C2, D2, E2, F2, G2, H2,
+ A3, B3, C3, D3, E3, F3, G3, H3,
+ A4, B4, C4, D4, E4, F4, G4, H4,
+ A5, B5, C5, D5, E5, F5, G5, H5,
+ A6, B6, C6, D6, E6, F6, G6, H6,
+ A7, B7, C7, D7, E7, F7, G7, H7,
+ A8, B8, C8, D8, E8, F8, G8, H8,
+};
+
+// variables
+
+static sint8 SquareTo64[SquareNb];
+
+// functions
+
+// square_init()
+
+void square_init() {
+
+ int sq;
+
+ for (sq = 0; sq < SquareNb; sq++) SquareTo64[sq] = -1;
+
+ for (sq = 0; sq < 64; sq++) {
+ SquareTo64[SquareFrom64[sq]] = sq;
+ }
+}
+
+// square_is_ok()
+
+bool square_is_ok(int square) {
+
+ if (square < 0 || square >= SquareNb) return FALSE;
+
+ if (SquareTo64[square] < 0) return FALSE;
+
+ return TRUE;
+}
+
+// square_make()
+
+int square_make(int file, int rank) {
+
+ int sq_64;
+
+ ASSERT(file>=0&&file<8);
+ ASSERT(rank>=0&&rank<8);
+
+ sq_64 = (rank << 3) | file;
+
+ return square_from_64(sq_64);
+}
+
+// square_file()
+
+int square_file(int square) {
+
+ int file;
+
+ ASSERT(square_is_ok(square));
+
+ file = (square - 4) & 7;
+ ASSERT(file==(square_to_64(square)&7));
+
+ return file;
+}
+
+// square_rank()
+
+int square_rank(int square) {
+
+ int rank;
+
+ ASSERT(square_is_ok(square));
+
+ rank = (square >> 4) - 2;
+ ASSERT(rank==square_to_64(square)>>3);
+
+ return rank;
+}
+
+// square_side_rank()
+
+int square_side_rank(int square, int colour) {
+
+ int rank;
+
+ ASSERT(square_is_ok(square));
+ ASSERT(colour_is_ok(colour));
+
+ rank = square_rank(square);
+ if (colour_is_black(colour)) rank = 7-rank;
+
+ return rank;
+}
+
+// square_from_64()
+
+int square_from_64(int square) {
+
+ ASSERT(square>=0&&square<64);
+
+ return SquareFrom64[square];
+}
+
+// square_to_64()
+
+int square_to_64(int square) {
+
+ ASSERT(square_is_ok(square));
+
+ return SquareTo64[square];
+}
+
+// square_is_promote()
+
+bool square_is_promote(int square) {
+
+ int rank;
+
+ ASSERT(square_is_ok(square));
+
+ rank = square_rank(square);
+
+ return rank == Rank1 || rank == Rank8;
+}
+
+// square_ep_dual()
+
+int square_ep_dual(int square) {
+
+ ASSERT(square_is_ok(square));
+ ASSERT(square_rank(square)>=2&&square_rank(square)<=5);
+
+ return square ^ 16;
+}
+
+// square_colour()
+
+int square_colour(int square) {
+
+ ASSERT(square_is_ok(square));
+
+ return (square ^ (square >> 4)) & 1;
+}
+
+// file_from_char()
+
+int file_from_char(int c) {
+
+ ASSERT(c>='a'&&c<='h');
+
+ return c - 'a';
+}
+
+// rank_from_char()
+
+int rank_from_char(int c) {
+
+ ASSERT(c>='1'&&c<='8');
+
+ return c - '1';
+}
+
+// file_to_char()
+
+int file_to_char(int file) {
+
+ ASSERT(file>=0&&file<8);
+
+ return 'a' + file;
+}
+
+// rank_to_char()
+
+int rank_to_char(int rank) {
+
+ ASSERT(rank>=0&&rank<8);
+
+ return '1' + rank;
+}
+
+// char_is_file()
+
+bool char_is_file(int c) {
+
+ return c >= 'a' && c <= 'h';
+}
+
+// char_is_rank()
+
+bool char_is_rank(int c) {
+
+ return c >= '1' && c <= '8';
+}
+
+// square_to_string()
+
+bool square_to_string(int square, char string[], int size) {
+
+ ASSERT(square_is_ok(square));
+ ASSERT(string!=NULL);
+ ASSERT(size>=3);
+
+ if (size < 3) return FALSE;
+
+ string[0] = 'a' + square_file(square);
+ string[1] = '1' + square_rank(square);
+ string[2] = '\0';
+
+ return TRUE;
+}
+
+// square_from_string()
+
+int square_from_string(const char string[]) {
+
+ int file, rank;
+
+ ASSERT(string!=NULL);
+
+ if (string[0] < 'a' || string[0] > 'h') return SquareNone;
+ if (string[1] < '1' || string[1] > '8') return SquareNone;
+ if (string[2] != '\0') return SquareNone;
+
+ file = file_from_char(string[0]);
+ rank = rank_from_char(string[1]);
+
+ return square_make(file,rank);
+}
+
+// end of square.cpp
+
-\r
-// square.h\r
-\r
-#ifndef SQUARE_H\r
-#define SQUARE_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// defines\r
-\r
-#define SquareNb (16 * 12)\r
-\r
-#define FileA 0\r
-#define FileB 1\r
-#define FileC 2\r
-#define FileD 3\r
-#define FileE 4\r
-#define FileF 5\r
-#define FileG 6\r
-#define FileH 7\r
-\r
-#define Rank1 0\r
-#define Rank2 1\r
-#define Rank3 2\r
-#define Rank4 3\r
-#define Rank5 4\r
-#define Rank6 5\r
-#define Rank7 6\r
-#define Rank8 7\r
-\r
-#define SquareNone 0\r
-\r
-#define A1 0x24\r
-#define B1 0x25\r
-#define C1 0x26\r
-#define D1 0x27\r
-#define E1 0x28\r
-#define F1 0x29\r
-#define G1 0x2A\r
-#define H1 0x2B\r
-#define A2 0x34\r
-#define B2 0x35\r
-#define C2 0x36\r
-#define D2 0x37\r
-#define E2 0x38\r
-#define F2 0x39\r
-#define G2 0x3A\r
-#define H2 0x3B\r
-#define A3 0x44\r
-#define B3 0x45\r
-#define C3 0x46\r
-#define D3 0x47\r
-#define E3 0x48\r
-#define F3 0x49\r
-#define G3 0x4A\r
-#define H3 0x4B\r
-#define A4 0x54\r
-#define B4 0x55\r
-#define C4 0x56\r
-#define D4 0x57\r
-#define E4 0x58\r
-#define F4 0x59\r
-#define G4 0x5A\r
-#define H4 0x5B\r
-#define A5 0x64\r
-#define B5 0x65\r
-#define C5 0x66\r
-#define D5 0x67\r
-#define E5 0x68\r
-#define F5 0x69\r
-#define G5 0x6A\r
-#define H5 0x6B\r
-#define A6 0x74\r
-#define B6 0x75\r
-#define C6 0x76\r
-#define D6 0x77\r
-#define E6 0x78\r
-#define F6 0x79\r
-#define G6 0x7A\r
-#define H6 0x7B\r
-#define A7 0x84\r
-#define B7 0x85\r
-#define C7 0x86\r
-#define D7 0x87\r
-#define E7 0x88\r
-#define F7 0x89\r
-#define G7 0x8A\r
-#define H7 0x8B\r
-#define A8 0x94\r
-#define B8 0x95\r
-#define C8 0x96\r
-#define D8 0x97\r
-#define E8 0x98\r
-#define F8 0x99\r
-#define G8 0x9A\r
-#define H8 0x9B\r
-\r
-#define Dark 0\r
-#define Light 1\r
-\r
-// functions\r
-\r
-extern void square_init ();\r
-\r
-extern bool square_is_ok (int square);\r
-\r
-extern int square_make (int file, int rank);\r
-\r
-extern int square_file (int square);\r
-extern int square_rank (int square);\r
-extern int square_side_rank (int square, int colour);\r
-\r
-extern int square_from_64 (int square);\r
-extern int square_to_64 (int square);\r
-\r
-extern bool square_is_promote (int square);\r
-extern int square_ep_dual (int square);\r
-\r
-extern int square_colour (int square);\r
-\r
-extern bool char_is_file (int c);\r
-extern bool char_is_rank (int c);\r
-\r
-extern int file_from_char (int c);\r
-extern int rank_from_char (int c);\r
-\r
-extern int file_to_char (int file);\r
-extern int rank_to_char (int rank);\r
-\r
-extern bool square_to_string (int square, char string[], int size);\r
-extern int square_from_string (const char string[]);\r
-\r
-#endif // !defined SQUARE_H\r
-\r
-// end of square.h\r
-\r
+
+// square.h
+
+#ifndef SQUARE_H
+#define SQUARE_H
+
+// includes
+
+#include "util.h"
+
+// defines
+
+#define SquareNb (16 * 12)
+
+#define FileA 0
+#define FileB 1
+#define FileC 2
+#define FileD 3
+#define FileE 4
+#define FileF 5
+#define FileG 6
+#define FileH 7
+
+#define Rank1 0
+#define Rank2 1
+#define Rank3 2
+#define Rank4 3
+#define Rank5 4
+#define Rank6 5
+#define Rank7 6
+#define Rank8 7
+
+#define SquareNone 0
+
+#define A1 0x24
+#define B1 0x25
+#define C1 0x26
+#define D1 0x27
+#define E1 0x28
+#define F1 0x29
+#define G1 0x2A
+#define H1 0x2B
+#define A2 0x34
+#define B2 0x35
+#define C2 0x36
+#define D2 0x37
+#define E2 0x38
+#define F2 0x39
+#define G2 0x3A
+#define H2 0x3B
+#define A3 0x44
+#define B3 0x45
+#define C3 0x46
+#define D3 0x47
+#define E3 0x48
+#define F3 0x49
+#define G3 0x4A
+#define H3 0x4B
+#define A4 0x54
+#define B4 0x55
+#define C4 0x56
+#define D4 0x57
+#define E4 0x58
+#define F4 0x59
+#define G4 0x5A
+#define H4 0x5B
+#define A5 0x64
+#define B5 0x65
+#define C5 0x66
+#define D5 0x67
+#define E5 0x68
+#define F5 0x69
+#define G5 0x6A
+#define H5 0x6B
+#define A6 0x74
+#define B6 0x75
+#define C6 0x76
+#define D6 0x77
+#define E6 0x78
+#define F6 0x79
+#define G6 0x7A
+#define H6 0x7B
+#define A7 0x84
+#define B7 0x85
+#define C7 0x86
+#define D7 0x87
+#define E7 0x88
+#define F7 0x89
+#define G7 0x8A
+#define H7 0x8B
+#define A8 0x94
+#define B8 0x95
+#define C8 0x96
+#define D8 0x97
+#define E8 0x98
+#define F8 0x99
+#define G8 0x9A
+#define H8 0x9B
+
+#define Dark 0
+#define Light 1
+
+// functions
+
+extern void square_init ();
+
+extern bool square_is_ok (int square);
+
+extern int square_make (int file, int rank);
+
+extern int square_file (int square);
+extern int square_rank (int square);
+extern int square_side_rank (int square, int colour);
+
+extern int square_from_64 (int square);
+extern int square_to_64 (int square);
+
+extern bool square_is_promote (int square);
+extern int square_ep_dual (int square);
+
+extern int square_colour (int square);
+
+extern bool char_is_file (int c);
+extern bool char_is_rank (int c);
+
+extern int file_from_char (int c);
+extern int rank_from_char (int c);
+
+extern int file_to_char (int file);
+extern int rank_to_char (int rank);
+
+extern bool square_to_string (int square, char string[], int size);
+extern int square_from_string (const char string[]);
+
+#endif // !defined SQUARE_H
+
+// end of square.h
+
-\r
-// uci.c\r
-\r
-// includes\r
-\r
-#include <stdarg.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-\r
-#include "board.h"\r
-#include "engine.h"\r
-#include "gui.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_legal.h"\r
-#include "option.h"\r
-#include "parse.h"\r
-#include "line.h"\r
-#include "uci.h"\r
-\r
-\r
-// constants\r
-\r
-static const bool UseDebug = FALSE;\r
-\r
-#define StringSize ((int)4096)\r
-\r
-// variables\r
-\r
-uci_t Uci[1];\r
-\r
-// Hopefully the following confusion is temporary\r
-// Normally we should check for the engine name but this is a hack anyway\r
-// Some of there where provided by Marc Lacrosse\r
-\r
-const char * thread_options[]={\r
- "number of threads", // toga\r
- "number threads", // Deep Learning Toga\r
- "threads", // glaurung, zappa, cyclone, grapefruit,\r
- // Deep Shredder, Deep Junior, bright\r
- "core threads", // HIARCS\r
- "max cpus", // rybka\r
- "cpus", // Deep Sjeng, Fruit2.3.5\r
- "maxthreads", // Naum \r
- NULL\r
-};\r
-\r
-// prototypes\r
-\r
-static bool uci_is_ok (const uci_t * uci);\r
-\r
-static int parse_bestmove (uci_t * uci, const char string[]);\r
-static void parse_id (uci_t * uci, const char string[]);\r
-static int parse_info (uci_t * uci, const char string[]);\r
-static void parse_option (uci_t * uci, const char string[]);\r
-static void parse_score (uci_t * uci, const char string[]);\r
-\r
-static int mate_score (int dist);\r
-\r
-// functions\r
-\r
-\r
-// uci_adapt_UCI3()\r
-\r
-static void apply_UCI3_heuristics(option_t *opt){\r
- if(option_get_int(Option,"UCIVersion")>2){\r
- return;\r
- }\r
- if(!my_string_equal(opt->type,"string")){\r
- return;\r
- }\r
- if(!strncmp(opt->name,"UCI_",4)){\r
- return;\r
- }\r
- if(my_string_case_contains(opt->name,"file")){\r
- my_string_set(&opt->type,"file");\r
- return;\r
- }\r
- if(my_string_case_contains(opt->name,"path")){\r
- my_string_set(&opt->type,"path");\r
- return;\r
- }\r
-}\r
-\r
-// uci_set_threads()\r
-\r
-void uci_set_threads(uci_t * uci, int n) {\r
- const char *thread_option=uci_thread_option(uci);\r
- ASSERT(n>=1);\r
- if(thread_option){\r
- uci_send_option(uci,thread_option,"%d",n);\r
- }\r
-}\r
-\r
-\r
-const char * uci_thread_option(uci_t * uci){\r
- const char **p = thread_options;\r
- const char *thread_option;\r
- option_t *opt;\r
- while((thread_option = *(p++))){\r
- if((opt=option_find(uci->option,thread_option))){\r
- return opt->name;\r
- break;\r
- }\r
- }\r
- return NULL;\r
-}\r
-\r
-// uci_is_ok()\r
-\r
-static bool uci_is_ok(const uci_t * uci) {\r
-\r
- if (uci == NULL) return FALSE;\r
- if (uci->engine == NULL) return FALSE;\r
- if (!option_is_ok(uci->option)) return FALSE;\r
- return TRUE;\r
-}\r
-\r
-// uci_open()\r
-\r
-void uci_open(uci_t * uci, engine_t * engine) {\r
-\r
- char string[StringSize];\r
- int event;\r
-\r
- ASSERT(uci!=NULL);\r
- ASSERT(engine!=NULL);\r
-\r
- // init\r
-\r
- uci->engine = engine;\r
-\r
- uci->name = NULL;\r
- my_string_set(&uci->name,"<empty>");\r
- uci->author = NULL;\r
- my_string_set(&uci->author,"<empty>");\r
- option_init(uci->option);\r
-\r
- uci->ready_nb = 0;\r
- uci->searching = 0;\r
- uci->pending_nb = 0;\r
- uci->multipv_mode = FALSE;\r
- board_start(uci->board);\r
- uci_clear(uci);\r
-\r
- // send "uci" and wait for "uciok"\r
-\r
- engine_send(uci->engine,"uci");\r
-\r
- do {\r
- engine_get(uci->engine,string);\r
- // Handle the case that the engine is really a WB engine somewhat gracefully.\r
- if((strstr(string,"Illegal") || strstr(string,"Error"))\r
- &&strstr(string,"uci")){\r
- my_fatal("uci_open(): Not a UCI engine.\n");\r
- }\r
- event = uci_parse(uci,string);\r
- } while (!engine_eof(Engine) && (event & EVENT_UCI) == 0);\r
-}\r
-\r
-// uci_close()\r
-\r
-void uci_close(uci_t * uci) {\r
-\r
- ASSERT(uci_is_ok(uci));\r
- engine_close(uci->engine);\r
- uci->engine = NULL;\r
- my_string_clear(&uci->name);\r
- my_string_clear(&uci->author);\r
-\r
- option_clear(uci->option);\r
-}\r
-\r
-// uci_clear()\r
-\r
-void uci_clear(uci_t * uci) {\r
-\r
- ASSERT(uci_is_ok(uci));\r
-\r
- ASSERT(!uci->searching);\r
-\r
- uci->best_move = MoveNone;\r
- uci->ponder_move = MoveNone;\r
-\r
- uci->score = 0;\r
- uci->depth = 0;\r
- uci->sel_depth = 0;\r
- line_clear(uci->pv);\r
-\r
- uci->best_score = 0;\r
- uci->best_depth = 0;\r
- uci->best_sel_depth = 0;\r
- line_clear(uci->best_pv);\r
-// make the default 1 instead of 0 so that info lines can be recognized by their node number 0\r
- uci->node_nb = 1;\r
- uci->time = 0.0;\r
- uci->speed = 0.0;\r
- uci->cpu = 0.0;\r
- uci->hash = 0.0;\r
- line_clear(uci->current_line);\r
-\r
- uci->root_move = MoveNone;\r
- uci->root_move_pos = 0;\r
- uci->root_move_nb = board_mobility(uci->board);\r
-\r
- uci->multipvSP=0;\r
-}\r
-\r
-// uci_send_isready()\r
-\r
-void uci_send_isready(uci_t * uci) {\r
-\r
- ASSERT(uci!=NULL);\r
-\r
- engine_send(uci->engine,"isready");\r
- uci->ready_nb++;\r
-}\r
-\r
-// uci_send_isready_sync()\r
-\r
-void uci_send_isready_sync(uci_t * uci) {\r
-\r
- char string[StringSize];\r
- int event;\r
-\r
- ASSERT(uci_is_ok(uci));\r
-\r
- // send "isready" and wait for "readyok"\r
-\r
- uci_send_isready(uci);\r
-\r
- do {\r
- engine_get(uci->engine,string);\r
- event = uci_parse(uci,string);\r
- } while (!engine_eof(Engine) && (event & EVENT_READY) == 0);\r
-}\r
-\r
-// uci_send_stop()\r
-\r
-void uci_send_stop(uci_t * uci) {\r
-\r
- ASSERT(uci_is_ok(uci));\r
-\r
- ASSERT(uci->searching);\r
- ASSERT(uci->pending_nb>=1);\r
-\r
- engine_send(Engine,"stop");\r
- uci->searching = FALSE;\r
-}\r
-\r
-// uci_send_stop_sync()\r
-\r
-void uci_send_stop_sync(uci_t * uci) {\r
-\r
- char string[StringSize];\r
- int event;\r
-\r
- ASSERT(uci_is_ok(uci));\r
-\r
- ASSERT(uci->searching);\r
- ASSERT(uci->pending_nb>=1);\r
-\r
- // send "stop" and wait for "bestmove"\r
-\r
- uci_send_stop(uci);\r
-\r
- do {\r
- engine_get(uci->engine,string);\r
- event = uci_parse(uci,string);\r
- } while (!engine_eof(Engine) && (event & EVENT_STOP) == 0);\r
-}\r
-\r
-// uci_send_ucinewgame()\r
-\r
-void uci_send_ucinewgame(uci_t * uci) {\r
-\r
- ASSERT(uci!=NULL);\r
-\r
- if (option_get_int(Option,"UCIVersion") >= 2) {\r
- engine_send(uci->engine,"ucinewgame");\r
- }\r
-}\r
-\r
-// uci_send_option()\r
-\r
-bool uci_send_option(uci_t * uci, const char option[], const char format[], ...) {\r
-\r
- char value[FormatBufferSize];\r
- option_t * opt;\r
- bool found=FALSE;\r
-\r
- ASSERT(uci_is_ok(uci));\r
- ASSERT(option!=NULL);\r
- ASSERT(format!=NULL);\r
-\r
- // format\r
-\r
- CONSTRUCT_ARG_STRING(format,value);\r
-\r
- if (UseDebug) my_log("POLYGLOT OPTION %s VALUE %s\n",option,value);\r
-\r
- opt=option_find(uci->option,option);\r
- if(opt){\r
- found=TRUE;\r
- if(!IS_BUTTON(opt->type)){\r
- if(!my_string_equal(opt->value,value)){\r
- engine_send(uci->engine,"setoption name %s value %s",\r
- opt->name,value);\r
- my_string_set(&opt->value,value);\r
- }else{\r
- my_log("POLYGLOT Not sending option \"%s\" since it "\r
- "already has the correct value.\n",opt->name);\r
- }\r
- }else{\r
- engine_send(uci->engine,"setoption name %s",opt->name);\r
- }\r
- }\r
- return found;\r
-}\r
-\r
-// uci_parse()\r
-\r
-int uci_parse(uci_t * uci, const char string[]) {\r
-\r
- int event;\r
- parse_t parse[1];\r
- char command[StringSize];\r
- char argument[StringSize];\r
-\r
- ASSERT(uci_is_ok(uci));\r
- ASSERT(string!=NULL);\r
-\r
- // init\r
-\r
- event = EVENT_NONE;\r
-\r
- // parse\r
-\r
- parse_open(parse,string);\r
-\r
- if (parse_get_word(parse,command,StringSize)) {\r
- \r
- parse_get_string(parse,argument,StringSize);\r
- if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" ARGUMENT \"%s\"\n",command,argument);\r
-\r
- if (FALSE) {\r
-\r
- } else if (my_string_equal(command,"bestmove")) {\r
-\r
- // search end\r
-\r
- ASSERT(uci->pending_nb>0);\r
-\r
- if (uci->searching && uci->pending_nb == 1) {\r
-\r
- // current search\r
-\r
- uci->searching = FALSE;\r
- uci->pending_nb--;\r
-\r
- event = parse_bestmove(uci,argument); // updates uci->best_move and uci->ponder_move\r
-\r
- } else {\r
-\r
- // obsolete search\r
-\r
- if (uci->pending_nb > 0) {\r
- uci->pending_nb--;\r
- if (uci->pending_nb == 0) event = EVENT_STOP;\r
- }\r
- }\r
-\r
- } else if (my_string_equal(command,"id")) {\r
-\r
- parse_id(uci,argument);\r
-\r
- } else if (my_string_equal(command,"info")) {\r
-\r
- // search information\r
-\r
- if (uci->searching && uci->pending_nb == 1) { // current search\r
- event = parse_info(uci,argument);\r
- }\r
-\r
- } else if (my_string_equal(command,"option")) {\r
-\r
- parse_option(uci,argument);\r
-\r
- } else if (my_string_equal(command,"readyok")) {\r
-\r
- // engine is ready\r
-\r
- ASSERT(uci->ready_nb>0);\r
-\r
- if (uci->ready_nb > 0) {\r
- uci->ready_nb--;\r
- if (uci->ready_nb == 0) event = EVENT_READY;\r
- }\r
-\r
- } else if (my_string_equal(command,"uciok")) {\r
-\r
- event = EVENT_UCI;\r
-\r
- } else {\r
-\r
- if (UseDebug) my_log("POLYGLOT unknown command \"%s\"\n",command);\r
- }\r
- }\r
-\r
- parse_close(parse);\r
-\r
- return event;\r
-}\r
-\r
-// parse_bestmove()\r
-\r
-static int parse_bestmove(uci_t * uci, const char string[]) {\r
-\r
- parse_t parse[1];\r
- char command[StringSize];\r
- char option[StringSize];\r
- char argument[StringSize];\r
- board_t board[1];\r
-\r
- ASSERT(uci_is_ok(uci));\r
- ASSERT(string!=NULL);\r
-\r
- // init\r
-\r
- strcpy(command,"bestmove");\r
-\r
- parse_open(parse,string);\r
- parse_add_keyword(parse,"ponder");\r
-\r
- // bestmove\r
-\r
- uci->bestmove[0]='\0';\r
- if (!parse_get_string(parse,argument,StringSize)) {\r
- strcpy(uci->bestmove,"nomove");\r
- return EVENT_ILLEGAL_MOVE;\r
-// my_fatal("parse_bestmove(): missing argument\n");\r
- }\r
- strncpy(uci->bestmove,argument,UciStringSize);\r
- uci->bestmove[UciStringSize-1]='\0';\r
-\r
- uci->best_move = move_from_can(argument,uci->board);\r
- if (uci->best_move == MoveNone) {\r
- return EVENT_ILLEGAL_MOVE;\r
-// my_fatal("parse_bestmove(): not a move \"%s\"\n",argument);\r
- }\r
-\r
- if(!move_is_legal(uci->best_move,uci->board)){\r
- return EVENT_ILLEGAL_MOVE;\r
- }\r
- ASSERT(uci->best_move!=MoveNone);\r
- ASSERT(move_is_legal(uci->best_move,uci->board));\r
-\r
- // loop\r
-\r
- while (parse_get_word(parse,option,StringSize)) {\r
-\r
- parse_get_string(parse,argument,StringSize);\r
-\r
- if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);\r
-\r
- if (FALSE) {\r
-\r
- } else if (my_string_equal(option,"ponder")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- board_copy(board,uci->board);\r
- move_do(board,uci->best_move);\r
-\r
- uci->ponder_move = move_from_can(argument,board);\r
- // if (uci->ponder_move == MoveNone) my_fatal("parse_bestmove(): not a move \"%s\"\n",argument);\r
-\r
- ASSERT(uci->ponder_move!=MoveNone);\r
- ASSERT(move_is_legal(uci->ponder_move,board));\r
-\r
- } else {\r
-\r
- my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);\r
- }\r
- }\r
-\r
- parse_close(parse);\r
-\r
- return EVENT_MOVE;\r
-}\r
-\r
-// parse_id()\r
-\r
-static void parse_id(uci_t * uci, const char string[]) {\r
-\r
- parse_t parse[1];\r
- char command[StringSize];\r
- char option[StringSize];\r
- char argument[StringSize];\r
-\r
- ASSERT(uci!=NULL);\r
- ASSERT(string!=NULL);\r
-\r
- // init\r
-\r
- strcpy(command,"id");\r
-\r
- parse_open(parse,string);\r
- parse_add_keyword(parse,"author");\r
- parse_add_keyword(parse,"name");\r
-\r
- // loop\r
-\r
- while (parse_get_word(parse,option,StringSize)) {\r
-\r
- parse_get_string(parse,argument,StringSize);\r
- if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);\r
-\r
- if (FALSE) {\r
- } else if (my_string_equal(option,"author")) {\r
- ASSERT(!my_string_empty(argument));\r
- my_string_set(&uci->author,argument);\r
- } else if (my_string_equal(option,"name")) {\r
- ASSERT(!my_string_empty(argument));\r
- my_string_set(&uci->name,argument);\r
- } else {\r
- my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);\r
- }\r
- }\r
-\r
- parse_close(parse);\r
-\r
- if (UseDebug) my_log("POLYGLOT engine name \"%s\" author \"%s\"\n",uci->name,uci->author);\r
-}\r
-\r
-// parse_info()\r
-\r
-static int parse_info(uci_t * uci, const char string[]) {\r
-\r
- int event;\r
- parse_t parse[1];\r
- char command[StringSize];\r
- char option[StringSize];\r
- char argument[StringSize];\r
- int n;\r
- int multipvline=0;\r
- sint64 ln;\r
-\r
-\r
- \r
- ASSERT(uci_is_ok(uci));\r
- ASSERT(string!=NULL);\r
-\r
- // init\r
-\r
- event = EVENT_NONE;\r
-\r
- strcpy(command,"info");\r
-\r
- parse_open(parse,string);\r
- parse_add_keyword(parse,"cpuload");\r
- parse_add_keyword(parse,"currline");\r
- parse_add_keyword(parse,"currmove");\r
- parse_add_keyword(parse,"currmovenumber");\r
- parse_add_keyword(parse,"depth");\r
- parse_add_keyword(parse,"hashfull");\r
- parse_add_keyword(parse,"multipv");\r
- parse_add_keyword(parse,"nodes");\r
- parse_add_keyword(parse,"nps");\r
- parse_add_keyword(parse,"pv");\r
- parse_add_keyword(parse,"refutation");\r
- parse_add_keyword(parse,"score");\r
- parse_add_keyword(parse,"seldepth");\r
- parse_add_keyword(parse,"string");\r
- parse_add_keyword(parse,"tbhits");\r
- parse_add_keyword(parse,"time");\r
-\r
- // loop\r
-\r
- while (parse_get_word(parse,option,StringSize)) {\r
-\r
- parse_get_string(parse,argument,StringSize);\r
-\r
- if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);\r
-\r
- if (FALSE) {\r
-\r
- } else if (my_string_equal(option,"cpuload")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
- ASSERT(n>=0);\r
-\r
- if (n >= 0) uci->cpu = ((double)n) / 1000.0;\r
-\r
- } else if (my_string_equal(option,"currline")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- line_from_can(uci->current_line,uci->board,argument,LineSize);\r
-\r
- } else if (my_string_equal(option,"currmove")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- uci->root_move = move_from_can(argument,uci->board);\r
- ASSERT(uci->root_move!=MoveNone);\r
-\r
- } else if (my_string_equal(option,"currmovenumber")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
- ASSERT(n>=1&&n<=uci->root_move_nb);\r
-\r
- if (n >= 1 && n <= uci->root_move_nb) {\r
- uci->root_move_pos = n - 1;\r
- ASSERT(uci->root_move_pos>=0&&uci->root_move_pos<uci->root_move_nb);\r
- }\r
-\r
- } else if (my_string_equal(option,"depth")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
- ASSERT(n>=1);\r
-\r
- if (n >= 0) {\r
- if (n > uci->depth) event |= EVENT_DEPTH;\r
- uci->depth = n;\r
- }\r
-\r
- } else if (my_string_equal(option,"hashfull")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
- ASSERT(n>=0);\r
-\r
- if (n >= 0) uci->hash = ((double)n) / 1000.0;\r
-\r
- } else if (my_string_equal(option,"multipv")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
- multipvline=n;\r
- \r
- ASSERT(n>=1);\r
-\r
- } else if (my_string_equal(option,"nodes")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- ln = my_atoll(argument);\r
- ASSERT(ln>=0);\r
-\r
- if (ln >= 0) uci->node_nb = ln;\r
-\r
- } else if (my_string_equal(option,"nps")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
- ASSERT(n>=0);\r
-\r
- if (n >= 0) uci->speed = ((double)n);\r
-\r
- } else if (my_string_equal(option,"pv")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- line_from_can(uci->pv,uci->board,argument,LineSize);\r
- event |= EVENT_PV;\r
-\r
- } else if (my_string_equal(option,"refutation")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- line_from_can(uci->pv,uci->board,argument,LineSize);\r
-\r
- } else if (my_string_equal(option,"score")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- parse_score(uci,argument);\r
-\r
- } else if (my_string_equal(option,"seldepth")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
- ASSERT(n>=0);\r
-\r
- if (n >= 0) uci->sel_depth = n;\r
-\r
- } else if (my_string_equal(option,"string")) {\r
- if(my_string_case_equal(argument,"DrawOffer")){\r
- event |= EVENT_DRAW;\r
- }else if(my_string_case_equal(argument,"Resign")){\r
- event |= EVENT_RESIGN;\r
- }else{\r
- snprintf(uci->info,sizeof(uci->info),"%s",argument);\r
- uci->info[sizeof(uci->info)-1]='\0';\r
- event|=EVENT_INFO;\r
- }\r
- // TODO: argument to EOS\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- } else if (my_string_equal(option,"tbhits")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- ln = my_atoll(argument);\r
- ASSERT(ln>=0);\r
-\r
- } else if (my_string_equal(option,"time")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
- ASSERT(n>=0);\r
-\r
- if (n >= 0) uci->time = ((double)n) / 1000.0;\r
-\r
- } else {\r
-\r
- my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);\r
- // This should probably be protected\r
- // by a "WorkAround" option.\r
- snprintf(uci->info,sizeof(uci->info),"%s %s",option,argument);\r
- uci->info[sizeof(uci->info)-1]='\0';\r
- event|=EVENT_INFO;\r
- }\r
- }\r
-\r
- parse_close(parse);\r
-\r
-\r
- // code by HGM\r
- if ((event & EVENT_PV) != 0) {\r
- uci->best_score = uci->score; \r
- uci->best_sel_depth = uci->sel_depth;\r
- line_copy(uci->best_pv,uci->pv);\r
- }\r
- if(uci->depth < uci->best_depth){\r
- // ignore lines of lower depth\r
- event &= ~EVENT_PV;\r
- } else {\r
- if(uci->depth > uci->best_depth) {\r
- // clear stack when we start new depth\r
- uci->multipvSP = 0; \r
- }\r
- uci->best_depth = uci->depth;\r
- if(multipvline >= 1) {\r
- int i;\r
- for(i=0; i<uci->multipvSP; i++) {\r
- if(uci->score == uci->multipvScore[i] && uci->pv[0] == uci->multipvMove[i]) {\r
- event &= ~EVENT_PV; // ignore duplicates\r
- }\r
- }\r
- if(event & EVENT_PV){\r
- // line is new, try to add to stack\r
- if(uci->multipvSP<MultiPVStackSize){\r
- uci->multipvMove[uci->multipvSP] = uci->pv[0];\r
- uci->multipvScore[uci->multipvSP] = uci->score;\r
- uci->multipvSP++;\r
- }else{\r
- my_fatal("parse_info(): multipv stack overflow.");\r
- }\r
- }\r
- }\r
- }\r
-\r
-\r
- return event;\r
-}\r
-\r
-// parse_option()\r
-\r
-static void parse_option(uci_t * uci, const char string[]) {\r
-\r
- option_t opt[1];\r
- parse_t parse[1];\r
- char command[StringSize];\r
- char option[StringSize];\r
- char argument[StringSize];\r
-\r
- ASSERT(uci!=NULL);\r
- ASSERT(string!=NULL);\r
-\r
- // init\r
-\r
- strcpy(command,"option");\r
-\r
- memset(opt,0,sizeof(option_t));\r
- \r
- my_string_set(&opt->value,"<empty>");\r
- my_string_set(&opt->name,"<empty>");\r
- my_string_set(&opt->default_,"<empty>");\r
- my_string_set(&opt->max,"<empty>");\r
- my_string_set(&opt->min,"<empty>");\r
- my_string_set(&opt->type,"<empty>");\r
- opt->var_nb=0;\r
- opt->mode=0;\r
- \r
- parse_open(parse,string);\r
- parse_add_keyword(parse,"default");\r
- parse_add_keyword(parse,"max");\r
- parse_add_keyword(parse,"min");\r
- parse_add_keyword(parse,"name");\r
- parse_add_keyword(parse,"type");\r
- parse_add_keyword(parse,"var");\r
-\r
- // loop\r
-\r
- while (parse_get_word(parse,option,StringSize)) {\r
- parse_get_string(parse,argument,StringSize);\r
- if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);\r
-\r
- if (FALSE) {\r
-\r
- } else if (my_string_equal(option,"default")) {\r
-\r
- // ASSERT(!my_string_empty(argument)); // HACK for Pepito\r
-\r
- if (!my_string_empty(argument)) {\r
- my_string_set(&opt->default_,argument);\r
- my_string_set(&opt->value,argument);\r
- }\r
-\r
- } else if (my_string_equal(option,"max")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
- my_string_set(&opt->max,argument);\r
-\r
- } else if (my_string_equal(option,"min")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
- my_string_set(&opt->min,argument);\r
-\r
- } else if (my_string_equal(option,"name")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- if (!my_string_empty(argument)) {\r
- my_string_set(&opt->name,argument);\r
- }\r
-\r
- } else if (my_string_equal(option,"type")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
- my_string_set(&opt->type,argument);\r
-\r
- } else if (my_string_equal(option,"var")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
- my_string_set(&opt->var[opt->var_nb++],argument);\r
- if(opt->var_nb==VarNb) break;\r
-\r
- } else {\r
-\r
- my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);\r
- }\r
- }\r
-\r
- parse_close(parse);\r
-\r
- apply_UCI3_heuristics(opt);\r
- option_insert(uci->option,opt);\r
- option_free(opt);\r
-\r
- if (UseDebug) my_log("POLYGLOT option name \"%s\" default \"%s\"\n",opt->name,opt->default_);\r
-}\r
-\r
-// parse_score()\r
-\r
-static void parse_score(uci_t * uci, const char string[]) {\r
-\r
- parse_t parse[1];\r
- char command[StringSize];\r
- char option[StringSize];\r
- char argument[StringSize];\r
- int n;\r
-\r
- ASSERT(uci_is_ok(uci));\r
- ASSERT(string!=NULL);\r
-\r
- // init\r
-\r
- strcpy(command,"score");\r
-\r
- parse_open(parse,string);\r
- parse_add_keyword(parse,"cp");\r
- parse_add_keyword(parse,"lowerbound");\r
- parse_add_keyword(parse,"mate");\r
- parse_add_keyword(parse,"upperbound");\r
-\r
- // loop\r
-\r
- while (parse_get_word(parse,option,StringSize)) {\r
-\r
- parse_get_string(parse,argument,StringSize);\r
-\r
- if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);\r
-\r
- if (FALSE) {\r
-\r
- } else if (my_string_equal(option,"cp")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
-\r
- uci->score = n;\r
-\r
- } else if (my_string_equal(option,"lowerbound")) {\r
-\r
- ASSERT(my_string_empty(argument));\r
-\r
- } else if (my_string_equal(option,"mate")) {\r
-\r
- ASSERT(!my_string_empty(argument));\r
-\r
- n = atoi(argument);\r
- ASSERT(n!=0);\r
-\r
- uci->score = mate_score(n);\r
-\r
- } else if (my_string_equal(option,"upperbound")) {\r
-\r
- ASSERT(my_string_empty(argument));\r
-\r
- } else {\r
-\r
- my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);\r
- }\r
- }\r
-\r
- parse_close(parse);\r
-}\r
-\r
-// mate_score()\r
-\r
-static int mate_score(int dist) {\r
-\r
- ASSERT(dist!=0);\r
-\r
- if (FALSE) {\r
- } else if (dist > 0) {\r
- return +option_get_int(Option,"MateScore") - (+dist) * 2 + 1;\r
- } else if (dist < 0) {\r
- return -option_get_int(Option,"MateScore") + (-dist) * 2;\r
- }\r
-\r
- return 0;\r
-}\r
-\r
-// end of uci.cpp\r
-\r
+
+// uci.c
+
+// includes
+
+#include <stdarg.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "board.h"
+#include "engine.h"
+#include "gui.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_legal.h"
+#include "option.h"
+#include "parse.h"
+#include "line.h"
+#include "uci.h"
+
+
+// constants
+
+static const bool UseDebug = FALSE;
+
+// variables
+
+uci_t Uci[1];
+
+// Hopefully the following confusion is temporary
+// Normally we should check for the engine name but this is a hack anyway
+// Some of there where provided by Marc Lacrosse
+
+const char * thread_options[]={
+ "number of threads", // toga
+ "number threads", // Deep Learning Toga
+ "threads", // glaurung, zappa, cyclone, grapefruit,
+ // Deep Shredder, Deep Junior, bright
+ "core threads", // HIARCS
+ "max cpus", // rybka
+ "cpus", // Deep Sjeng, Fruit2.3.5
+ "maxthreads", // Naum
+ NULL
+};
+
+// prototypes
+
+static bool uci_is_ok (const uci_t * uci);
+
+static int parse_bestmove (uci_t * uci, const char string[]);
+static void parse_id (uci_t * uci, const char string[]);
+static int parse_info (uci_t * uci, const char string[]);
+static void parse_option (uci_t * uci, const char string[]);
+static void parse_score (uci_t * uci, const char string[]);
+
+static int mate_score (int dist);
+
+// functions
+
+
+// uci_adapt_UCI3()
+
+static void apply_UCI3_heuristics(option_t *opt){
+ if(option_get_int(Option,"UCIVersion")>2){
+ return;
+ }
+ if(!my_string_equal(opt->type,"string")){
+ return;
+ }
+ if(!strncmp(opt->name,"UCI_",4)){
+ return;
+ }
+ if(my_string_case_contains(opt->name,"file")){
+ my_string_set(&opt->type,"file");
+ return;
+ }
+ if(my_string_case_contains(opt->name,"path")){
+ my_string_set(&opt->type,"path");
+ return;
+ }
+}
+
+// uci_set_threads()
+
+void uci_set_threads(uci_t * uci, int n) {
+ const char *thread_option=uci_thread_option(uci);
+ ASSERT(n>=1);
+ if(thread_option){
+ uci_send_option(uci,thread_option,"%d",n);
+ }
+}
+
+
+const char * uci_thread_option(uci_t * uci){
+ const char **p = thread_options;
+ const char *thread_option;
+ option_t *opt;
+ while((thread_option = *(p++))){
+ if((opt=option_find(uci->option,thread_option))){
+ return opt->name;
+ break;
+ }
+ }
+ return NULL;
+}
+
+// uci_is_ok()
+
+static bool uci_is_ok(const uci_t * uci) {
+
+ if (uci == NULL) return FALSE;
+ if (uci->engine == NULL) return FALSE;
+ if (!option_is_ok(uci->option)) return FALSE;
+ return TRUE;
+}
+
+// uci_open()
+
+void uci_open(uci_t * uci, engine_t * engine) {
+
+ char string[StringSize];
+ int event;
+
+ ASSERT(uci!=NULL);
+ ASSERT(engine!=NULL);
+
+ // init
+
+ uci->engine = engine;
+
+ uci->name = NULL;
+ my_string_set(&uci->name,"<empty>");
+ uci->author = NULL;
+ my_string_set(&uci->author,"<empty>");
+ option_init(uci->option);
+
+ uci->ready_nb = 0;
+ uci->searching = 0;
+ uci->pending_nb = 0;
+ uci->multipv_mode = FALSE;
+ board_start(uci->board);
+ uci_clear(uci);
+
+ // send "uci" and wait for "uciok"
+
+ engine_send(uci->engine,"uci");
+
+ do {
+ engine_get(uci->engine,string);
+ // Handle the case that the engine is really a WB engine somewhat gracefully.
+ if((strstr(string,"Illegal") || strstr(string,"Error"))
+ &&strstr(string,"uci")){
+ my_fatal("uci_open(): Not a UCI engine.\n");
+ }
+ event = uci_parse(uci,string);
+ } while (!engine_eof(Engine) && (event & EVENT_UCI) == 0);
+}
+
+// uci_close()
+
+void uci_close(uci_t * uci) {
+
+ ASSERT(uci_is_ok(uci));
+ engine_close(uci->engine);
+ uci->engine = NULL;
+ my_string_clear(&uci->name);
+ my_string_clear(&uci->author);
+
+ option_clear(uci->option);
+}
+
+// uci_clear()
+
+void uci_clear(uci_t * uci) {
+
+ ASSERT(uci_is_ok(uci));
+
+ ASSERT(!uci->searching);
+
+ uci->best_move = MoveNone;
+ uci->ponder_move = MoveNone;
+
+ uci->score = 0;
+ uci->depth = 0;
+ uci->sel_depth = 0;
+ line_clear(uci->pv);
+
+ uci->best_score = 0;
+ uci->best_depth = 0;
+ uci->best_sel_depth = 0;
+ line_clear(uci->best_pv);
+// make the default 1 instead of 0 so that info lines can be recognized by their node number 0
+ uci->node_nb = 1;
+ uci->time = 0.0;
+ uci->speed = 0.0;
+ uci->cpu = 0.0;
+ uci->hash = 0.0;
+ line_clear(uci->current_line);
+
+ uci->root_move = MoveNone;
+ uci->root_move_pos = 0;
+ uci->root_move_nb = board_mobility(uci->board);
+
+ uci->multipvSP=0;
+}
+
+// uci_send_isready()
+
+void uci_send_isready(uci_t * uci) {
+
+ ASSERT(uci!=NULL);
+
+ engine_send(uci->engine,"isready");
+ uci->ready_nb++;
+}
+
+// uci_send_isready_sync()
+
+void uci_send_isready_sync(uci_t * uci) {
+
+ char string[StringSize];
+ int event;
+
+ ASSERT(uci_is_ok(uci));
+
+ // send "isready" and wait for "readyok"
+
+ uci_send_isready(uci);
+
+ do {
+ engine_get(uci->engine,string);
+ event = uci_parse(uci,string);
+ } while (!engine_eof(Engine) && (event & EVENT_READY) == 0);
+}
+
+// uci_send_stop()
+
+void uci_send_stop(uci_t * uci) {
+
+ ASSERT(uci_is_ok(uci));
+
+ ASSERT(uci->searching);
+ ASSERT(uci->pending_nb>=1);
+
+ engine_send(Engine,"stop");
+ uci->searching = FALSE;
+}
+
+// uci_send_stop_sync()
+
+void uci_send_stop_sync(uci_t * uci) {
+
+ char string[StringSize];
+ int event;
+
+ ASSERT(uci_is_ok(uci));
+
+ ASSERT(uci->searching);
+ ASSERT(uci->pending_nb>=1);
+
+ // send "stop" and wait for "bestmove"
+
+ uci_send_stop(uci);
+
+ do {
+ engine_get(uci->engine,string);
+ event = uci_parse(uci,string);
+ } while (!engine_eof(Engine) && (event & EVENT_STOP) == 0);
+}
+
+// uci_send_ucinewgame()
+
+void uci_send_ucinewgame(uci_t * uci) {
+
+ ASSERT(uci!=NULL);
+
+ if (option_get_int(Option,"UCIVersion") >= 2) {
+ engine_send(uci->engine,"ucinewgame");
+ }
+}
+
+// uci_send_option()
+
+bool uci_send_option(uci_t * uci, const char option[], const char format[], ...) {
+
+ char value[FormatBufferSize];
+ option_t * opt;
+ bool found=FALSE;
+
+ ASSERT(uci_is_ok(uci));
+ ASSERT(option!=NULL);
+ ASSERT(format!=NULL);
+
+ // format
+
+ CONSTRUCT_ARG_STRING(format,value);
+
+ if (UseDebug) my_log("POLYGLOT OPTION %s VALUE %s\n",option,value);
+
+ opt=option_find(uci->option,option);
+ if(opt){
+ found=TRUE;
+ if(!IS_BUTTON(opt->type)){
+ if(!my_string_equal(opt->value,value)){
+ engine_send(uci->engine,"setoption name %s value %s",
+ opt->name,value);
+ my_string_set(&opt->value,value);
+ }else{
+ my_log("POLYGLOT Not sending option \"%s\" since it "
+ "already has the correct value.\n",opt->name);
+ }
+ }else{
+ engine_send(uci->engine,"setoption name %s",opt->name);
+ }
+ }
+ return found;
+}
+
+// uci_parse()
+
+int uci_parse(uci_t * uci, const char string[]) {
+
+ int event;
+ parse_t parse[1];
+ char command[StringSize];
+ char argument[StringSize];
+
+ ASSERT(uci_is_ok(uci));
+ ASSERT(string!=NULL);
+
+ // init
+
+ event = EVENT_NONE;
+
+ // parse
+
+ parse_open(parse,string);
+
+ if (parse_get_word(parse,command,StringSize)) {
+
+ parse_get_string(parse,argument,StringSize);
+ if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" ARGUMENT \"%s\"\n",command,argument);
+
+ if (FALSE) {
+
+ } else if (my_string_equal(command,"bestmove")) {
+
+ // search end
+
+ ASSERT(uci->pending_nb>0);
+
+ if (uci->searching && uci->pending_nb == 1) {
+
+ // current search
+
+ uci->searching = FALSE;
+ uci->pending_nb--;
+
+ event = parse_bestmove(uci,argument); // updates uci->best_move, uci->ponder_move
+
+ } else {
+
+ // obsolete search
+
+ if (uci->pending_nb > 0) {
+ uci->pending_nb--;
+ if (uci->pending_nb == 0) event = EVENT_STOP;
+ }
+ }
+
+ } else if (my_string_equal(command,"id")) {
+
+ parse_id(uci,argument);
+
+ } else if (my_string_equal(command,"info")) {
+
+ // search information
+
+ if (uci->searching && uci->pending_nb == 1) { // current search
+ event = parse_info(uci,argument);
+ }
+
+ } else if (my_string_equal(command,"option")) {
+
+ parse_option(uci,argument);
+
+ } else if (my_string_equal(command,"readyok")) {
+
+ // engine is ready
+
+ ASSERT(uci->ready_nb>0);
+
+ if (uci->ready_nb > 0) {
+ uci->ready_nb--;
+ if (uci->ready_nb == 0) event = EVENT_READY;
+ }
+
+ } else if (my_string_equal(command,"uciok")) {
+
+ event = EVENT_UCI;
+
+ } else {
+
+ if (UseDebug) my_log("POLYGLOT unknown command \"%s\"\n",command);
+ }
+ }
+
+ parse_close(parse);
+
+ return event;
+}
+
+// parse_bestmove()
+
+static int parse_bestmove(uci_t * uci, const char string[]) {
+
+ parse_t parse[1];
+ char command[StringSize];
+ char option[StringSize];
+ char argument[StringSize];
+ board_t board[1];
+
+ ASSERT(uci_is_ok(uci));
+ ASSERT(string!=NULL);
+
+ // init
+
+ strcpy(command,"bestmove");
+
+ parse_open(parse,string);
+ parse_add_keyword(parse,"ponder");
+
+ // bestmove
+
+ uci->bestmove[0]='\0';
+ if (!parse_get_string(parse,argument,StringSize)) {
+ strcpy(uci->bestmove,"nomove");
+ return EVENT_ILLEGAL_MOVE;
+// my_fatal("parse_bestmove(): missing argument\n");
+ }
+ strncpy(uci->bestmove,argument,UciStringSize);
+ uci->bestmove[UciStringSize-1]='\0';
+
+ uci->best_move = move_from_can(argument,uci->board);
+ if (uci->best_move == MoveNone) {
+ return EVENT_ILLEGAL_MOVE;
+// my_fatal("parse_bestmove(): not a move \"%s\"\n",argument);
+ }
+
+ if(!move_is_legal(uci->best_move,uci->board)){
+ return EVENT_ILLEGAL_MOVE;
+ }
+ ASSERT(uci->best_move!=MoveNone);
+ ASSERT(move_is_legal(uci->best_move,uci->board));
+
+ // loop
+
+ while (parse_get_word(parse,option,StringSize)) {
+
+ parse_get_string(parse,argument,StringSize);
+
+ if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);
+
+ if (FALSE) {
+
+ } else if (my_string_equal(option,"ponder")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ board_copy(board,uci->board);
+ move_do(board,uci->best_move);
+
+ uci->ponder_move = move_from_can(argument,board);
+
+ // if (uci->ponder_move == MoveNone) my_fatal("parse_bestmove(): not a move \"%s\"\n",argument);
+
+ ASSERT(uci->ponder_move!=MoveNone);
+ ASSERT(move_is_legal(uci->ponder_move,board));
+
+ } else {
+
+ my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);
+ }
+ }
+
+ parse_close(parse);
+
+ return EVENT_MOVE;
+}
+
+// parse_id()
+
+static void parse_id(uci_t * uci, const char string[]) {
+
+ parse_t parse[1];
+ char command[StringSize];
+ char option[StringSize];
+ char argument[StringSize];
+
+ ASSERT(uci!=NULL);
+ ASSERT(string!=NULL);
+
+ // init
+
+ strcpy(command,"id");
+
+ parse_open(parse,string);
+ parse_add_keyword(parse,"author");
+ parse_add_keyword(parse,"name");
+
+ // loop
+
+ while (parse_get_word(parse,option,StringSize)) {
+
+ parse_get_string(parse,argument,StringSize);
+ if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);
+
+ if (FALSE) {
+ } else if (my_string_equal(option,"author")) {
+ ASSERT(!my_string_empty(argument));
+ my_string_set(&uci->author,argument);
+ } else if (my_string_equal(option,"name")) {
+ ASSERT(!my_string_empty(argument));
+ my_string_set(&uci->name,argument);
+ } else {
+ my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);
+ }
+ }
+
+ parse_close(parse);
+
+ if (UseDebug) my_log("POLYGLOT engine name \"%s\" author \"%s\"\n",uci->name,uci->author);
+}
+
+// parse_info()
+
+static int parse_info(uci_t * uci, const char string[]) {
+
+ int event;
+ parse_t parse[1];
+ char command[StringSize];
+ char option[StringSize];
+ char argument[StringSize];
+ int n;
+ int multipvline=0;
+ sint64 ln;
+
+
+
+ ASSERT(uci_is_ok(uci));
+ ASSERT(string!=NULL);
+
+ // init
+
+ event = EVENT_NONE;
+
+ strcpy(command,"info");
+
+ parse_open(parse,string);
+ parse_add_keyword(parse,"cpuload");
+ parse_add_keyword(parse,"currline");
+ parse_add_keyword(parse,"currmove");
+ parse_add_keyword(parse,"currmovenumber");
+ parse_add_keyword(parse,"depth");
+ parse_add_keyword(parse,"hashfull");
+ parse_add_keyword(parse,"multipv");
+ parse_add_keyword(parse,"nodes");
+ parse_add_keyword(parse,"nps");
+ parse_add_keyword(parse,"pv");
+ parse_add_keyword(parse,"refutation");
+ parse_add_keyword(parse,"score");
+ parse_add_keyword(parse,"seldepth");
+ parse_add_keyword(parse,"string");
+ parse_add_keyword(parse,"tbhits");
+ parse_add_keyword(parse,"time");
+
+ // loop
+
+ while (parse_get_word(parse,option,StringSize)) {
+
+ parse_get_string(parse,argument,StringSize);
+
+ if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);
+
+ if (FALSE) {
+
+ } else if (my_string_equal(option,"cpuload")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+ ASSERT(n>=0);
+
+ if (n >= 0) uci->cpu = ((double)n) / 1000.0;
+
+ } else if (my_string_equal(option,"currline")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ line_from_can(uci->current_line,uci->board,argument,LineSize);
+
+ } else if (my_string_equal(option,"currmove")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ uci->root_move = move_from_can(argument,uci->board);
+ ASSERT(uci->root_move!=MoveNone);
+
+ } else if (my_string_equal(option,"currmovenumber")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+ ASSERT(n>=1&&n<=uci->root_move_nb);
+
+ if (n >= 1 && n <= uci->root_move_nb) {
+ uci->root_move_pos = n - 1;
+ ASSERT(uci->root_move_pos>=0&&uci->root_move_pos<uci->root_move_nb);
+ }
+
+ } else if (my_string_equal(option,"depth")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+ ASSERT(n>=1);
+
+ if (n >= 0) {
+ if (n > uci->depth) event |= EVENT_DEPTH;
+ uci->depth = n;
+ }
+
+ } else if (my_string_equal(option,"hashfull")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+ ASSERT(n>=0);
+
+ if (n >= 0) uci->hash = ((double)n) / 1000.0;
+
+ } else if (my_string_equal(option,"multipv")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+ multipvline=n;
+
+ ASSERT(n>=1);
+
+ } else if (my_string_equal(option,"nodes")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ ln = my_atoll(argument);
+ ASSERT(ln>=0);
+
+ if (ln >= 0) uci->node_nb = ln;
+
+ } else if (my_string_equal(option,"nps")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+ ASSERT(n>=0);
+
+ if (n >= 0) uci->speed = ((double)n);
+
+ } else if (my_string_equal(option,"pv")) {
+
+ ASSERT(!my_string_empty(argument));
+ line_from_can(uci->pv,uci->board,argument,LineSize);
+ event |= EVENT_PV;
+
+ } else if (my_string_equal(option,"refutation")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ line_from_can(uci->pv,uci->board,argument,LineSize);
+
+ } else if (my_string_equal(option,"score")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ parse_score(uci,argument);
+
+ } else if (my_string_equal(option,"seldepth")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+ ASSERT(n>=0);
+
+ if (n >= 0) uci->sel_depth = n;
+
+ } else if (my_string_equal(option,"string")) {
+ if(my_string_case_equal(argument,"DrawOffer")){
+ event |= EVENT_DRAW;
+ }else if(my_string_case_equal(argument,"Resign")){
+ event |= EVENT_RESIGN;
+ }else{
+ snprintf(uci->info,sizeof(uci->info),"%s",argument);
+ uci->info[sizeof(uci->info)-1]='\0';
+ event|=EVENT_INFO;
+ }
+ // TODO: argument to EOS
+
+ ASSERT(!my_string_empty(argument));
+
+ } else if (my_string_equal(option,"tbhits")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ ln = my_atoll(argument);
+ ASSERT(ln>=0);
+
+ } else if (my_string_equal(option,"time")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+ ASSERT(n>=0);
+
+ if (n >= 0) uci->time = ((double)n) / 1000.0;
+
+ } else {
+
+ my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);
+ // This should probably be protected
+ // by a "WorkAround" option.
+ snprintf(uci->info,sizeof(uci->info),"%s %s",option,argument);
+ uci->info[sizeof(uci->info)-1]='\0';
+ event|=EVENT_INFO;
+ }
+ }
+
+ parse_close(parse);
+
+
+ // code by HGM
+ if ((event & EVENT_PV) != 0) {
+ uci->best_score = uci->score;
+ uci->best_sel_depth = uci->sel_depth;
+ line_copy(uci->best_pv,uci->pv);
+ }
+ if(uci->depth < uci->best_depth){
+ // ignore lines of lower depth
+ event &= ~EVENT_PV;
+ } else {
+ if(uci->depth > uci->best_depth) {
+ // clear stack when we start new depth
+ uci->multipvSP = 0;
+ }
+ uci->best_depth = uci->depth;
+ if(multipvline >= 1) {
+ int i;
+ for(i=0; i<uci->multipvSP; i++) {
+ if(uci->score == uci->multipvScore[i] && uci->pv[0] == uci->multipvMove[i]) {
+ event &= ~EVENT_PV; // ignore duplicates
+ }
+ }
+ if(event & EVENT_PV){
+ // line is new, try to add to stack
+ if(uci->multipvSP<MultiPVStackSize){
+ uci->multipvMove[uci->multipvSP] = uci->pv[0];
+ uci->multipvScore[uci->multipvSP] = uci->score;
+ uci->multipvSP++;
+ }else{
+ my_fatal("parse_info(): multipv stack overflow.");
+ }
+ }
+ }
+ }
+
+
+ return event;
+}
+
+// parse_option()
+
+static void parse_option(uci_t * uci, const char string[]) {
+
+ option_t opt[1];
+ parse_t parse[1];
+ char command[StringSize];
+ char option[StringSize];
+ char argument[StringSize];
+
+ ASSERT(uci!=NULL);
+ ASSERT(string!=NULL);
+
+ // init
+
+ strcpy(command,"option");
+
+ memset(opt,0,sizeof(option_t));
+
+ my_string_set(&opt->value,"<empty>");
+ my_string_set(&opt->name,"<empty>");
+ my_string_set(&opt->default_,"<empty>");
+ my_string_set(&opt->max,"<empty>");
+ my_string_set(&opt->min,"<empty>");
+ my_string_set(&opt->type,"<empty>");
+ opt->var_nb=0;
+ opt->mode=0;
+
+ parse_open(parse,string);
+ parse_add_keyword(parse,"default");
+ parse_add_keyword(parse,"max");
+ parse_add_keyword(parse,"min");
+ parse_add_keyword(parse,"name");
+ parse_add_keyword(parse,"type");
+ parse_add_keyword(parse,"var");
+
+ // loop
+
+ while (parse_get_word(parse,option,StringSize)) {
+ parse_get_string(parse,argument,StringSize);
+ if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);
+
+ if (FALSE) {
+
+ } else if (my_string_equal(option,"default")) {
+
+ // ASSERT(!my_string_empty(argument)); // HACK for Pepito
+
+ if (!my_string_empty(argument)) {
+ my_string_set(&opt->default_,argument);
+ my_string_set(&opt->value,argument);
+ }
+
+ } else if (my_string_equal(option,"max")) {
+
+ ASSERT(!my_string_empty(argument));
+ my_string_set(&opt->max,argument);
+
+ } else if (my_string_equal(option,"min")) {
+
+ ASSERT(!my_string_empty(argument));
+ my_string_set(&opt->min,argument);
+
+ } else if (my_string_equal(option,"name")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ if (!my_string_empty(argument)) {
+ my_string_set(&opt->name,argument);
+ }
+
+ } else if (my_string_equal(option,"type")) {
+
+ ASSERT(!my_string_empty(argument));
+ my_string_set(&opt->type,argument);
+
+ } else if (my_string_equal(option,"var")) {
+
+ ASSERT(!my_string_empty(argument));
+ my_string_set(&opt->var[opt->var_nb++],argument);
+ if(opt->var_nb==VarNb) break;
+
+ } else {
+
+ my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);
+ }
+ }
+
+ parse_close(parse);
+
+ apply_UCI3_heuristics(opt);
+ option_insert(uci->option,opt);
+ option_free(opt);
+
+ if (UseDebug) my_log("POLYGLOT option name \"%s\" default \"%s\"\n",opt->name,opt->default_);
+}
+
+// parse_score()
+
+static void parse_score(uci_t * uci, const char string[]) {
+
+ parse_t parse[1];
+ char command[StringSize];
+ char option[StringSize];
+ char argument[StringSize];
+ int n;
+
+ ASSERT(uci_is_ok(uci));
+ ASSERT(string!=NULL);
+
+ // init
+
+ strcpy(command,"score");
+
+ parse_open(parse,string);
+ parse_add_keyword(parse,"cp");
+ parse_add_keyword(parse,"lowerbound");
+ parse_add_keyword(parse,"mate");
+ parse_add_keyword(parse,"upperbound");
+
+ // loop
+
+ while (parse_get_word(parse,option,StringSize)) {
+
+ parse_get_string(parse,argument,StringSize);
+
+ if (UseDebug) my_log("POLYGLOT COMMAND \"%s\" OPTION \"%s\" ARGUMENT \"%s\"\n",command,option,argument);
+
+ if (FALSE) {
+
+ } else if (my_string_equal(option,"cp")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+
+ uci->score = n;
+
+ } else if (my_string_equal(option,"lowerbound")) {
+
+ ASSERT(my_string_empty(argument));
+
+ } else if (my_string_equal(option,"mate")) {
+
+ ASSERT(!my_string_empty(argument));
+
+ n = atoi(argument);
+ ASSERT(n!=0);
+
+ uci->score = mate_score(n);
+
+ } else if (my_string_equal(option,"upperbound")) {
+
+ ASSERT(my_string_empty(argument));
+
+ } else {
+
+ my_log("POLYGLOT unknown option \"%s\" for command \"%s\"\n",option,command);
+ }
+ }
+
+ parse_close(parse);
+}
+
+// mate_score()
+
+static int mate_score(int dist) {
+
+ ASSERT(dist!=0);
+
+ if (FALSE) {
+ } else if (dist > 0) {
+ return +option_get_int(Option,"MateScore") - (+dist) * 2 + 1;
+ } else if (dist < 0) {
+ return -option_get_int(Option,"MateScore") + (-dist) * 2;
+ }
+
+ return 0;
+}
+
+// end of uci.cpp
+
-\r
-// uci.h\r
-\r
-#ifndef UCI_H\r
-#define UCI_H\r
-\r
-// includes\r
-\r
-#include "board.h"\r
-#include "engine.h"\r
-#include "line.h"\r
-#include "move.h"\r
-#include "option.h"\r
-#include "util.h"\r
-\r
-// macros\r
-\r
-// I need to make a uniform string type.\r
-\r
-#define UciStringSize 4096\r
-#define MultiPVStackSize 256\r
-\r
-// types\r
-\r
-typedef struct {\r
- \r
- engine_t * engine;\r
- \r
- const char * name;\r
- const char * author;\r
- \r
- option_list_t option[1];\r
- \r
- bool ready;\r
- int ready_nb;\r
- \r
- bool searching;\r
- int pending_nb;\r
- \r
- board_t board[1];\r
- \r
- int best_move;\r
- int ponder_move;\r
- \r
- int score;\r
- int depth;\r
- int sel_depth;\r
- move_t pv[LineSize];\r
- \r
- int best_score;\r
- int best_depth;\r
- int best_sel_depth;\r
- move_t best_pv[LineSize];\r
- char bestmove[UciStringSize];\r
- \r
- sint64 node_nb;\r
- double time;\r
- double speed;\r
- double cpu;\r
- double hash;\r
- move_t current_line[LineSize];\r
- \r
- int root_move;\r
- int root_move_pos;\r
- int root_move_nb;\r
- bool multipv_mode;\r
- int multipvSP;\r
- int multipvScore[MultiPVStackSize];\r
- move_t multipvMove[MultiPVStackSize];\r
- char info[UciStringSize];\r
-} uci_t;\r
-\r
-typedef enum {\r
- EVENT_NONE = 0,\r
- EVENT_UCI = 1 << 0,\r
- EVENT_READY = 1 << 1,\r
- EVENT_STOP = 1 << 2,\r
- EVENT_MOVE = 1 << 3,\r
- EVENT_PV = 1 << 4,\r
- EVENT_DEPTH = 1 << 5,\r
- EVENT_DRAW = 1 << 6,\r
- EVENT_RESIGN = 1 << 7,\r
- EVENT_ILLEGAL_MOVE = 1 << 8,\r
- EVENT_INFO = 1 << 9\r
-} dummy_event_t;\r
-\r
-// variables\r
-\r
-extern uci_t Uci[1];\r
-\r
-// functions\r
-\r
-extern void uci_open (uci_t * uci, engine_t * engine);\r
-extern void uci_send_isready (uci_t * uci);\r
-extern void uci_send_isready_sync (uci_t * uci);\r
-extern void uci_send_stop (uci_t * uci);\r
-extern void uci_send_stop_sync (uci_t * uci);\r
-extern void uci_send_ucinewgame (uci_t * uci);\r
-extern void uci_set_threads (uci_t * uci, int n);\r
-extern const char * uci_thread_option(uci_t * uci);\r
-extern bool uci_send_option (uci_t * uci, const char option[], const char format[], ...);\r
-extern void uci_close (uci_t * uci);\r
-extern void uci_clear (uci_t * uci);\r
-extern int uci_parse (uci_t * uci, const char string[]);\r
-\r
-#endif // !defined UCI_H\r
-\r
-// end of uci.h\r
-\r
+
+// uci.h
+
+#ifndef UCI_H
+#define UCI_H
+
+// includes
+
+#include "board.h"
+#include "engine.h"
+#include "line.h"
+#include "move.h"
+#include "option.h"
+#include "util.h"
+
+// macros
+
+// I need to make a uniform string type.
+
+#define UciStringSize 4096
+#define MultiPVStackSize 256
+
+// types
+
+typedef struct {
+
+ engine_t * engine;
+
+ const char * name;
+ const char * author;
+
+ option_list_t option[1];
+
+ bool ready;
+ int ready_nb;
+
+ bool searching;
+ int pending_nb;
+
+ board_t board[1];
+
+ int best_move;
+ int ponder_move;
+
+ int score;
+ int depth;
+ int sel_depth;
+ move_t pv[LineSize];
+
+ int best_score;
+ int best_depth;
+ int best_sel_depth;
+ move_t best_pv[LineSize];
+ char bestmove[UciStringSize];
+
+ sint64 node_nb;
+ double time;
+ double speed;
+ double cpu;
+ double hash;
+ move_t current_line[LineSize];
+
+ int root_move;
+ int root_move_pos;
+ int root_move_nb;
+ bool multipv_mode;
+ int multipvSP;
+ int multipvScore[MultiPVStackSize];
+ move_t multipvMove[MultiPVStackSize];
+ char info[UciStringSize];
+} uci_t;
+
+typedef enum {
+ EVENT_NONE = 0,
+ EVENT_UCI = 1 << 0,
+ EVENT_READY = 1 << 1,
+ EVENT_STOP = 1 << 2,
+ EVENT_MOVE = 1 << 3,
+ EVENT_PV = 1 << 4,
+ EVENT_DEPTH = 1 << 5,
+ EVENT_DRAW = 1 << 6,
+ EVENT_RESIGN = 1 << 7,
+ EVENT_ILLEGAL_MOVE = 1 << 8,
+ EVENT_INFO = 1 << 9
+} dummy_event_t;
+
+// variables
+
+extern uci_t Uci[1];
+
+// functions
+
+extern void uci_open (uci_t * uci, engine_t * engine);
+extern void uci_send_isready (uci_t * uci);
+extern void uci_send_isready_sync (uci_t * uci);
+extern void uci_send_stop (uci_t * uci);
+extern void uci_send_stop_sync (uci_t * uci);
+extern void uci_send_ucinewgame (uci_t * uci);
+extern void uci_set_threads (uci_t * uci, int n);
+extern const char * uci_thread_option(uci_t * uci);
+extern bool uci_send_option (uci_t * uci, const char option[], const char format[], ...);
+extern void uci_close (uci_t * uci);
+extern void uci_clear (uci_t * uci);
+extern int uci_parse (uci_t * uci, const char string[]);
+
+#endif // !defined UCI_H
+
+// end of uci.h
+
-\r
-// util.c\r
-\r
-// includes\r
-\r
-#ifdef _WIN32\r
-#include <windows.h>\r
-#include <direct.h>\r
-#else\r
-#include <unistd.h>\r
-#endif\r
-\r
-#include <ctype.h>\r
-#include <errno.h>\r
-#include <math.h>\r
-#include <stdarg.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-#include <time.h>\r
-#ifndef _MSC_VER\r
-#include <sys/time.h>\r
-#endif\r
-\r
-#include "main.h"\r
-#include "util.h"\r
-#include "gui.h"\r
-\r
-// macros\r
-\r
-#define StringSize 4096\r
-\r
-// variables\r
-\r
-static bool Error;\r
-\r
-FILE * LogFile=NULL;\r
-\r
-// functions\r
-\r
-// util_init()\r
-\r
-void util_init() {\r
-\r
- Error = FALSE;\r
-\r
- // init log file\r
-\r
- LogFile = NULL;\r
-\r
- // switch file buffering off\r
-\r
- setbuf(stdin,NULL);\r
- setbuf(stdout,NULL);\r
-}\r
-\r
-// my_random_init()\r
-\r
-void my_random_init() {\r
- srand(time(NULL));\r
-}\r
-\r
-// my_random_int()\r
-\r
-int my_random_int(int n) {\r
-\r
- int r;\r
-\r
- ASSERT(n>0);\r
-\r
- r = ((int)floor(my_random_double()*((double)n)));\r
- ASSERT(r>=0&&r<n);\r
-\r
- return r;\r
-}\r
-\r
-// my_random_double()\r
-\r
-double my_random_double() {\r
-\r
- double r;\r
-\r
- r = ((double)rand()) / (((double)RAND_MAX) + 1.0);\r
- ASSERT(r>=0.0&&r<1.0);\r
-\r
- return r;\r
-}\r
-\r
-// my_atoll()\r
-\r
-sint64 my_atoll(const char string[]) {\r
-\r
- sint64 n;\r
-\r
- sscanf(string,S64_FORMAT,&n);\r
-\r
- return n;\r
-}\r
-\r
-// my_round()\r
-\r
-int my_round(double x) {\r
-\r
- return ((int)floor(x+0.5));\r
-}\r
-\r
-// my_malloc()\r
-\r
-void * my_malloc(size_t size) {\r
-\r
- void * address;\r
-\r
- ASSERT(size>0);\r
-\r
- address = malloc(size);\r
- if (address == NULL) my_fatal("my_malloc(): malloc(): %s\n",strerror(errno));\r
-\r
- return address;\r
-}\r
-\r
-// my_realloc()\r
-\r
-void * my_realloc(void * address, size_t size) {\r
-\r
- ASSERT(address!=NULL);\r
- ASSERT(size>0);\r
-\r
- address = realloc(address,size);\r
- if (address == NULL) my_fatal("my_realloc(): realloc(): %s\n",strerror(errno));\r
-\r
- return address;\r
-}\r
-\r
-// my_free()\r
-\r
-void my_free(void * address) {\r
-\r
- ASSERT(address!=NULL);\r
-\r
- free(address);\r
-}\r
-\r
-// my_log_open()\r
-\r
-void my_log_open(const char file_name[]) {\r
-\r
- ASSERT(file_name!=NULL);\r
-\r
- LogFile = fopen(file_name,"a");\r
-#ifndef _WIN32\r
-//line buffering doesn't work too well in MSVC and/or windows \r
- if (LogFile != NULL) setvbuf(LogFile,NULL,_IOLBF,0); // line buffering\r
-#endif\r
- if(LogFile!=NULL){\r
- my_log("POLYGLOT *** LOGFILE OPENED ***\n");\r
- }\r
-\r
-}\r
-\r
-// my_log_close()\r
-\r
-void my_log_close() {\r
-\r
- if (LogFile != NULL) fclose(LogFile);\r
- LogFile=NULL;\r
-}\r
-\r
-// my_log()\r
-\r
-void my_log(const char format[], ...) {\r
- \r
- char string[FormatBufferSize];\r
- \r
- ASSERT(format!=NULL);\r
-\r
-// format\r
-\r
- CONSTRUCT_ARG_STRING(format,string);\r
- \r
-\r
- if (LogFile != NULL) {\r
- fprintf(LogFile,"%.3f %s",now_real(),string);\r
-#ifdef _WIN32\r
- fflush(LogFile);\r
-#endif\r
- }\r
-}\r
-\r
-// my_fatal()\r
-\r
-void my_fatal(const char format[], ...) {\r
-\r
- char string[FormatBufferSize];\r
-\r
- ASSERT(format!=NULL);\r
-\r
-// format\r
-\r
- CONSTRUCT_ARG_STRING(format,string);\r
- \r
- my_log("POLYGLOT %s",string);\r
- // This should be gui_send but this does not work.\r
- // Why?\r
-\r
- printf("tellusererror POLYGLOT: %s",string);\r
-\r
- if (Error) { // recursive error\r
- my_log("POLYGLOT *** RECURSIVE ERROR ***\n");\r
- exit(EXIT_FAILURE);\r
- // abort();\r
- } else {\r
- Error = TRUE;\r
- quit();\r
- }\r
-}\r
-\r
-// my_file_read_line()\r
-\r
-bool my_file_read_line(FILE * file, char string[], int size) {\r
-\r
- int src, dst;\r
- int c;\r
-\r
- ASSERT(file!=NULL);\r
- ASSERT(string!=NULL);\r
- ASSERT(size>0);\r
-\r
- if (fgets(string,size,file) == NULL) {\r
- if (feof(file)) {\r
- return FALSE;\r
- } else { // error\r
- my_fatal("my_file_read_line(): fgets(): %s\n",strerror(errno));\r
- }\r
- }\r
-\r
- // remove CRs and LFs\r
-\r
- src = 0;\r
- dst = 0;\r
- \r
- while ((c=string[src++]) != '\0') {\r
- if (c != '\r' && c != '\n') string[dst++] = c;\r
- }\r
-\r
- string[dst] = '\0';\r
-\r
- return TRUE;\r
-}\r
-\r
-// my_file_join()\r
-\r
-void my_path_join(char *join_path, const char *path, const char *file){\r
- char separator;\r
-#ifdef _WIN32\r
- separator='\\';\r
-#else\r
- separator='/';\r
-#endif\r
- snprintf(join_path,StringSize,"%s%c%s",path,separator,file);\r
- join_path[StringSize-1]='\0';\r
-}\r
-\r
-// my_mkdir()\r
-\r
-int my_mkdir(const char *path){\r
- int ret;\r
-#ifdef _WIN32\r
- ret=_mkdir(path);\r
-#else\r
- ret=mkdir(path,S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);\r
-#endif\r
- return ret;\r
-}\r
-\r
-\r
-// my_string_empty()\r
-\r
-bool my_string_empty(const char string[]) {\r
-\r
- return string == NULL || string[0] == '\0';\r
-}\r
-\r
-// my_string_whitespace()\r
-\r
-bool my_string_whitespace(const char string[]){\r
- int pos=0;\r
- while(string[pos]!='\0'){\r
- if(string[pos]!=' ' && string[pos]!='\t'){\r
- return FALSE;\r
- }\r
- pos++;\r
- }\r
- return TRUE;\r
-}\r
-\r
-// my_string_equal()\r
-\r
-bool my_string_equal(const char string_1[], const char string_2[]) {\r
-\r
- ASSERT(string_1!=NULL);\r
- ASSERT(string_2!=NULL);\r
-\r
- return strcmp(string_1,string_2) == 0;\r
-}\r
-\r
-// my_string_case_equal()\r
-\r
-bool my_string_case_equal(const char string_1[], const char string_2[]) {\r
-\r
- int c1, c2;\r
-\r
- ASSERT(string_1!=NULL);\r
- ASSERT(string_2!=NULL);\r
-\r
- while (TRUE) {\r
-\r
- c1 = *string_1++;\r
- c2 = *string_2++;\r
-\r
- if (tolower(c1) != tolower(c2)) return FALSE;\r
- if (c1 == '\0') return TRUE;\r
- }\r
-\r
- return FALSE;\r
-}\r
-\r
-// my_strtolower()\r
-\r
-void my_string_tolower(char *dst, const char *src){\r
- int c;\r
- ASSERT(src!=NULL);\r
- ASSERT(dst!=NULL);\r
- while((c=*(src++))){\r
- *dst=tolower(c);\r
- dst++;\r
- }\r
- *(dst++)='\0';\r
-}\r
-\r
-// my_string_case_contains()\r
-\r
-const char* my_string_case_contains(const char string_1[], const char string_2[]){\r
- \r
- char tmp1[StringSize];\r
- char tmp2[StringSize];\r
- char *where;\r
-\r
-\r
- ASSERT(string_1!=NULL);\r
- ASSERT(string_2!=NULL);\r
-\r
- my_string_tolower(tmp1,string_1);\r
- my_string_tolower(tmp2,string_2);\r
-\r
- where=strstr(tmp1,tmp2);\r
- if(where){\r
- return string_1+(where-tmp1);\r
- }\r
- return NULL;\r
-\r
- \r
-}\r
-\r
-\r
-// my_strdup()\r
-\r
-char * my_strdup(const char string[]) {\r
-\r
- char * address;\r
-\r
- ASSERT(string!=NULL);\r
-\r
- // strdup() is not ANSI C\r
-\r
- address = (char *) my_malloc(strlen(string)+1);\r
- strcpy(address,string);\r
-\r
- return address;\r
-}\r
-\r
-// my_string_clear()\r
-\r
-void my_string_clear(const char * * variable) {\r
-\r
- ASSERT(variable!=NULL);\r
-\r
- if (*variable != NULL) {\r
- my_free((void*)(*variable));\r
- *variable = NULL;\r
- }\r
-}\r
-\r
-// my_string_set()\r
-\r
-void my_string_set(const char * * variable, const char string[]) {\r
-\r
- ASSERT(variable!=NULL);\r
- ASSERT(string!=NULL);\r
-\r
- if (*variable != NULL) my_free((void*)(*variable));\r
- *variable = my_strdup(string);\r
-}\r
-\r
-// now_real()\r
-\r
-double now_real() {\r
-#ifndef _WIN32\r
- struct timeval tv[1];\r
- struct timezone tz[1];\r
-\r
- tz->tz_minuteswest = 0;\r
- tz->tz_dsttime = 0; // DST_NONE not declared in linux\r
-\r
- if (gettimeofday(tv,tz) == -1) {\r
- my_fatal("now_real(): gettimeofday(): %s\n",strerror(errno));\r
- }\r
-\r
- return tv->tv_sec + tv->tv_usec * 1E-6;\r
-#else\r
- struct _timeb timeptr;\r
- _ftime(&timeptr);\r
- return(timeptr.time+((double)timeptr.millitm)/1000.0);\r
-// return (double) GetTickCount() / 1000.0; // we can do better here:-)\r
-#endif\r
-}\r
-\r
-\r
-// my_timer_reset()\r
-\r
-void my_timer_reset(my_timer_t * timer) {\r
-\r
- ASSERT(timer!=NULL);\r
-\r
- timer->start_real = 0.0;\r
- timer->elapsed_real = 0.0;\r
- timer->running = FALSE;\r
-}\r
-\r
-// my_timer_start()\r
-\r
-void my_timer_start(my_timer_t * timer) {\r
-// timer->start_real = 0.0;\r
- timer->elapsed_real = 0.0;\r
-// timer->running = FALSE;\r
- ASSERT(timer!=NULL);\r
-\r
- timer->running = TRUE;\r
- timer->start_real = now_real();\r
-}\r
-\r
-// my_timer_stop()\r
-\r
-void my_timer_stop(my_timer_t * timer) {\r
-\r
- ASSERT(timer!=NULL);\r
-\r
- ASSERT(timer->running);\r
-\r
- timer->elapsed_real += now_real() - timer->start_real;\r
- timer->start_real = 0.0;\r
- timer->running = FALSE;\r
-}\r
-\r
-// my_timer_elapsed_real()\r
-\r
-double my_timer_elapsed_real(const my_timer_t * timer) {\r
-\r
- double elapsed;\r
-\r
- ASSERT(timer!=NULL);\r
-\r
- elapsed = timer->elapsed_real;\r
- if (timer->running) elapsed += now_real() - timer->start_real;\r
-\r
- if (elapsed < 0.0) elapsed = 0.0;\r
-\r
- return elapsed;\r
-}\r
-\r
-\r
-void my_dequote(char *out, const char *in, const char *special){\r
- const char *p; \r
- char *q;\r
- char c;\r
- p=in;\r
- q=out;\r
- while((c=*(p++))){\r
- if(c=='\\' && strchr(special,*p)){\r
- *(q++)=*(p++);\r
- }else{\r
- *(q++)=c;\r
- }\r
- }\r
- *q='\0';\r
-}\r
-\r
-void my_quote(char *out, const char *in, const char *special){\r
- const char *p;\r
- char *q;\r
- char c;\r
- p=in;\r
- q=out;\r
- while(q-out< StringSize-2 && (c=*(p++))){\r
- if(c=='\\'){\r
- if(*p!=0 && strchr(special,*p)){\r
- *(q++)='\\';\r
- }\r
- }else if(strchr(special,c)){\r
- *(q++)='\\';\r
- }\r
- *(q++)=c;\r
- }\r
- *q='\0';\r
-}\r
-\r
-\r
-void my_sleep(int msec){\r
-#ifndef _WIN32\r
- struct timespec tm;\r
- tm.tv_sec=msec/1000;\r
- tm.tv_nsec=1000000*(msec%1000);\r
- nanosleep(&tm,NULL);\r
-#else\r
- Sleep(msec);\r
-#endif\r
-}\r
+
+// util.c
+
+// includes
+
+#ifdef _WIN32
+#include <windows.h>
+#include <direct.h>
+#else
+#include <unistd.h>
+#endif
+
+#include <ctype.h>
+#include <errno.h>
+#include <math.h>
+#include <stdarg.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#ifndef _MSC_VER
+#include <sys/time.h>
+#endif
+
+#include "main.h"
+#include "util.h"
+#include "gui.h"
+
+// macros
+
+#define StringSize 4096
+
+// variables
+
+static bool Error;
+
+FILE * LogFile=NULL;
+
+// functions
+
+// util_init()
+
+void util_init() {
+
+ Error = FALSE;
+
+ // init log file
+
+ LogFile = NULL;
+
+ // switch file buffering off
+
+ setbuf(stdin,NULL);
+ setbuf(stdout,NULL);
+}
+
+// my_random_init()
+
+void my_random_init() {
+ srand(time(NULL));
+}
+
+// my_random_int()
+
+int my_random_int(int n) {
+
+ int r;
+
+ ASSERT(n>0);
+
+ r = ((int)floor(my_random_double()*((double)n)));
+ ASSERT(r>=0&&r<n);
+
+ return r;
+}
+
+// my_random_double()
+
+double my_random_double() {
+
+ double r;
+
+ r = ((double)rand()) / (((double)RAND_MAX) + 1.0);
+ ASSERT(r>=0.0&&r<1.0);
+
+ return r;
+}
+
+// my_atoll()
+
+sint64 my_atoll(const char string[]) {
+
+ sint64 n;
+
+ sscanf(string,S64_FORMAT,&n);
+
+ return n;
+}
+
+// my_round()
+
+int my_round(double x) {
+
+ return ((int)floor(x+0.5));
+}
+
+// my_malloc()
+
+void * my_malloc(size_t size) {
+
+ void * address;
+
+ ASSERT(size>0);
+
+ address = malloc(size);
+ if (address == NULL) my_fatal("my_malloc(): malloc(): %s\n",strerror(errno));
+
+ return address;
+}
+
+// my_realloc()
+
+void * my_realloc(void * address, size_t size) {
+
+ ASSERT(address!=NULL);
+ ASSERT(size>0);
+
+ address = realloc(address,size);
+ if (address == NULL) my_fatal("my_realloc(): realloc(): %s\n",strerror(errno));
+
+ return address;
+}
+
+// my_free()
+
+void my_free(void * address) {
+
+ ASSERT(address!=NULL);
+
+ free(address);
+}
+
+// my_log_open()
+
+void my_log_open(const char file_name[]) {
+
+ ASSERT(file_name!=NULL);
+
+ LogFile = fopen(file_name,"a");
+#ifndef _WIN32
+//line buffering doesn't work too well in MSVC and/or windows
+ if (LogFile != NULL) setvbuf(LogFile,NULL,_IOLBF,0); // line buffering
+#endif
+ if(LogFile!=NULL){
+ my_log("POLYGLOT *** LOGFILE OPENED ***\n");
+ }
+
+}
+
+// my_log_close()
+
+void my_log_close() {
+
+ if (LogFile != NULL) fclose(LogFile);
+ LogFile=NULL;
+}
+
+// my_log()
+
+void my_log(const char format[], ...) {
+
+ char string[FormatBufferSize];
+
+ ASSERT(format!=NULL);
+
+// format
+
+ CONSTRUCT_ARG_STRING(format,string);
+
+
+ if (LogFile != NULL) {
+ fprintf(LogFile,"%.3f %s",now_real(),string);
+#ifdef _WIN32
+ fflush(LogFile);
+#endif
+ }
+}
+
+// my_fatal()
+
+void my_fatal(const char format[], ...) {
+
+ char string[FormatBufferSize];
+
+ ASSERT(format!=NULL);
+
+// format
+
+ CONSTRUCT_ARG_STRING(format,string);
+
+ my_log("POLYGLOT %s",string);
+ // This should be gui_send but this does not work.
+ // Why?
+
+ printf("tellusererror POLYGLOT: %s",string);
+
+ if (Error) { // recursive error
+ my_log("POLYGLOT *** RECURSIVE ERROR ***\n");
+ exit(EXIT_FAILURE);
+ // abort();
+ } else {
+ Error = TRUE;
+ quit();
+ }
+}
+
+// my_file_read_line()
+
+bool my_file_read_line(FILE * file, char string[], int size) {
+
+ int src, dst;
+ int c;
+
+ ASSERT(file!=NULL);
+ ASSERT(string!=NULL);
+ ASSERT(size>0);
+
+ if (fgets(string,size,file) == NULL) {
+ if (feof(file)) {
+ return FALSE;
+ } else { // error
+ my_fatal("my_file_read_line(): fgets(): %s\n",strerror(errno));
+ }
+ }
+
+ // remove CRs and LFs
+
+ src = 0;
+ dst = 0;
+
+ while ((c=string[src++]) != '\0') {
+ if (c != '\r' && c != '\n') string[dst++] = c;
+ }
+
+ string[dst] = '\0';
+
+ return TRUE;
+}
+
+// my_file_join()
+
+void my_path_join(char *join_path, const char *path, const char *file){
+ char separator;
+#ifdef _WIN32
+ separator='\\';
+#else
+ separator='/';
+#endif
+ snprintf(join_path,StringSize,"%s%c%s",path,separator,file);
+ join_path[StringSize-1]='\0';
+}
+
+// my_mkdir()
+
+int my_mkdir(const char *path){
+ int ret;
+#ifdef _WIN32
+ ret=_mkdir(path);
+#else
+ ret=mkdir(path,S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);
+#endif
+ return ret;
+}
+
+
+// my_string_empty()
+
+bool my_string_empty(const char string[]) {
+
+ return string == NULL || string[0] == '\0';
+}
+
+// my_string_whitespace()
+
+bool my_string_whitespace(const char string[]){
+ int pos=0;
+ while(string[pos]!='\0'){
+ if(string[pos]!=' ' && string[pos]!='\t'){
+ return FALSE;
+ }
+ pos++;
+ }
+ return TRUE;
+}
+
+// my_string_equal()
+
+bool my_string_equal(const char string_1[], const char string_2[]) {
+
+ ASSERT(string_1!=NULL);
+ ASSERT(string_2!=NULL);
+
+ return strcmp(string_1,string_2) == 0;
+}
+
+// my_string_case_equal()
+
+bool my_string_case_equal(const char string_1[], const char string_2[]) {
+
+ int c1, c2;
+
+ ASSERT(string_1!=NULL);
+ ASSERT(string_2!=NULL);
+
+ while (TRUE) {
+
+ c1 = *string_1++;
+ c2 = *string_2++;
+
+ if (tolower(c1) != tolower(c2)) return FALSE;
+ if (c1 == '\0') return TRUE;
+ }
+
+ return FALSE;
+}
+
+// my_strtolower()
+
+void my_string_tolower(char *dst, const char *src){
+ int c;
+ ASSERT(src!=NULL);
+ ASSERT(dst!=NULL);
+ while((c=*(src++))){
+ *dst=tolower(c);
+ dst++;
+ }
+ *(dst++)='\0';
+}
+
+// my_string_case_contains()
+
+const char* my_string_case_contains(const char string_1[], const char string_2[]){
+
+ char tmp1[StringSize];
+ char tmp2[StringSize];
+ char *where;
+
+
+ ASSERT(string_1!=NULL);
+ ASSERT(string_2!=NULL);
+
+ my_string_tolower(tmp1,string_1);
+ my_string_tolower(tmp2,string_2);
+
+ where=strstr(tmp1,tmp2);
+ if(where){
+ return string_1+(where-tmp1);
+ }
+ return NULL;
+
+
+}
+
+
+// my_strdup()
+
+char * my_strdup(const char string[]) {
+
+ char * address;
+
+ ASSERT(string!=NULL);
+
+ // strdup() is not ANSI C
+
+ address = (char *) my_malloc(strlen(string)+1);
+ strcpy(address,string);
+
+ return address;
+}
+
+// my_string_clear()
+
+void my_string_clear(const char * * variable) {
+
+ ASSERT(variable!=NULL);
+
+ if (*variable != NULL) {
+ my_free((void*)(*variable));
+ *variable = NULL;
+ }
+}
+
+// my_string_set()
+
+void my_string_set(const char * * variable, const char string[]) {
+
+ ASSERT(variable!=NULL);
+ ASSERT(string!=NULL);
+
+ if (*variable != NULL) my_free((void*)(*variable));
+ *variable = my_strdup(string);
+}
+
+// now_real()
+
+double now_real() {
+#ifndef _WIN32
+ struct timeval tv[1];
+ struct timezone tz[1];
+
+ tz->tz_minuteswest = 0;
+ tz->tz_dsttime = 0; // DST_NONE not declared in linux
+
+ if (gettimeofday(tv,tz) == -1) {
+ my_fatal("now_real(): gettimeofday(): %s\n",strerror(errno));
+ }
+
+ return tv->tv_sec + tv->tv_usec * 1E-6;
+#else
+ struct _timeb timeptr;
+ _ftime(&timeptr);
+ return(timeptr.time+((double)timeptr.millitm)/1000.0);
+// return (double) GetTickCount() / 1000.0; // we can do better here:-)
+#endif
+}
+
+
+// my_timer_reset()
+
+void my_timer_reset(my_timer_t * timer) {
+
+ ASSERT(timer!=NULL);
+
+ timer->start_real = 0.0;
+ timer->elapsed_real = 0.0;
+ timer->running = FALSE;
+}
+
+// my_timer_start()
+
+void my_timer_start(my_timer_t * timer) {
+// timer->start_real = 0.0;
+ timer->elapsed_real = 0.0;
+// timer->running = FALSE;
+ ASSERT(timer!=NULL);
+
+ timer->running = TRUE;
+ timer->start_real = now_real();
+}
+
+// my_timer_stop()
+
+void my_timer_stop(my_timer_t * timer) {
+
+ ASSERT(timer!=NULL);
+
+ ASSERT(timer->running);
+
+ timer->elapsed_real += now_real() - timer->start_real;
+ timer->start_real = 0.0;
+ timer->running = FALSE;
+}
+
+// my_timer_elapsed_real()
+
+double my_timer_elapsed_real(const my_timer_t * timer) {
+
+ double elapsed;
+
+ ASSERT(timer!=NULL);
+
+ elapsed = timer->elapsed_real;
+ if (timer->running) elapsed += now_real() - timer->start_real;
+
+ if (elapsed < 0.0) elapsed = 0.0;
+
+ return elapsed;
+}
+
+
+void my_dequote(char *out, const char *in, const char *special){
+ const char *p;
+ char *q;
+ char c;
+ p=in;
+ q=out;
+ while((c=*(p++))){
+ if(c=='\\' && strchr(special,*p)){
+ *(q++)=*(p++);
+ }else{
+ *(q++)=c;
+ }
+ }
+ *q='\0';
+}
+
+void my_quote(char *out, const char *in, const char *special){
+ const char *p;
+ char *q;
+ char c;
+ p=in;
+ q=out;
+ while(q-out< StringSize-2 && (c=*(p++))){
+ if(c=='\\'){
+ if(*p!=0 && strchr(special,*p)){
+ *(q++)='\\';
+ }
+ }else if(strchr(special,c)){
+ *(q++)='\\';
+ }
+ *(q++)=c;
+ }
+ *q='\0';
+}
+
+
+void my_sleep(int msec){
+#ifndef _WIN32
+ struct timespec tm;
+ tm.tv_sec=msec/1000;
+ tm.tv_nsec=1000000*(msec%1000);
+ nanosleep(&tm,NULL);
+#else
+ Sleep(msec);
+#endif
+}
-\r
-// util.h\r
-\r
-#ifndef UTIL_H\r
-#define UTIL_H\r
-\r
-// includes\r
-\r
-#include <stdio.h>\r
-#include <sys/types.h>\r
-#include <sys/timeb.h>\r
-#include <sys/stat.h>\r
-\r
-// defines\r
-\r
-#ifndef EXIT_SUCCES\r
-#define EXIT_SUCCES 0\r
-#endif\r
-\r
-#ifndef STDIN_FILENO\r
-#define STDIN_FILENO 0\r
-#endif\r
-\r
-#ifndef STDOUT_FILENO\r
-#define STDOUT_FILENO 1\r
-#endif\r
-\r
-\r
-#undef FALSE\r
-#define FALSE 0\r
-\r
-#undef TRUE\r
-#define TRUE 1\r
-\r
-#ifdef DEBUG\r
-# undef DEBUG\r
-# define DEBUG TRUE\r
-#else\r
-# define DEBUG FALSE\r
-#endif\r
-\r
-#if defined(_MSC_VER) || defined(__MINGW32__) || defined(__MINGW64__)\r
-# define S64_FORMAT "%I64d"\r
-# define U64_FORMAT "%016I64X"\r
-#else\r
-# define S64_FORMAT "%lld"\r
-# define U64_FORMAT "%016llX"\r
-#endif\r
-\r
-// macros\r
-\r
-#ifdef _MSC_VER\r
-# define S64(u) (u##i64)\r
-# define U64(u) (u##ui64)\r
-#else\r
-# define S64(u) (u##LL)\r
-# define U64(u) (u##ULL)\r
-#endif\r
-\r
-#undef ASSERT\r
-#if DEBUG\r
-# define ASSERT(a) { if (!(a)) my_fatal("file \"%s\", line %d, assertion \"" #a "\" failed\n",__FILE__,__LINE__); }\r
-#else\r
-# define ASSERT(a)\r
-#endif\r
-\r
-#ifdef _WIN32\r
-#define snprintf _snprintf\r
-#endif\r
-\r
-#define FormatBufferSize 4096\r
-\r
-#ifdef _MSC_VER\r
-#define vsnprintf _vsnprintf\r
-#endif\r
-\r
-#define CONSTRUCT_ARG_STRING(format,buf) \\r
- { \\r
- va_list arg_list; \\r
- int written; \\r
- va_start(arg_list,format); \\r
- written=vsnprintf(buf, \\r
- sizeof(buf), \\r
- format, \\r
- arg_list); \\r
- va_end(arg_list); \\r
- buf[sizeof(buf)-1]='\0'; \\r
- if(written>=sizeof(buf) || written<0){ \\r
- my_fatal("write_buffer overflow: file \"%s\", line %d\n", \\r
- __FILE__,__LINE__); \\r
- } \\r
- } \\r
-\r
-#define TO_BOOL(string) ((my_string_case_equal(string,"false") || \\r
- my_string_equal(string,"0"))?FALSE:TRUE)\r
-\r
-#define IS_BOOL(string) (my_string_case_equal(string,"false")|| \\r
- my_string_case_equal(string,"true") || \\r
- my_string_case_equal(string,"1") || \\r
- my_string_case_equal(string,"0"))\r
-// types\r
-\r
-typedef signed char sint8;\r
-typedef unsigned char uint8;\r
-\r
-typedef signed short sint16;\r
-typedef unsigned short uint16;\r
-\r
-typedef signed int sint32;\r
-typedef unsigned int uint32;\r
-\r
-typedef int bool;\r
-\r
-#ifdef _MSC_VER\r
- typedef signed __int64 sint64;\r
- typedef unsigned __int64 uint64;\r
-#else\r
- typedef signed long long int sint64;\r
- typedef unsigned long long int uint64;\r
-#endif\r
-\r
-typedef struct {\r
- double start_real;\r
- double elapsed_real;\r
- bool running;\r
-} my_timer_t;\r
-\r
-\r
-// functions\r
-\r
-extern void util_init ();\r
-\r
-extern void my_random_init ();\r
-extern int my_random_int (int n);\r
-extern double my_random_double ();\r
-\r
-extern sint64 my_atoll (const char string[]);\r
-\r
-extern int my_round (double x);\r
-\r
-extern void * my_malloc (size_t size);\r
-extern void * my_realloc (void * address, size_t size);\r
-extern void my_free (void * address);\r
-\r
-extern void my_log_open (const char file_name[]);\r
-extern void my_log_close ();\r
-\r
-extern void my_log (const char format[], ...);\r
-extern void my_fatal (const char format[], ...);\r
-\r
-extern bool my_file_read_line (FILE * file, char string[], int size);\r
-extern void my_path_join (char *join_path, const char *path, const char *file);\r
-\r
-extern int my_mkdir (const char *path);\r
-\r
-extern bool my_string_empty (const char string[]);\r
-extern bool my_string_whitespace (const char string[]);\r
-extern bool my_string_equal (const char string_1[], const char string_2[]);\r
-extern bool my_string_case_equal (const char string_1[], const char string_2[]);\r
-extern const char* my_string_case_contains(const char haystack[], \r
- const char needle[]);\r
-\r
-\r
-extern bool my_string_to_lower (char dst[], const char src[]);\r
-\r
-extern char * my_strdup (const char string[]);\r
-\r
-extern void my_string_clear (const char * * variable);\r
-extern void my_string_set (const char * * variable, const char string[]);\r
-\r
-extern double now_real ();\r
-\r
-extern void my_timer_reset (my_timer_t * timer);\r
-extern void my_timer_start (my_timer_t * timer);\r
-extern void my_timer_stop (my_timer_t * timer);\r
-\r
-extern double my_timer_elapsed_real (const my_timer_t * timer);\r
-\r
-extern char * my_error();\r
-\r
-extern void my_dequote (char *out, \r
- const char *in, \r
- const char *special);\r
-extern void my_quote (char *out, \r
- const char *in, \r
- const char *special);\r
-\r
-extern void my_sleep (int msec);\r
-\r
-#endif // !defined UTIL_H\r
-\r
-// end of util.h\r
+
+// util.h
+
+#ifndef UTIL_H
+#define UTIL_H
+
+// includes
+
+#include <stdio.h>
+#include <sys/types.h>
+#include <sys/timeb.h>
+#include <sys/stat.h>
+
+// defines
+
+#ifndef EXIT_SUCCES
+#define EXIT_SUCCES 0
+#endif
+
+#ifndef STDIN_FILENO
+#define STDIN_FILENO 0
+#endif
+
+#ifndef STDOUT_FILENO
+#define STDOUT_FILENO 1
+#endif
+
+
+#undef FALSE
+#define FALSE 0
+
+#undef TRUE
+#define TRUE 1
+
+#ifdef DEBUG
+# undef DEBUG
+# define DEBUG TRUE
+#else
+# define DEBUG FALSE
+#endif
+
+#if defined(_MSC_VER) || defined(__MINGW32__) || defined(__MINGW64__)
+# define S64_FORMAT "%I64d"
+# define U64_FORMAT "%016I64X"
+#else
+# define S64_FORMAT "%lld"
+# define U64_FORMAT "%016llX"
+#endif
+
+// macros
+
+#ifdef _MSC_VER
+# define S64(u) (u##i64)
+# define U64(u) (u##ui64)
+#else
+# define S64(u) (u##LL)
+# define U64(u) (u##ULL)
+#endif
+
+#undef ASSERT
+#if DEBUG
+# define ASSERT(a) { if (!(a)) my_fatal("file \"%s\", line %d, assertion \"" #a "\" failed\n",__FILE__,__LINE__); }
+#else
+# define ASSERT(a)
+#endif
+
+#ifdef _WIN32
+#define snprintf _snprintf
+#endif
+
+#define FormatBufferSize 4096
+#define StringSize 4096
+
+#ifdef _MSC_VER
+#define vsnprintf _vsnprintf
+#endif
+
+#define CONSTRUCT_ARG_STRING(format,buf) \
+ { \
+ va_list arg_list; \
+ int written; \
+ va_start(arg_list,format); \
+ written=vsnprintf(buf, \
+ sizeof(buf), \
+ format, \
+ arg_list); \
+ va_end(arg_list); \
+ buf[sizeof(buf)-1]='\0'; \
+ if(written>=sizeof(buf) || written<0){ \
+ my_fatal("write_buffer overflow: file \"%s\", line %d\n", \
+ __FILE__,__LINE__); \
+ } \
+ } \
+
+#define TO_BOOL(string) ((my_string_case_equal(string,"false") || \
+ my_string_equal(string,"0"))?FALSE:TRUE)
+
+#define IS_BOOL(string) (my_string_case_equal(string,"false")|| \
+ my_string_case_equal(string,"true") || \
+ my_string_case_equal(string,"1") || \
+ my_string_case_equal(string,"0"))
+// types
+
+typedef signed char sint8;
+typedef unsigned char uint8;
+
+typedef signed short sint16;
+typedef unsigned short uint16;
+
+typedef signed int sint32;
+typedef unsigned int uint32;
+
+typedef int bool;
+
+#ifdef _MSC_VER
+ typedef signed __int64 sint64;
+ typedef unsigned __int64 uint64;
+#else
+ typedef signed long long int sint64;
+ typedef unsigned long long int uint64;
+#endif
+
+typedef struct {
+ double start_real;
+ double elapsed_real;
+ bool running;
+} my_timer_t;
+
+
+// functions
+
+extern void util_init ();
+
+extern void my_random_init ();
+extern int my_random_int (int n);
+extern double my_random_double ();
+
+extern sint64 my_atoll (const char string[]);
+
+extern int my_round (double x);
+
+extern void * my_malloc (size_t size);
+extern void * my_realloc (void * address, size_t size);
+extern void my_free (void * address);
+
+extern void my_log_open (const char file_name[]);
+extern void my_log_close ();
+
+extern void my_log (const char format[], ...);
+extern void my_fatal (const char format[], ...);
+
+extern bool my_file_read_line (FILE * file, char string[], int size);
+extern void my_path_join (char *join_path, const char *path, const char *file);
+
+extern int my_mkdir (const char *path);
+
+extern bool my_string_empty (const char string[]);
+extern bool my_string_whitespace (const char string[]);
+extern bool my_string_equal (const char string_1[], const char string_2[]);
+extern bool my_string_case_equal (const char string_1[], const char string_2[]);
+extern const char* my_string_case_contains(const char haystack[],
+ const char needle[]);
+
+
+extern bool my_string_to_lower (char dst[], const char src[]);
+
+extern char * my_strdup (const char string[]);
+
+extern void my_string_clear (const char * * variable);
+extern void my_string_set (const char * * variable, const char string[]);
+
+extern double now_real ();
+
+extern void my_timer_reset (my_timer_t * timer);
+extern void my_timer_start (my_timer_t * timer);
+extern void my_timer_stop (my_timer_t * timer);
+
+extern double my_timer_elapsed_real (const my_timer_t * timer);
+
+extern char * my_error();
+
+extern void my_dequote (char *out,
+ const char *in,
+ const char *special);
+extern void my_quote (char *out,
+ const char *in,
+ const char *special);
+
+extern void my_sleep (int msec);
+
+#endif // !defined UTIL_H
+
+// end of util.h
-\r
-// xboard2uci.c\r
-\r
-// includes\r
-\r
-#include <errno.h>\r
-#include <stdio.h>\r
-#include <stdlib.h>\r
-#include <string.h>\r
-#include <time.h>\r
-\r
-#include "board.h"\r
-#include "book.h"\r
-#include "colour.h"\r
-#include "engine.h"\r
-#include "fen.h"\r
-#include "game.h"\r
-#include "gui.h"\r
-#include "line.h"\r
-#include "main.h"\r
-#include "move.h"\r
-#include "move_do.h"\r
-#include "move_legal.h"\r
-#include "option.h"\r
-#include "parse.h"\r
-#include "san.h"\r
-#include "uci.h"\r
-#include "uci2uci.h"\r
-#include "util.h"\r
-#include "xboard2uci.h"\r
-\r
-// defines\r
-\r
-#define StringSize 4096\r
-\r
-// constants\r
-\r
-static const bool UseDebug = FALSE;\r
-static const bool DelayPong = FALSE;\r
-\r
-// types\r
-\r
-typedef struct {\r
- int state;\r
- bool computer[ColourNb];\r
- int exp_move;\r
- int resign_nb;\r
- my_timer_t timer[1];\r
-} state_t;\r
-\r
-typedef struct {\r
- bool has_feature_memory;\r
- bool has_feature_smp;\r
- bool has_feature_egt;\r
- bool analyse;\r
- bool computer;\r
- const char * name;\r
- bool ics;\r
- bool new_hack; // "new" is a C++ keyword\r
- bool ponder;\r
- int ping;\r
- bool post;\r
- int proto_ver;\r
- bool result;\r
-\r
- int mps;\r
- double base;\r
- double inc;\r
- \r
- bool time_limit;\r
- double time_max;\r
- \r
- bool depth_limit;\r
- int depth_max;\r
- \r
- double my_time;\r
- double opp_time;\r
-\r
- int node_rate;\r
-} xb_t;\r
-\r
-typedef enum { WAIT, THINK, PONDER, ANALYSE } dummy_state_t;\r
-\r
-// variables\r
-\r
-static state_t State[1];\r
-static xb_t XB[1];\r
-\r
-// prototypes\r
-\r
-static void comp_move (int move);\r
-static void move_step (int move);\r
-static void board_update ();\r
-\r
-static void mess ();\r
-static void no_mess (int move);\r
-\r
-static void search_update ();\r
-static void search_clear ();\r
-static void update_remaining_time();\r
-static int report_best_score();\r
-static bool kibitz_throttle (bool searching);\r
-static void start_protected_command();\r
-static void end_protected_command();\r
-\r
-static bool active ();\r
-static bool ponder ();\r
-static bool ponder_ok (int ponder_move);\r
-\r
-static void stop_search ();\r
-\r
-static void send_board (int extra_move);\r
-static void send_pv ();\r
-static void send_info ();\r
-\r
-static void send_xboard_options ();\r
-\r
-static void learn (int result);\r
-\r
-\r
-// functions\r
-\r
-// xboard2uci_init()\r
-\r
-void xboard2uci_init() {\r
- // init\r
-\r
- game_clear(Game);\r
-\r
- // state\r
-\r
- State->state = WAIT;\r
-\r
- State->computer[White] = FALSE;\r
- State->computer[Black] = TRUE;\r
-\r
- State->exp_move = MoveNone;\r
- State->resign_nb = 0;\r
- my_timer_reset(State->timer);\r
-\r
- // yes there are engines that do not have the "Hash" option....\r
- XB->has_feature_memory= (option_find(Uci->option,"Hash")!=NULL);\r
- XB->has_feature_smp = (uci_thread_option(Uci)!=NULL);\r
- // TODO: support for other types of table bases\r
- XB->has_feature_egt = (option_find(Uci->option,"NalimovPath")!=NULL);\r
- XB->analyse = FALSE;\r
- XB->computer = FALSE;\r
- XB->name = NULL;\r
- my_string_set(&XB->name,"<empty>");\r
- XB->ics = FALSE;\r
- XB->new_hack = TRUE;\r
- XB->ping = -1;\r
- XB->ponder = FALSE;\r
- XB->post = FALSE;\r
- XB->proto_ver = 1;\r
- XB->result = FALSE;\r
-\r
- XB->mps = 0;\r
- XB->base = 300.0;\r
- XB->inc = 0.0;\r
-\r
- XB->time_limit = FALSE;\r
- XB->time_max = 5.0;\r
-\r
- XB->depth_limit = FALSE;\r
- XB->depth_max = 127;\r
-\r
- XB->my_time = 300.0;\r
- XB->opp_time = 300.0;\r
-\r
- XB->node_rate = -1;\r
-}\r
-\r
-// xboard2uci_gui_step()\r
-\r
-void xboard2uci_gui_step(char string[]) {\r
-\r
- int move;\r
- char move_string[256];\r
- board_t board[1];\r
-\r
- if (FALSE) {\r
- \r
- } else if (match(string,"accepted *")) {\r
-\r
- // ignore\r
-\r
- } else if (match(string,"analyze")) {\r
-\r
- State->computer[White] = FALSE;\r
- State->computer[Black] = FALSE;\r
-\r
- XB->analyse = TRUE;\r
- XB->new_hack = FALSE;\r
- ASSERT(!XB->result);\r
- XB->result = FALSE;\r
-\r
- mess();\r
-\r
- } else if (match(string,"bk")) {\r
-\r
- if (option_get_bool(Option,"Book")) {\r
- game_get_board(Game,board);\r
- book_disp(board);\r
- }\r
-\r
- } else if (match(string,"black")) {\r
-\r
- if (colour_is_black(game_turn(Game))) {\r
-\r
- State->computer[White] = TRUE;\r
- State->computer[Black] = FALSE;\r
-\r
- XB->new_hack = TRUE;\r
- XB->result = FALSE;\r
-\r
- mess();\r
- }\r
-\r
- } else if (match(string,"computer")) {\r
-\r
- XB->computer = TRUE;\r
-\r
- } else if (match(string,"draw")) {\r
- if(option_find(Uci->option,"UCI_DrawOffers")){\r
- my_log("POLYGLOT draw from XB received");\r
- uci_send_option(Uci,"DrawOffer","%s","draw");}\r
- } else if (match(string,"easy")) {\r
-\r
- XB->ponder = FALSE;\r
-\r
- mess();\r
-\r
- } else if (match(string,"edit")) {\r
-\r
- // refuse\r
-\r
- gui_send(GUI,"Error (unknown command): %s",string);\r
-\r
- } else if (match(string,"exit")) {\r
-\r
- State->computer[White] = FALSE;\r
- State->computer[Black] = FALSE;\r
-\r
- XB->analyse = FALSE;\r
-\r
- mess();\r
-\r
- } else if (match(string,"force")) {\r
-\r
- State->computer[White] = FALSE;\r
- State->computer[Black] = FALSE;\r
-\r
- mess();\r
-\r
- } else if (match(string,"go")) {\r
-\r
- State->computer[game_turn(Game)] = TRUE;\r
- State->computer[colour_opp(game_turn(Game))] = FALSE;\r
-\r
- XB->new_hack = FALSE;\r
- ASSERT(!XB->result);\r
- XB->result = FALSE;\r
-\r
- mess();\r
-\r
- } else if (match(string,"hard")) {\r
-\r
- XB->ponder = TRUE;\r
-\r
- mess();\r
-\r
- } else if (match(string,"hint")) {\r
-\r
- if (option_get_bool(Option,"Book")) {\r
-\r
- game_get_board(Game,board);\r
- move = book_move(board,FALSE);\r
-\r
- if (move != MoveNone && move_is_legal(move,board)) {\r
- move_to_san(move,board,move_string,256);\r
- gui_send(GUI,"Hint: %s",move_string);\r
- }\r
- }\r
-\r
- } else if (match(string,"ics *")) {\r
-\r
- XB->ics = TRUE;\r
-\r
- } else if (match(string,"level * *:* *")) {\r
-\r
- XB->mps = atoi(Star[0]);\r
- XB->base = ((double)atoi(Star[1])) * 60.0 + ((double)atoi(Star[2]));\r
- XB->inc = ((double)atoi(Star[3]));\r
-\r
- } else if (match(string,"level * * *")) {\r
-\r
- XB->mps = atoi(Star[0]);\r
- XB->base = ((double)atoi(Star[1])) * 60.0;\r
- XB->inc = ((double)atoi(Star[2]));\r
-\r
- } else if (match(string,"name *")) {\r
-\r
- my_string_set(&XB->name,Star[0]);\r
-\r
- } else if (match(string,"new")) {\r
-\r
- uci_send_isready_sync(Uci);\r
- my_log("POLYGLOT NEW GAME\n");\r
-\r
- option_set(Option,"Chess960","false");\r
-\r
- game_clear(Game);\r
-\r
- if (XB->analyse) {\r
- State->computer[White] = FALSE;\r
- State->computer[Black] = FALSE;\r
- } else {\r
- State->computer[White] = FALSE;\r
- State->computer[Black] = TRUE;\r
- }\r
-\r
- XB->new_hack = TRUE;\r
- XB->result = FALSE;\r
-\r
- XB->depth_limit = FALSE;\r
- XB->node_rate=-1;\r
-\r
- XB->computer = FALSE;\r
- my_string_set(&XB->name,"<empty>");\r
-\r
- board_update();\r
- mess();\r
-\r
- uci_send_ucinewgame(Uci);\r
-\r
- } else if (match(string,"nopost")) {\r
-\r
- XB->post = FALSE;\r
-\r
- } else if (match(string,"otim *")) {\r
-\r
- XB->opp_time = ((double)atoi(Star[0])) / 100.0;\r
- if (XB->opp_time < 0.0) XB->opp_time = 0.0;\r
-\r
- } else if (match(string,"pause")) {\r
-\r
- // refuse\r
-\r
- gui_send(GUI,"Error (unknown command): %s",string);\r
-\r
- } else if (match(string,"ping *")) {\r
-\r
- // HACK; TODO: answer only after an engine move\r
-\r
- if (DelayPong) {\r
- if (XB->ping >= 0) gui_send(GUI,"pong %d",XB->ping); // HACK: get rid of old ping\r
- XB->ping = atoi(Star[0]);\r
- uci_send_isready_sync(Uci);\r
- } else {\r
- ASSERT(XB->ping==-1);\r
- gui_send(GUI,"pong %s",Star[0]);\r
- }\r
- } else if (match(string,"nps *")) {\r
- \r
- // fake WB play-by-nodes mode\r
- XB->node_rate = atoi(Star[0]);\r
- } else if (match(string,"playother")) {\r
-\r
- State->computer[game_turn(Game)] = FALSE;\r
- State->computer[colour_opp(game_turn(Game))] = TRUE;\r
-\r
- XB->new_hack = FALSE;\r
- ASSERT(!XB->result);\r
- XB->result = FALSE;\r
-\r
- mess();\r
-\r
- } else if (match(string,"post")) {\r
-\r
- XB->post = TRUE;\r
-\r
- } else if (match(string,"protover *")) {\r
- XB->proto_ver = atoi(Star[0]);\r
- ASSERT(XB->proto_ver>=2);\r
- send_xboard_options();\r
-\r
- } else if (match(string,"quit")) {\r
- my_log("POLYGLOT *** \"quit\" from GUI ***\n");\r
- quit();\r
- } else if (match(string,"random")) {\r
-\r
- // ignore\r
-\r
- } else if (match(string,"rating * *")) {\r
-\r
- // ignore\r
-\r
- } else if (match(string,"remove")) {\r
-\r
- if (game_pos(Game) >= 2) {\r
-\r
- game_goto(Game,game_pos(Game)-2);\r
-\r
- ASSERT(!XB->new_hack);\r
- XB->new_hack = FALSE; // HACK?\r
- XB->result = FALSE;\r
-\r
- board_update();\r
- mess();\r
- }\r
-\r
- } else if (match(string,"rejected *")) {\r
-\r
- // ignore\r
-\r
- } else if (match(string,"reset")) { // protover 3?\r
-\r
- // refuse\r
-\r
- gui_send(GUI,"Error (unknown command): %s",string);\r
-\r
- } else if (FALSE\r
- || match(string,"result * {*}")\r
- || match(string,"result * {* }")\r
- || match(string,"result * { *}")\r
- || match(string,"result * { * }")) {\r
-\r
- my_log("POLYGLOT GAME END\n");\r
-\r
- XB->result = TRUE;\r
-\r
- mess();\r
-\r
- // book learning\r
-\r
- if (option_get_bool(Option,"Book") &&\r
- option_get_bool(Option,"BookLearn")) {\r
-\r
- if (FALSE) {\r
- } else if (my_string_equal(Star[0],"1-0")) {\r
- learn(+1);\r
- } else if (my_string_equal(Star[0],"0-1")) {\r
- learn(-1);\r
- } else if (my_string_equal(Star[0],"1/2-1/2")) {\r
- learn(0);\r
- }\r
- }\r
- } else if (match(string,"resume")) {\r
-\r
- // refuse\r
-\r
- gui_send(GUI,"Error (unknown command): %s",string);\r
-\r
- } else if (match(string,"option *=*") ||\r
- match(string,"option * =*") ||\r
- match(string,"option *= *") ||\r
- match(string,"option * = *")\r
- ){\r
- char *name=Star[0];\r
- char *value=Star[1];\r
- if(match(name, "Polyglot *")){\r
- char *pg_name=Star[0];\r
- polyglot_set_option(pg_name,value);\r
- }else{\r
- option_t *opt=option_find(Uci->option,name);\r
- if(opt){\r
- if(my_string_case_equal(opt->type,"check")){\r
- value=my_string_equal(value,"1")?"true":"false";\r
- }\r
- start_protected_command();\r
- uci_send_option(Uci, name, "%s", value);\r
- end_protected_command();\r
- }else{\r
- gui_send(GUI,"Error (unknown option): %s",name); \r
- }\r
- }\r
- } else if (match(string,"option *")){\r
- char *name=Star[0];\r
- if(match(name, "Polyglot *")){\r
- char *pg_name=Star[0];\r
- polyglot_set_option(pg_name,"<empty>");\r
- }else{ \r
- start_protected_command();\r
- // value is ignored\r
- if(!uci_send_option(Uci, name, "%s", "<empty>")){\r
- gui_send(GUI,"Error (unknown option): %s",name); \r
- }; \r
- end_protected_command();\r
- }\r
- } else if (XB->has_feature_smp && match(string,"cores *")){\r
- int cores=atoi(Star[0]);\r
- if(cores>=1){\r
- // updating the number of cores\r
- my_log("POLYGLOT setting the number of cores to %d\n",cores);\r
- start_protected_command();\r
- uci_set_threads(Uci,cores); \r
- end_protected_command();\r
- } else{\r
- // refuse\r
- gui_send(GUI,"Error (unknown command): %s",string);\r
- }\r
- } else if (XB->has_feature_egt && match(string,"egtpath * *")){\r
- char *type=Star[0];\r
- char *path=Star[1];\r
- if(!my_string_case_equal(type,"nalimov")){\r
- // refuse\r
- gui_send(GUI,"Error (unsupported table base format): %s",string);\r
- }else if(my_string_empty(path)){\r
- // refuse\r
- gui_send(GUI,"Error (unknown command): %s",string);\r
- }else{\r
- // updating NalimovPath\r
- my_log("POLYGLOT setting the Nalimov path to %s\n",path);\r
- start_protected_command();\r
- uci_send_option(Uci,"NalimovPath","%s",path);\r
- end_protected_command();\r
- }\r
- } else if (XB->has_feature_memory && match(string,"memory *")){\r
- int memory = atoi(Star[0]);\r
- int nalimov_cache;\r
- int real_memory;\r
- if(memory>=1){\r
- // updating the available memory\r
- option_t *opt;\r
- my_log("POLYGLOT setting the amount of memory to %dMb\n",memory);\r
- if((opt=option_find(Uci->option,"NalimovCache"))){\r
- nalimov_cache=atoi(opt->value);\r
- }else{\r
- nalimov_cache=0;\r
- }\r
- my_log("POLYGLOT Nalimov Cache is %dMb\n",nalimov_cache);\r
- real_memory=memory-nalimov_cache;\r
- if(real_memory>0){\r
- start_protected_command();\r
- uci_send_option(Uci,"Hash", "%d", real_memory);\r
- end_protected_command();\r
- }\r
- }else{\r
- // refuse\r
- gui_send(GUI,"Error (unknown command): %s",string);\r
- }\r
-\r
- } else if (match(string,"sd *")) {\r
-\r
- XB->depth_limit = TRUE;\r
- XB->depth_max = atoi(Star[0]);\r
-\r
- } else if (match(string,"setboard *")) {\r
-\r
- my_log("POLYGLOT FEN %s\n",Star[0]);\r
-\r
- if (!game_init(Game,Star[0])) my_fatal("xboard_step(): bad FEN \"%s\"\n",Star[0]);\r
-\r
- State->computer[White] = FALSE;\r
- State->computer[Black] = FALSE;\r
-\r
- XB->new_hack = TRUE; // HACK?\r
- XB->result = FALSE;\r
-\r
- board_update();\r
- mess();\r
-\r
- } else if (match(string,"st *")) {\r
-\r
- XB->time_limit = TRUE;\r
- XB->time_max = ((double)atoi(Star[0]));\r
-\r
- } else if (match(string,"time *")) {\r
-\r
- XB->my_time = ((double)atoi(Star[0])) / 100.0;\r
- if (XB->my_time < 0.0) XB->my_time = 0.0;\r
-\r
- } else if (match(string,"undo")) {\r
-\r
- if (game_pos(Game) >= 1) {\r
-\r
- game_goto(Game,game_pos(Game)-1);\r
-\r
- ASSERT(!XB->new_hack);\r
- XB->new_hack = FALSE; // HACK?\r
- XB->result = FALSE;\r
-\r
- board_update();\r
- mess();\r
- }\r
-\r
- } else if (match(string,"usermove *")) {\r
-\r
- game_get_board(Game,board);\r
- move = move_from_san(Star[0],board);\r
-\r
- if (move != MoveNone && move_is_legal(move,board)) {\r
-\r
- XB->new_hack = FALSE;\r
- ASSERT(!XB->result);\r
- XB->result = FALSE;\r
-\r
- move_step(move);\r
- no_mess(move);\r
-\r
- } else {\r
-\r
- gui_send(GUI,"Illegal move: %s",Star[0]);\r
- }\r
-\r
- } else if (match(string,"variant *")) {\r
-\r
- if (my_string_equal(Star[0],"fischerandom")) {\r
- option_set(Option,"Chess960","true");\r
- } else {\r
- option_set(Option,"Chess960","false");\r
- }\r
-\r
- } else if (match(string,"white")) {\r
-\r
- if (colour_is_white(game_turn(Game))) {\r
-\r
- State->computer[White] = FALSE;\r
- State->computer[Black] = TRUE;\r
-\r
- XB->new_hack = TRUE;\r
- XB->result = FALSE;\r
-\r
- mess();\r
- }\r
-\r
- } else if (match(string,"xboard")) {\r
-\r
- // ignore\r
-\r
- } else if (match(string,".")) { // analyse info\r
-\r
- if (State->state == ANALYSE) {\r
- int depth=Uci->best_depth;//HACK: don't clear engine-output window...\r
-\r
- ASSERT(Uci->searching);\r
- ASSERT(Uci->pending_nb>=1);\r
-\r
- if (Uci->root_move != MoveNone && move_is_legal(Uci->root_move,Uci->board)) {\r
- move_to_san(Uci->root_move,Uci->board,move_string,256);\r
- gui_send(GUI,"stat01: %.0f "S64_FORMAT" %d %d %d %s",Uci->time*100.0,Uci->node_nb,/*Uci->*/depth,Uci->root_move_nb-(Uci->root_move_pos+1),Uci->root_move_nb,move_string);\r
- } else {\r
- gui_send(GUI,"stat01: %.0f "S64_FORMAT" %d %d %d",Uci->time*100.0,Uci->node_nb,/*Uci->*/depth,0,0); // HACK\r
- }\r
- }\r
-\r
- } else if (match(string,"?")) { // move now\r
-\r
- if (State->state == THINK) {\r
-\r
- ASSERT(Uci->searching);\r
- ASSERT(Uci->pending_nb>=1);\r
-\r
- // HACK: just send "stop" to the engine\r
-\r
- if (Uci->searching) {\r
- my_log("POLYGLOT STOP SEARCH\n");\r
- engine_send(Engine,"stop");\r
- }\r
- }\r
-\r
- } else { // unknown command, maybe a move?\r
-\r
- game_get_board(Game,board);\r
- move = move_from_san(string,board);\r
-\r
- if (move != MoveNone && move_is_legal(move,board)) {\r
-\r
- XB->new_hack = FALSE;\r
- ASSERT(!XB->result);\r
- XB->result = FALSE;\r
-\r
- move_step(move);\r
- no_mess(move);\r
-\r
- } else if (move != MoveNone) {\r
-\r
- gui_send(GUI,"Illegal move: %s",string);\r
-\r
- } else {\r
-\r
- gui_send(GUI,"Error (unknown command): %s",string);\r
- }\r
- }\r
- return;\r
-}\r
-\r
-// xboard2uci_engine_step()\r
-\r
-void xboard2uci_engine_step(char string[]) {\r
-\r
- int event;\r
- board_t board[1];\r
- event = uci_parse(Uci,string);\r
-\r
- // react to events\r
-\r
- if ((event & EVENT_READY) != 0) {\r
-\r
- // the engine is now ready\r
-\r
- if (!Uci->ready) {\r
- Uci->ready = TRUE;\r
- // if (XB->proto_ver >= 2) xboard_send(XBoard,"feature done=1");\r
- }\r
-\r
- if (!DelayPong && XB->ping >= 0) {\r
- gui_send(GUI,"pong %d",XB->ping);\r
- XB->ping = -1;\r
- }\r
- }\r
-\r
- if ((event & EVENT_MOVE) != 0 && State->state == THINK) {\r
-\r
- // the engine is playing a move\r
-\r
- // MEGA HACK: estimate remaining time because XBoard won't send it!\r
-\r
- my_timer_stop(State->timer);\r
-\r
- XB->my_time -= my_timer_elapsed_real(State->timer);\r
- XB->my_time += XB->inc;\r
- if (XB->mps != 0 && (game_move_nb(Game) + 1) % XB->mps == 0) XB->my_time += XB->base;\r
-\r
- if (XB->my_time < 0.0) XB->my_time = 0.0;\r
-\r
- // play the engine move\r
-\r
- comp_move(Uci->best_move);\r
- }\r
-\r
- if ((event & EVENT_PV) != 0) {\r
-\r
- // the engine has sent a new PV\r
-\r
- send_pv();\r
- }\r
- if ((event & EVENT_INFO) != 0) {\r
-\r
- // the engine has sent info\r
-\r
- send_info();\r
- }\r
- if((event & (EVENT_DRAW|EVENT_RESIGN))!=0){\r
- my_log("POYGLOT draw offer/resign from engine\n");\r
- if(option_find(Uci->option,"UCI_DrawOffers")){\r
- if(event & EVENT_DRAW)\r
- gui_send(GUI,"offer draw");\r
- else\r
- gui_send(GUI,"resign");\r
- }\r
- }\r
- if(((event & EVENT_ILLEGAL_MOVE)!=0) && (State->state == THINK)){\r
- game_get_board(Game,board);\r
- if(board->turn==White){\r
- gui_send(GUI,"0-1 {polyglot: resign"\r
- " (illegal engine move by white: %s)}",Uci->bestmove);\r
- }else{\r
- gui_send(GUI,"1-0 {polyglot: resign"\r
- " (illegal engine move by black: %s)}",Uci->bestmove);\r
- }\r
- board_disp(board);\r
- XB->result = TRUE;\r
- mess();\r
- }\r
-}\r
-\r
-// format_xboard_option_line\r
-\r
-void format_xboard_option_line(char * option_line, option_t *opt){\r
- int j;\r
- char option_string[StringSize];\r
- char *tmp;\r
- strcpy(option_line,"");\r
- // buffer overflow alert\r
- strcat(option_line,"feature option=\"");\r
- if(opt->mode&PG){\r
- strcat(option_line,"Polyglot ");\r
- }\r
- sprintf(option_string,"%s",opt->name);\r
- strcat(option_line,option_string);\r
- sprintf(option_string," -%s",opt->type);\r
- strcat(option_line,option_string);\r
- if(!IS_BUTTON(opt->type) && strcmp(opt->type,"combo")){\r
- if(strcmp(opt->type,"check")){\r
- sprintf(option_string," %s",opt->value);\r
- }else{\r
- sprintf(option_string," %d",\r
- my_string_case_equal(opt->value,"true")||\r
- my_string_equal(opt->value,"1")\r
- ?1:0);\r
- }\r
- strcat(option_line,option_string);\r
- }\r
- if(IS_SPIN(opt->type)){\r
- sprintf(option_string," %s",opt->min);\r
- strcat(option_line,option_string);\r
- }\r
- if(IS_SPIN(opt->type)){\r
- sprintf(option_string," %s",opt->max);\r
- strcat(option_line,option_string);\r
- }\r
- for(j=0;j<opt->var_nb;j++){\r
- if(!strcmp(opt->var[j],opt->value)){\r
- sprintf(option_string," *%s",opt->var[j]);\r
- }else{\r
- sprintf(option_string," %s",opt->var[j]);\r
- }\r
- strcat(option_line,option_string);\r
- if(j!=opt->var_nb-1){\r
- strcat(option_line," ///");\r
- }\r
- }\r
- strcat(option_line,"\"");\r
- if(option_get_bool(Option,"WbWorkArounds") &&\r
- (tmp=strstr(option_line,"Draw"))){\r
- *tmp='d';\r
- my_log("POLYGLOT Decapitalizing \"Draw\" in option \"%s\"\n",\r
- opt->name);\r
- }\r
-}\r
-\r
-// send_xboard_options()\r
-\r
-static void send_xboard_options(){\r
-\r
- \r
- gui_send(GUI,"feature done=0");\r
- \r
- gui_send(GUI,"feature analyze=1");\r
- gui_send(GUI,"feature colors=0");\r
- gui_send(GUI,"feature draw=1");\r
- gui_send(GUI,"feature ics=1");\r
- gui_send(GUI,"feature myname=\"%s\"",\r
- option_get_string(Option,"EngineName"));\r
- gui_send(GUI,"feature name=1");\r
- gui_send(GUI,"feature pause=0");\r
- gui_send(GUI,"feature ping=1");\r
- gui_send(GUI,"feature playother=1");\r
- gui_send(GUI,"feature sigint=1");\r
- gui_send(GUI,"feature reuse=1");\r
- gui_send(GUI,"feature san=0");\r
- gui_send(GUI,"feature setboard=1");\r
- gui_send(GUI,"feature sigint=0");\r
- gui_send(GUI,"feature sigterm=0");\r
- gui_send(GUI,"feature time=1");\r
- gui_send(GUI,"feature usermove=1");\r
- gui_send(GUI,"feature nps=1");\r
- if (XB->has_feature_memory){\r
- gui_send(GUI,"feature memory=1");\r
- }else{\r
- gui_send(GUI,"feature memory=0");\r
- }\r
- if (XB->has_feature_smp){\r
- gui_send(GUI,"feature smp=1");\r
- }else{\r
- gui_send(GUI,"feature smp=0");\r
- }\r
- if (XB->has_feature_egt){\r
- // TODO: support for other types of table bases\r
- gui_send(GUI,"feature egt=\"nalimov\"");\r
- }else{\r
- gui_send(GUI,"feature egt=\"\"");\r
- }\r
- \r
- if (option_find(Uci->option,"UCI_Chess960")) {\r
- gui_send(GUI,"feature variants=\"normal,fischerandom\"");\r
- } else {\r
- gui_send(GUI,"feature variants=\"normal\"");\r
- }\r
-\r
- xboard2uci_send_options();\r
-}\r
-\r
-void xboard2uci_send_options(){\r
- char option_line[StringSize]="";\r
- const char * name;\r
- option_t *opt;\r
- \r
- option_start_iter(Uci->option);\r
- while((opt=option_next(Uci->option))){\r
- if(my_string_case_equal(opt->name,"UCI_AnalyseMode")) continue;\r
- if(my_string_case_equal(opt->name,"UCI_Opponent")) continue;\r
- if(my_string_case_equal(opt->name,"UCI_Chess960")) continue;\r
- if(my_string_case_equal(opt->name,"UCI_ShowCurrLine")) continue;\r
- if(my_string_case_equal(opt->name,"UCI_ShowRefutations")) continue;\r
- if(my_string_case_equal(opt->name,"UCI_ShredderbasesPath")) continue;\r
- if(my_string_case_equal(opt->name,"UCI_SetPositionValue")) continue;\r
- if(my_string_case_equal(opt->name,"UCI_DrawOffers")) continue;\r
- if(my_string_case_equal(opt->name,"Ponder")) continue;\r
- if(my_string_case_equal(opt->name,"Hash")) continue;\r
- if(my_string_case_equal(opt->name,"NalimovPath")) continue;\r
- if((name=uci_thread_option(Uci))!=NULL &&\r
- my_string_case_equal(opt->name,name)) continue;\r
- format_xboard_option_line(option_line,opt);\r
- \r
- gui_send(GUI,"%s",option_line);\r
- }\r
- \r
- \r
- option_start_iter(Option);\r
- while((opt=option_next(Option))){\r
- if(opt->mode &XBOARD){\r
- format_xboard_option_line(option_line,opt);\r
- gui_send(GUI,"%s",option_line);\r
- }\r
- } \r
- gui_send(GUI,"feature done=1"); \r
- \r
-}\r
-\r
-// report_best_score()\r
-\r
-static int report_best_score(){\r
- if(!option_get_bool(Option,"ScoreWhite") ||\r
- colour_is_white(Uci->board->turn)){\r
- return Uci->best_score;\r
- }else{\r
- return -Uci->best_score;\r
- }\r
-}\r
-\r
-// comp_move()\r
-\r
-static void comp_move(int move) {\r
-\r
- board_t board[1];\r
- char string[256];\r
-\r
- ASSERT(move_is_ok(move));\r
-\r
- ASSERT(State->state==THINK);\r
- ASSERT(!XB->analyse);\r
-\r
- if(option_get_bool(Option,"RepeatPV"))\r
- send_pv(); // to update time and nodes\r
-\r
- // send the move\r
-\r
- game_get_board(Game,board);\r
-\r
- if (move_is_castle(move,board) && option_get_bool(Option,"Chess960")) {\r
- if (!move_to_san(move,board,string,256)) my_fatal("comp_move(): move_to_san() failed\n"); // O-O/O-O-O\r
- } else {\r
- if (!move_to_can(move,board,string,256)) my_fatal("comp_move(): move_to_can() failed\n");\r
- }\r
-\r
- gui_send(GUI,"move %s",string);\r
-\r
- // resign?\r
-\r
- if (option_get_bool(Option,"Resign") && Uci->root_move_nb > 1) {\r
-\r
- if (Uci->best_score <= -abs(option_get_int(Option,"ResignScore"))) {\r
-\r
- State->resign_nb++;\r
- my_log("POLYGLOT %d move%s with resign score\n",State->resign_nb,(State->resign_nb>1)?"s":"");\r
-\r
- if (State->resign_nb >= option_get_int(Option,"ResignMoves")) {\r
- my_log("POLYGLOT *** RESIGN ***\n");\r
- gui_send(GUI,"resign");\r
- }\r
-\r
- } else {\r
-\r
- if (State->resign_nb > 0) my_log("POLYGLOT resign reset (State->resign_nb=%d)\n",State->resign_nb);\r
- State->resign_nb = 0;\r
- }\r
- }\r
-\r
- // play the move\r
-\r
- move_step(move);\r
- no_mess(move);\r
-}\r
-\r
-// move_step()\r
-\r
-static void move_step(int move) {\r
-\r
- board_t board[1];\r
- char move_string[256];\r
-\r
- ASSERT(move_is_ok(move));\r
-\r
- // log\r
-\r
- game_get_board(Game,board);\r
-\r
- if (move != MoveNone && move_is_legal(move,board)) {\r
-\r
- move_to_san(move,board,move_string,256);\r
- my_log("POLYGLOT MOVE %s\n",move_string);\r
-\r
- } else {\r
-\r
- move_to_can(move,board,move_string,256);\r
- my_log("POLYGLOT ILLEGAL MOVE \"%s\"\n",move_string);\r
- board_disp(board);\r
-\r
- my_fatal("move_step(): illegal move \"%s\"\n",move_string);\r
- }\r
-\r
- // play the move\r
-\r
- game_add_move(Game,move);\r
- board_update();\r
-}\r
-\r
-// board_update()\r
-\r
-static void board_update() {\r
-\r
- // handle game end\r
-\r
- ASSERT(!XB->result);\r
-\r
- switch (game_status(Game)) {\r
- case PLAYING:\r
- break;\r
- case WHITE_MATES:\r
- gui_send(GUI,"1-0 {White mates}");\r
- break;\r
- case BLACK_MATES:\r
- gui_send(GUI,"0-1 {Black mates}");\r
- break;\r
- case STALEMATE:\r
- gui_send(GUI,"1/2-1/2 {Stalemate}");\r
- break;\r
- case DRAW_MATERIAL:\r
- gui_send(GUI,"1/2-1/2 {Draw by insufficient material}");\r
- break;\r
- case DRAW_FIFTY:\r
- gui_send(GUI,"1/2-1/2 {Draw by fifty-move rule}");\r
- break;\r
- case DRAW_REPETITION:\r
- gui_send(GUI,"1/2-1/2 {Draw by repetition}");\r
- break;\r
- default:\r
- ASSERT(FALSE);\r
- break;\r
- }\r
-}\r
-\r
-// mess()\r
-\r
-static void mess() {\r
-\r
- // clear state variables\r
-\r
- State->resign_nb = 0;\r
- State->exp_move = MoveNone;\r
- my_timer_reset(State->timer);\r
-\r
- // abort a possible search\r
-\r
- stop_search();\r
-\r
- // calculate the new state\r
-\r
- if (FALSE) {\r
- } else if (!active()) {\r
- State->state = WAIT;\r
- my_log("POLYGLOT WAIT\n");\r
- } else if (XB->analyse) {\r
- State->state = ANALYSE;\r
- my_log("POLYGLOT ANALYSE\n");\r
- } else if (State->computer[game_turn(Game)]) {\r
- State->state = THINK;\r
- my_log("POLYGLOT THINK\n");\r
- } else {\r
- State->state = WAIT;\r
- my_log("POLYGLOT WAIT\n");\r
- }\r
-\r
- search_update();\r
-}\r
-\r
-// no_mess()\r
-\r
-static void no_mess(int move) {\r
-\r
- ASSERT(move_is_ok(move));\r
-\r
- // just received a move, calculate the new state\r
-\r
- if (FALSE) {\r
-\r
- } else if (!active()) {\r
-\r
- stop_search(); // abort a possible search\r
-\r
- State->state = WAIT;\r
- State->exp_move = MoveNone;\r
-\r
- my_log("POLYGLOT WAIT\n");\r
-\r
- } else if (State->state == WAIT) {\r
-\r
- ASSERT(State->computer[game_turn(Game)]);\r
- ASSERT(!State->computer[colour_opp(game_turn(Game))]);\r
- ASSERT(!XB->analyse);\r
-\r
- my_log("POLYGLOT WAIT -> THINK\n");\r
-\r
- State->state = THINK;\r
- State->exp_move = MoveNone;\r
-\r
- } else if (State->state == THINK) {\r
-\r
- ASSERT(!State->computer[game_turn(Game)]);\r
- ASSERT(State->computer[colour_opp(game_turn(Game))]);\r
- ASSERT(!XB->analyse);\r
-\r
- if (ponder() && ponder_ok(Uci->ponder_move)) {\r
-\r
- my_log("POLYGLOT THINK -> PONDER\n");\r
-\r
- State->state = PONDER;\r
- State->exp_move = Uci->ponder_move;\r
-\r
- } else {\r
-\r
- my_log("POLYGLOT THINK -> WAIT\n");\r
-\r
- State->state = WAIT;\r
- State->exp_move = MoveNone;\r
- }\r
-\r
- } else if (State->state == PONDER) {\r
-\r
- ASSERT(State->computer[game_turn(Game)]);\r
- ASSERT(!State->computer[colour_opp(game_turn(Game))]);\r
- ASSERT(!XB->analyse);\r
-\r
- if (move == State->exp_move && Uci->searching) {\r
-\r
- ASSERT(Uci->searching);\r
- ASSERT(Uci->pending_nb>=1);\r
-\r
- my_timer_start(State->timer);//also resets\r
-\r
- my_log("POLYGLOT PONDER -> THINK (*** HIT ***)\n");\r
- engine_send(Engine,"ponderhit");\r
-\r
- State->state = THINK;\r
- State->exp_move = MoveNone;\r
-\r
- send_pv(); // update display\r
-\r
- return; // do not launch a new search\r
-\r
- } else {\r
-\r
- my_log("POLYGLOT PONDER -> THINK (miss)\n");\r
-\r
- stop_search();\r
-\r
- State->state = THINK;\r
- State->exp_move = MoveNone;\r
- }\r
-\r
- } else if (State->state == ANALYSE) {\r
-\r
- ASSERT(XB->analyse);\r
-\r
- my_log("POLYGLOT ANALYSE -> ANALYSE\n");\r
-\r
- stop_search();\r
-\r
- } else {\r
-\r
- ASSERT(FALSE);\r
- }\r
-\r
- search_update();\r
-}\r
-\r
-// start_protected_command()\r
-\r
-static void start_protected_command(){\r
- stop_search();\r
-}\r
-\r
-static void end_protected_command(){\r
- if(Uci->ready){ // not init faze\r
- uci_send_isready_sync(Uci); // gobble up spurious "bestmove"\r
- }\r
- update_remaining_time();\r
- search_update(); // relaunch search if necessary\r
-}\r
-\r
-// update_remaining_time()\r
-\r
-static void update_remaining_time(){\r
- double reduce;\r
- if(State->timer->running){\r
- my_timer_stop(State->timer);\r
- reduce = my_timer_elapsed_real(State->timer);\r
- my_log("POLYGLOT reducing remaing time by %f seconds\n",reduce);\r
- XB->my_time -= reduce;\r
- if(XB->my_time<0.0){\r
- XB->my_time=0.0;\r
- }\r
- }\r
-}\r
-\r
-\r
-// search_update()\r
-\r
-static void search_update() {\r
-\r
- int move;\r
- int move_nb;\r
- board_t board[1];\r
-\r
- ASSERT(!Uci->searching);\r
-\r
-\r
-\r
- \r
- // launch a new search if needed\r
-\r
- \r
-\r
- if (State->state == THINK || State->state == PONDER || State->state == ANALYSE) {\r
-\r
- // [VdB] moved up as we need the move number\r
-\r
- game_get_board(Game,Uci->board);\r
-\r
- // opening book\r
-\r
- if (State->state == THINK &&\r
- option_get_bool(Option,"Book") &&\r
- Uci->board->move_nb<option_get_int(Option,"BookDepth")\r
- ) {\r
-\r
-\r
- move = book_move(Uci->board,option_get_bool(Option,"BookRandom"));\r
-\r
- if (move != MoveNone && move_is_legal(move,Uci->board)) {\r
-\r
- my_log("POLYGLOT *BOOK MOVE*\n");\r
-\r
- search_clear(); // clears Uci->ponder_move\r
- Uci->best_move = move;\r
-\r
- board_copy(board,Uci->board);\r
- move_do(board,move);\r
- Uci->ponder_move = book_move(board,FALSE); // expected move = best book move\r
-\r
- Uci->best_pv[0] = Uci->best_move;\r
- Uci->best_pv[1] = Uci->ponder_move; // can be MoveNone\r
- Uci->best_pv[2] = MoveNone;\r
-\r
- comp_move(Uci->best_move);\r
-\r
- return;\r
- }\r
- }\r
-\r
- // engine search\r
-\r
- my_log("POLYGLOT START SEARCH\n");\r
-\r
- // options\r
-\r
- uci_send_option(Uci,"UCI_Chess960","%s",\r
- option_get_bool(Option,"Chess960")?"true":"false");\r
-\r
- if (option_get_int(Option,"UCIVersion") >= 2) {\r
- uci_send_option(Uci,"UCI_Opponent","none none %s %s",(XB->computer)?"computer":"human",XB->name);\r
- uci_send_option(Uci,"UCI_AnalyseMode","%s",(XB->analyse)?"true":"false");\r
- }\r
-\r
- uci_send_option(Uci,"Ponder","%s",ponder()?"true":"false");\r
-\r
- // position\r
-\r
- move = (State->state == PONDER) ? State->exp_move : MoveNone;\r
- send_board(move); // updates Uci->board global variable\r
-\r
- // search\r
-\r
- if (State->state == THINK || State->state == PONDER) {\r
-\r
- engine_send_queue(Engine,"go");\r
-\r
- if (XB->time_limit) {\r
-\r
- // fixed time per move\r
- \r
- if(XB->node_rate > 0){\r
- engine_send_queue(Engine,\r
- " nodes %.0f",\r
- XB->time_max*((double)XB->node_rate));\r
- }else{\r
- engine_send_queue(Engine,\r
- " movetime %.0f",\r
- XB->time_max*1000.0);\r
- }\r
-\r
- } else {\r
-\r
- // time controls\r
-\r
- if(XB->node_rate > 0) {\r
- double time;\r
- move_nb = 40;\r
- if (XB->mps != 0){\r
- move_nb = XB->mps - (Uci->board->move_nb % XB->mps);\r
- }\r
- time = XB->my_time / move_nb;\r
- if(XB->inc != 0){\r
- time += XB->inc;\r
- }\r
- if(time > XB->my_time){\r
- time = XB->my_time;\r
- }\r
- engine_send_queue(Engine,\r
- " nodes %.0f",\r
- time*XB->node_rate);\r
- } else {\r
- \r
- if (colour_is_white(Uci->board->turn)) {\r
- engine_send_queue(Engine,\r
- " wtime %.0f btime %.0f",\r
- XB->my_time*1000.0,XB->opp_time*1000.0);\r
- } else {\r
- engine_send_queue(Engine,\r
- " wtime %.0f btime %.0f",\r
- XB->opp_time*1000.0,XB->my_time*1000.0);\r
- }\r
- \r
- if (XB->inc != 0.0){\r
- engine_send_queue(Engine,\r
- " winc %.0f binc %.0f",\r
- XB->inc*1000.0,XB->inc*1000.0);\r
- }\r
- if (XB->mps != 0) {\r
-\r
- move_nb = XB->mps - (Uci->board->move_nb % XB->mps);\r
- ASSERT(move_nb>=1&&move_nb<=XB->mps);\r
- \r
- engine_send_queue(Engine," movestogo %d",move_nb);\r
- }\r
- }\r
- }\r
- if (XB->depth_limit) engine_send_queue(Engine," depth %d",XB->depth_max);\r
-\r
- if (State->state == PONDER) engine_send_queue(Engine," ponder");\r
-\r
- engine_send(Engine,""); // newline\r
-\r
- } else if (State->state == ANALYSE) {\r
-\r
- engine_send(Engine,"go infinite");\r
-\r
- } else {\r
-\r
- ASSERT(FALSE);\r
- }\r
-\r
- // init search info\r
-\r
- ASSERT(!Uci->searching);\r
-\r
- search_clear();\r
-\r
- Uci->searching = TRUE;\r
- Uci->pending_nb++;\r
- }\r
-}\r
-\r
-// search_clear()\r
-\r
-static void search_clear() {\r
-\r
- uci_clear(Uci);\r
-\r
- // TODO: MOVE ME\r
-\r
- my_timer_start(State->timer);//also resets\r
-}\r
-\r
-// active()\r
-\r
-static bool active() {\r
-\r
- // position state\r
-\r
- if (game_status(Game) != PLAYING) return FALSE; // game ended\r
-\r
- // xboard state\r
-\r
- if (XB->analyse) return TRUE; // analysing\r
- if (!State->computer[White] && !State->computer[Black]) return FALSE; // force mode\r
- if (XB->new_hack || XB->result) return FALSE; // unstarted or ended game\r
-\r
- return TRUE; // playing\r
-}\r
-\r
-// ponder()\r
-\r
-static bool ponder() {\r
-\r
- return XB->ponder && (option_get_bool(Option,"CanPonder") ||\r
- option_find(Uci->option,"Ponder"));\r
-}\r
-// ponder_ok()\r
-\r
-static bool ponder_ok(int move) {\r
- int status;\r
- board_t board[1];\r
-\r
- ASSERT(move==MoveNone||move_is_ok(move));\r
-\r
- // legal ponder move?\r
-\r
- if (move == MoveNone) return FALSE;\r
-\r
- game_get_board(Game,board);\r
- if (!move_is_legal(move,board)) return FALSE;\r
-\r
- // UCI-legal resulting position?\r
-\r
- game_add_move(Game,move);\r
-\r
- game_get_board(Game,board);\r
- status = game_status(Game);\r
-\r
- game_rem_move(Game);\r
-\r
- if (status != PLAYING) return FALSE; // game ended\r
-\r
- if (option_get_bool(Option,"Book") && is_in_book(board)) {\r
- return FALSE;\r
- }\r
-\r
- return TRUE;\r
-}\r
-\r
-// stop_search()\r
-\r
-static void stop_search() {\r
-\r
- if (Uci->searching) {\r
-\r
- ASSERT(Uci->searching);\r
- ASSERT(Uci->pending_nb>=1);\r
-\r
- my_log("POLYGLOT STOP SEARCH\n");\r
-\r
-/*\r
- engine_send(Engine,"stop");\r
- Uci->searching = FALSE;\r
-*/\r
-\r
- if (option_get_bool(Option,"SyncStop")) {\r
- uci_send_stop_sync(Uci);\r
- } else {\r
- uci_send_stop(Uci);\r
- }\r
- }\r
-}\r
-\r
-// send_board()\r
-\r
-static void send_board(int extra_move) {\r
-\r
- char fen[256];\r
- int start, end;\r
- board_t board[1];\r
- int pos;\r
- int move;\r
- char string[256];\r
-\r
- ASSERT(extra_move==MoveNone||move_is_ok(extra_move));\r
-\r
- ASSERT(!Uci->searching);\r
-\r
- // init\r
-\r
- game_get_board(Game,Uci->board);\r
- if (extra_move != MoveNone) move_do(Uci->board,extra_move);\r
-\r
- board_to_fen(Uci->board,fen,256);\r
- my_log("POLYGLOT FEN %s\n",fen);\r
-\r
- ASSERT(board_can_play(Uci->board));\r
-\r
- // more init\r
-\r
- start = 0;\r
- end = game_pos(Game);\r
- ASSERT(end>=start);\r
-\r
- // position\r
-\r
- game_get_board_ex(Game,board,start);\r
- board_to_fen(board,string,256);\r
-\r
- engine_send_queue(Engine,"position");\r
-\r
- if (my_string_equal(string,StartFen)) {\r
- engine_send_queue(Engine," startpos");\r
- } else {\r
- engine_send_queue(Engine," fen %s",string);\r
- }\r
-\r
- // move list\r
-\r
- if (end > start || extra_move != MoveNone) engine_send_queue(Engine," moves");\r
-\r
- for (pos = start; pos < end; pos++) { // game moves\r
-\r
- move = game_move(Game,pos);\r
-\r
- move_to_can(move,board,string,256);\r
- engine_send_queue(Engine," %s",string);\r
-\r
- move_do(board,move);\r
- }\r
-\r
- if (extra_move != MoveNone) { // move to ponder on\r
- move_to_can(extra_move,board,string,256);\r
- engine_send_queue(Engine," %s",string);\r
- }\r
-\r
- // end\r
-\r
- engine_send(Engine,""); // newline\r
-}\r
-\r
-// send_info()\r
-\r
-static void send_info() {\r
- int min_depth;\r
- if(option_get_bool(Option,"WbWorkArounds2")){\r
- // Silly bug in some versions of WinBoard.\r
- // depth <=1 clears the engine output window.\r
- // Why shouldn't an engine be allowed to send info at depth 1?\r
- min_depth=2;\r
- }else{\r
- min_depth=1;\r
- }\r
- gui_send(GUI,"%d %+d %.0f "S64_FORMAT" %s",Uci->best_depth>min_depth?Uci->best_depth:min_depth,\r
- 0,0,0.0,0,Uci->info); \r
-}\r
-\r
-// send_pv()\r
-\r
-static void send_pv() {\r
-\r
- char pv_string[StringSize];\r
- board_t board[1];\r
- int move;\r
- char move_string[StringSize];\r
-\r
- ASSERT(State->state!=WAIT);\r
-\r
- if (Uci->best_depth == 0) return;\r
-\r
- // xboard search information\r
-\r
- if (XB->post) {\r
-\r
- if (State->state == THINK || State->state == ANALYSE) {\r
-\r
- line_to_san(Uci->best_pv,Uci->board,pv_string,StringSize);\r
-\r
- if(Uci->depth==-1) //hack to clear the engine output window\r
- gui_send(GUI,"%d %+d %.0f "S64_FORMAT" ",0,report_best_score(),Uci->time*100.0,Uci->node_nb);\r
-\r
- gui_send(GUI,"%d %+d %.0f "S64_FORMAT" %s",Uci->best_depth,report_best_score(),Uci->time*100.0,Uci->node_nb,pv_string);\r
-\r
- } else if (State->state == PONDER &&\r
- option_get_bool(Option,"ShowPonder")) {\r
-\r
- game_get_board(Game,board);\r
- move = State->exp_move;\r
-\r
- if (move != MoveNone && move_is_legal(move,board)) {\r
- move_to_san(move,board,move_string,256);\r
- line_to_san(Uci->best_pv,Uci->board,pv_string,StringSize);\r
- gui_send(GUI,"%d %+d %.0f "S64_FORMAT" (%s) %s",Uci->best_depth,report_best_score(),Uci->time*100.0,Uci->node_nb,move_string,pv_string);\r
- }\r
- }\r
- }\r
-\r
- // kibitz\r
-\r
- if ((Uci->searching &&\r
- option_get_bool(Option,"KibitzPV") &&\r
- Uci->time >= option_get_double(Option,"KibitzDelay"))\r
- || (!Uci->searching && option_get_bool(Option,"KibitzMove"))) {\r
-\r
- if (State->state == THINK || State->state == ANALYSE) {\r
-\r
- line_to_san(Uci->best_pv,Uci->board,pv_string,StringSize);\r
- if(kibitz_throttle(Uci->searching)){\r
- gui_send(GUI,"%s depth=%d time=%.2f node="S64_FORMAT" speed=%.0f score=%+.2f pv=\"%s\"",option_get_string(Option,"KibitzCommand"),Uci->best_depth,Uci->time,Uci->node_nb,Uci->speed,((double)report_best_score())/100.0,pv_string);\r
- }\r
- } else if (State->state == PONDER) {\r
-\r
- game_get_board(Game,board);\r
- move = State->exp_move;\r
-\r
- if (move != MoveNone && move_is_legal(move,board)) {\r
- move_to_san(move,board,move_string,256);\r
- line_to_san(Uci->best_pv,Uci->board,pv_string,StringSize);\r
- if(kibitz_throttle(Uci->searching)){\r
- gui_send(GUI,"%s depth=%d time=%.2f node="S64_FORMAT" speed=%.0f score=%+.2f pv=\"(%s) %s\"",option_get_string(Option,"KibitzCommand"),Uci->best_depth,Uci->time,Uci->node_nb,Uci->speed,((double)report_best_score())/100.0,move_string,pv_string);\r
- }\r
- }\r
- }\r
- }\r
-}\r
-\r
-// kibitz_throttle()\r
-\r
-static bool kibitz_throttle(bool searching){\r
- time_t curr_time;\r
- static time_t lastKibitzMove=0;\r
- static time_t lastKibitzPV=0;\r
- curr_time = time(NULL);\r
- if(searching){ // KibitzPV\r
- if(curr_time >=\r
- (option_get_int(Option,"KibitzInterval") + lastKibitzPV)){\r
- lastKibitzPV=curr_time;\r
- return TRUE;\r
- }\r
- }else{ // KibitzMove\r
- if(curr_time >=\r
- (option_get_int(Option,"KibitzInterval") + lastKibitzMove)){\r
- lastKibitzPV=curr_time;\r
- lastKibitzMove=curr_time;\r
- return TRUE;\r
- } \r
- }\r
- return FALSE;\r
-}\r
-\r
-// learn()\r
-\r
-static void learn(int result) {\r
-\r
- int pos;\r
- board_t board[1];\r
- int move;\r
-\r
- ASSERT(result>=-1&&result<=+1);\r
-\r
- ASSERT(XB->result);\r
- ASSERT(State->computer[White]||State->computer[Black]);\r
-\r
- // init\r
-\r
- pos = 0;\r
-\r
- if (FALSE) {\r
- } else if (State->computer[White]) {\r
- pos = 0;\r
- } else if (State->computer[Black]) {\r
- pos = 1;\r
- result = -result;\r
- } else {\r
- my_fatal("learn(): unknown side\n");\r
- }\r
-\r
- if (FALSE) {\r
- } else if (result > 0) {\r
- my_log("POLYGLOT *LEARN WIN*\n");\r
- } else if (result < 0) {\r
- my_log("POLYGLOT *LEARN LOSS*\n");\r
- } else {\r
- my_log("POLYGLOT *LEARN DRAW*\n");\r
- }\r
-\r
- // loop\r
-\r
- for (; pos < Game->size; pos += 2) {\r
-\r
- game_get_board_ex(Game,board,pos);\r
- move = game_move(Game,pos);\r
-\r
- book_learn_move(board,move,result);\r
- }\r
-\r
- book_flush();\r
-}\r
-\r
-// end of xboard2uci.c\r
+
+// xboard2uci.c
+
+// includes
+
+#include <errno.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+
+#include "board.h"
+#include "book.h"
+#include "colour.h"
+#include "engine.h"
+#include "fen.h"
+#include "game.h"
+#include "gui.h"
+#include "line.h"
+#include "main.h"
+#include "move.h"
+#include "move_do.h"
+#include "move_legal.h"
+#include "option.h"
+#include "parse.h"
+#include "san.h"
+#include "uci.h"
+#include "uci2uci.h"
+#include "util.h"
+#include "xboard2uci.h"
+
+// defines
+
+#define StringSize 4096
+
+// constants
+
+static const bool UseDebug = FALSE;
+static const bool DelayPong = FALSE;
+
+// types
+
+typedef struct {
+ int state;
+ bool computer[ColourNb];
+ int exp_move;
+ int hint_move;
+ int resign_nb;
+ my_timer_t timer[1];
+} state_t;
+
+typedef struct {
+ bool has_feature_memory;
+ bool has_feature_smp;
+ bool has_feature_egt_nalimov;
+ bool has_feature_egt_gaviota;
+ bool analyse;
+ bool computer;
+ const char * name;
+ bool ics;
+ bool new_hack; // "new" is a C++ keyword
+ bool ponder;
+ int ping;
+ bool post;
+ int proto_ver;
+ bool result;
+
+ int mps;
+ double base;
+ double inc;
+
+ bool time_limit;
+ double time_max;
+
+ bool depth_limit;
+ int depth_max;
+
+ double my_time;
+ double opp_time;
+
+ int node_rate;
+} xb_t;
+
+typedef enum { WAIT, THINK, PONDER, ANALYSE } dummy_state_t;
+
+// variables
+
+static state_t State[1];
+static xb_t XB[1];
+
+// prototypes
+
+static void comp_move (int move);
+static void move_step (int move);
+static void board_update ();
+
+static void mess ();
+static void no_mess (int move);
+
+static void search_update ();
+static void search_clear ();
+static void update_remaining_time();
+static int report_best_score();
+static bool kibitz_throttle (bool searching);
+static void start_protected_command();
+static void end_protected_command();
+
+static bool active ();
+static bool ponder ();
+static bool ponder_ok (int ponder_move);
+
+static void stop_search ();
+
+static void send_board (int extra_move);
+static void send_pv ();
+static void send_info ();
+
+static void send_xboard_options ();
+
+static void learn (int result);
+
+
+// functions
+
+// xboard2uci_init()
+
+void xboard2uci_init() {
+ // init
+
+ game_clear(Game);
+
+ // state
+
+ State->state = WAIT;
+
+ State->computer[White] = FALSE;
+ State->computer[Black] = TRUE;
+
+ State->exp_move = MoveNone;
+ State->hint_move = MoveNone;
+ State->resign_nb = 0;
+ my_timer_reset(State->timer);
+
+ // yes there are engines that do not have the "Hash" option....
+ XB->has_feature_memory= (option_find(Uci->option,"Hash")!=NULL);
+ XB->has_feature_smp = (uci_thread_option(Uci)!=NULL);
+ // TODO: support for other types of table bases
+ // This is a quick hack.
+ XB->has_feature_egt_nalimov = (option_find(Uci->option,"NalimovPath")!=NULL);
+ XB->has_feature_egt_gaviota = (option_find(Uci->option,"GaviotaTbPath")!=NULL);
+ XB->analyse = FALSE;
+ XB->computer = FALSE;
+ XB->name = NULL;
+ my_string_set(&XB->name,"<empty>");
+ XB->ics = FALSE;
+ XB->new_hack = TRUE;
+ XB->ping = -1;
+ XB->ponder = FALSE;
+ XB->post = FALSE;
+ XB->proto_ver = 1;
+ XB->result = FALSE;
+
+ XB->mps = 0;
+ XB->base = 300.0;
+ XB->inc = 0.0;
+
+ XB->time_limit = FALSE;
+ XB->time_max = 5.0;
+
+ XB->depth_limit = FALSE;
+ XB->depth_max = 127;
+
+ XB->my_time = 300.0;
+ XB->opp_time = 300.0;
+
+ XB->node_rate = -1;
+}
+
+// xboard2uci_gui_step()
+
+void xboard2uci_gui_step(char string[]) {
+
+ int move;
+ char move_string[256];
+ board_t board[1];
+
+ if (FALSE) {
+
+ } else if (match(string,"accepted *")) {
+
+ // ignore
+
+ } else if (match(string,"analyze")) {
+
+ State->computer[White] = FALSE;
+ State->computer[Black] = FALSE;
+
+ XB->analyse = TRUE;
+ XB->new_hack = FALSE;
+ ASSERT(!XB->result);
+ XB->result = FALSE;
+
+ mess();
+
+ } else if (match(string,"bk")) {
+
+ if (option_get_bool(Option,"Book")) {
+ game_get_board(Game,board);
+ book_disp(board);
+ }
+
+ } else if (match(string,"black")) {
+
+ if (colour_is_black(game_turn(Game))) {
+
+ State->computer[White] = TRUE;
+ State->computer[Black] = FALSE;
+
+ XB->new_hack = TRUE;
+ XB->result = FALSE;
+
+ mess();
+ }
+
+ } else if (match(string,"computer")) {
+
+ XB->computer = TRUE;
+
+ } else if (match(string,"draw")) {
+ if(option_find(Uci->option,"UCI_DrawOffers")){
+ my_log("POLYGLOT draw from XB received");
+ uci_send_option(Uci,"DrawOffer","%s","draw");}
+ } else if (match(string,"easy")) {
+
+ XB->ponder = FALSE;
+
+ mess();
+
+ } else if (match(string,"edit")) {
+
+ // refuse
+
+ gui_send(GUI,"Error (unknown command): %s",string);
+
+ } else if (match(string,"exit")) {
+
+ State->computer[White] = FALSE;
+ State->computer[Black] = FALSE;
+
+ XB->analyse = FALSE;
+
+ mess();
+
+ } else if (match(string,"force")) {
+
+ State->computer[White] = FALSE;
+ State->computer[Black] = FALSE;
+
+ mess();
+
+ } else if (match(string,"go")) {
+
+ State->computer[game_turn(Game)] = TRUE;
+ State->computer[colour_opp(game_turn(Game))] = FALSE;
+
+ XB->new_hack = FALSE;
+ ASSERT(!XB->result);
+ XB->result = FALSE;
+
+ mess();
+
+ } else if (match(string,"hard")) {
+
+ XB->ponder = TRUE;
+
+ mess();
+
+ } else if (match(string,"hint")) {
+
+ move=MoveNone;
+ game_get_board(Game,board);
+ if (option_get_bool(Option,"Book")) {
+
+ move = book_move(board,FALSE);
+ }
+ if(move==MoveNone && State->hint_move!=MoveNone){
+ move=State->hint_move;
+
+ }
+ if (move != MoveNone && move_is_legal(move,board)) {
+ move_to_san(move,board,move_string,256);
+ gui_send(GUI,"Hint: %s",move_string);
+ }
+
+ } else if (match(string,"ics *")) {
+
+ XB->ics = TRUE;
+
+ } else if (match(string,"level * *:* *")) {
+
+ XB->mps = atoi(Star[0]);
+ XB->base = ((double)atoi(Star[1])) * 60.0 + ((double)atoi(Star[2]));
+ XB->inc = ((double)atoi(Star[3]));
+
+ } else if (match(string,"level * * *")) {
+
+ XB->mps = atoi(Star[0]);
+ XB->base = ((double)atoi(Star[1])) * 60.0;
+ XB->inc = ((double)atoi(Star[2]));
+
+ } else if (match(string,"name *")) {
+
+ my_string_set(&XB->name,Star[0]);
+
+ } else if (match(string,"new")) {
+
+ uci_send_isready_sync(Uci);
+ my_log("POLYGLOT NEW GAME\n");
+
+ option_set(Option,"Chess960","false");
+
+ game_clear(Game);
+
+ if (XB->analyse) {
+ State->computer[White] = FALSE;
+ State->computer[Black] = FALSE;
+ } else {
+ State->computer[White] = FALSE;
+ State->computer[Black] = TRUE;
+ }
+
+ XB->new_hack = TRUE;
+ XB->result = FALSE;
+
+ XB->depth_limit = FALSE;
+ XB->node_rate=-1;
+
+ XB->computer = FALSE;
+ my_string_set(&XB->name,"<empty>");
+
+ board_update();
+ mess();
+
+ uci_send_ucinewgame(Uci);
+
+ } else if (match(string,"nopost")) {
+
+ XB->post = FALSE;
+
+ } else if (match(string,"otim *")) {
+
+ XB->opp_time = ((double)atoi(Star[0])) / 100.0;
+ if (XB->opp_time < 0.0) XB->opp_time = 0.0;
+
+ } else if (match(string,"pause")) {
+
+ // refuse
+
+ gui_send(GUI,"Error (unknown command): %s",string);
+
+ } else if (match(string,"ping *")) {
+
+ // HACK; TODO: answer only after an engine move
+
+ if (DelayPong) {
+ if (XB->ping >= 0) gui_send(GUI,"pong %d",XB->ping); // HACK: get rid of old ping
+ XB->ping = atoi(Star[0]);
+ uci_send_isready_sync(Uci);
+ } else {
+ ASSERT(XB->ping==-1);
+ gui_send(GUI,"pong %s",Star[0]);
+ }
+ } else if (match(string,"nps *")) {
+
+ // fake WB play-by-nodes mode
+ XB->node_rate = atoi(Star[0]);
+ } else if (match(string,"playother")) {
+
+ State->computer[game_turn(Game)] = FALSE;
+ State->computer[colour_opp(game_turn(Game))] = TRUE;
+
+ XB->new_hack = FALSE;
+ ASSERT(!XB->result);
+ XB->result = FALSE;
+
+ mess();
+
+ } else if (match(string,"post")) {
+
+ XB->post = TRUE;
+
+ } else if (match(string,"protover *")) {
+ XB->proto_ver = atoi(Star[0]);
+ ASSERT(XB->proto_ver>=2);
+ send_xboard_options();
+
+ } else if (match(string,"quit")) {
+ my_log("POLYGLOT *** \"quit\" from GUI ***\n");
+ quit();
+ } else if (match(string,"random")) {
+
+ // ignore
+
+ } else if (match(string,"rating * *")) {
+
+ // ignore
+
+ } else if (match(string,"remove")) {
+
+ if (game_pos(Game) >= 2) {
+
+ game_goto(Game,game_pos(Game)-2);
+
+ ASSERT(!XB->new_hack);
+ XB->new_hack = FALSE; // HACK?
+ XB->result = FALSE;
+
+ board_update();
+ mess();
+ }
+
+ } else if (match(string,"rejected *")) {
+
+ // ignore
+
+ } else if (match(string,"reset")) { // protover 3?
+
+ // refuse
+
+ gui_send(GUI,"Error (unknown command): %s",string);
+
+ } else if (FALSE
+ || match(string,"result * {*}")
+ || match(string,"result * {* }")
+ || match(string,"result * { *}")
+ || match(string,"result * { * }")) {
+
+ my_log("POLYGLOT GAME END\n");
+
+ XB->result = TRUE;
+
+ mess();
+
+ // book learning
+
+ if (option_get_bool(Option,"Book") &&
+ option_get_bool(Option,"BookLearn")) {
+
+ if (FALSE) {
+ } else if (my_string_equal(Star[0],"1-0")) {
+ learn(+1);
+ } else if (my_string_equal(Star[0],"0-1")) {
+ learn(-1);
+ } else if (my_string_equal(Star[0],"1/2-1/2")) {
+ learn(0);
+ }
+ }
+ } else if (match(string,"resume")) {
+
+ // refuse
+
+ gui_send(GUI,"Error (unknown command): %s",string);
+
+ } else if (match(string,"option *=*") ||
+ match(string,"option * =*") ||
+ match(string,"option *= *") ||
+ match(string,"option * = *")
+ ){
+ char *name=Star[0];
+ char *value=Star[1];
+ if(match(name, "Polyglot *")){
+ char *pg_name=Star[0];
+ polyglot_set_option(pg_name,value);
+ }else{
+ option_t *opt=option_find(Uci->option,name);
+ if(opt){
+ if(my_string_case_equal(opt->type,"check")){
+ value=my_string_equal(value,"1")?"true":"false";
+ }
+ start_protected_command();
+ uci_send_option(Uci, name, "%s", value);
+ end_protected_command();
+ }else{
+ gui_send(GUI,"Error (unknown option): %s",name);
+ }
+ }
+ } else if (match(string,"option *")){
+ char *name=Star[0];
+ if(match(name, "Polyglot *")){
+ char *pg_name=Star[0];
+ polyglot_set_option(pg_name,"<empty>");
+ }else{
+ start_protected_command();
+ // value is ignored
+ if(!uci_send_option(Uci, name, "%s", "<empty>")){
+ gui_send(GUI,"Error (unknown option): %s",name);
+ };
+ end_protected_command();
+ }
+ } else if (XB->has_feature_smp && match(string,"cores *")){
+ int cores=atoi(Star[0]);
+ if(cores>=1){
+ // updating the number of cores
+ my_log("POLYGLOT setting the number of cores to %d\n",cores);
+ start_protected_command();
+ uci_set_threads(Uci,cores);
+ end_protected_command();
+ } else{
+ // refuse
+ gui_send(GUI,"Error (unknown command): %s",string);
+ }
+ } else if (match(string,"egtpath * *")){
+ char *type=Star[0];
+ char *path=Star[1];
+ if(my_string_empty(path)){
+ // refuse
+ gui_send(GUI,"Error (unknown command): %s",string);
+ }else{
+ if(my_string_case_equal(type,"nalimov") && XB->has_feature_egt_nalimov){
+ // updating NalimovPath
+ my_log("POLYGLOT setting the Nalimov path to %s\n",path);
+ start_protected_command();
+ uci_send_option(Uci,"NalimovPath","%s",path);
+ end_protected_command();
+ }else if(my_string_case_equal(type,"gaviota") && XB->has_feature_egt_gaviota){
+ // updating GaviotaPath
+ my_log("POLYGLOT setting the Gaviota path to %s\n",path);
+ start_protected_command();
+ uci_send_option(Uci,"GaviotaTbPath","%s",path);
+ end_protected_command();
+ }else{
+ // refuse
+ gui_send(GUI,"Error (unsupported table base format): %s",string);
+ }
+ }
+ } else if (XB->has_feature_memory && match(string,"memory *")){
+ int memory = atoi(Star[0]);
+ int egt_cache;
+ int real_memory;
+ if(memory>=1){
+ // updating the available memory
+ option_t *opt;
+ my_log("POLYGLOT setting the amount of memory to %dMb\n",memory);
+ if(XB->has_feature_egt_nalimov && (opt=option_find(Uci->option,"NalimovCache"))){
+ egt_cache=atoi(opt->value);
+ }else if(XB->has_feature_egt_gaviota &&
+ (opt=option_find(Uci->option,"GaviotaTbCache"))){
+ egt_cache=atoi(opt->value);
+ }else{
+ egt_cache=0;
+ }
+ my_log("POLYGLOT EGTB Cache is %dMb\n",egt_cache);
+ real_memory=memory-egt_cache;
+ if(real_memory>0){
+ start_protected_command();
+ uci_send_option(Uci,"Hash", "%d", real_memory);
+ end_protected_command();
+ }
+ }else{
+ // refuse
+ gui_send(GUI,"Error (unknown command): %s",string);
+ }
+
+ } else if (match(string,"sd *")) {
+
+ XB->depth_limit = TRUE;
+ XB->depth_max = atoi(Star[0]);
+
+ } else if (match(string,"setboard *")) {
+
+ my_log("POLYGLOT FEN %s\n",Star[0]);
+
+ if (!game_init(Game,Star[0])) my_fatal("xboard_step(): bad FEN \"%s\"\n",Star[0]);
+
+ State->computer[White] = FALSE;
+ State->computer[Black] = FALSE;
+
+ XB->new_hack = TRUE; // HACK?
+ XB->result = FALSE;
+
+ board_update();
+ mess();
+
+ } else if (match(string,"st *")) {
+
+ XB->time_limit = TRUE;
+ XB->time_max = ((double)atoi(Star[0]));
+
+ } else if (match(string,"time *")) {
+
+ XB->my_time = ((double)atoi(Star[0])) / 100.0;
+ if (XB->my_time < 0.0) XB->my_time = 0.0;
+
+ } else if (match(string,"undo")) {
+
+ if (game_pos(Game) >= 1) {
+
+ game_goto(Game,game_pos(Game)-1);
+
+ ASSERT(!XB->new_hack);
+ XB->new_hack = FALSE; // HACK?
+ XB->result = FALSE;
+
+ board_update();
+ mess();
+ }
+
+ } else if (match(string,"usermove *")) {
+
+ game_get_board(Game,board);
+ move = move_from_san(Star[0],board);
+
+ if (move != MoveNone && move_is_legal(move,board)) {
+
+ XB->new_hack = FALSE;
+ ASSERT(!XB->result);
+ XB->result = FALSE;
+
+ move_step(move);
+ no_mess(move);
+
+ } else {
+
+ gui_send(GUI,"Illegal move: %s",Star[0]);
+ }
+
+ } else if (match(string,"variant *")) {
+
+ if (my_string_equal(Star[0],"fischerandom")) {
+ option_set(Option,"Chess960","true");
+ } else {
+ option_set(Option,"Chess960","false");
+ }
+
+ } else if (match(string,"white")) {
+
+ if (colour_is_white(game_turn(Game))) {
+
+ State->computer[White] = FALSE;
+ State->computer[Black] = TRUE;
+
+ XB->new_hack = TRUE;
+ XB->result = FALSE;
+
+ mess();
+ }
+
+ } else if (match(string,"xboard")) {
+
+ // ignore
+
+ } else if (match(string,".")) { // analyse info
+
+ if (State->state == ANALYSE) {
+ int depth=Uci->best_depth;//HACK: don't clear engine-output window...
+
+ ASSERT(Uci->searching);
+ ASSERT(Uci->pending_nb>=1);
+
+ if (Uci->root_move != MoveNone && move_is_legal(Uci->root_move,Uci->board)) {
+ move_to_san(Uci->root_move,Uci->board,move_string,256);
+ gui_send(GUI,"stat01: %.0f "S64_FORMAT" %d %d %d %s",Uci->time*100.0,Uci->node_nb,/*Uci->*/depth,Uci->root_move_nb-(Uci->root_move_pos+1),Uci->root_move_nb,move_string);
+ } else {
+ gui_send(GUI,"stat01: %.0f "S64_FORMAT" %d %d %d",Uci->time*100.0,Uci->node_nb,/*Uci->*/depth,0,0); // HACK
+ }
+ }
+
+ } else if (match(string,"?")) { // move now
+
+ if (State->state == THINK) {
+
+ ASSERT(Uci->searching);
+ ASSERT(Uci->pending_nb>=1);
+
+ // HACK: just send "stop" to the engine
+
+ if (Uci->searching) {
+ my_log("POLYGLOT STOP SEARCH\n");
+ engine_send(Engine,"stop");
+ }
+ }
+
+ } else { // unknown command, maybe a move?
+
+ game_get_board(Game,board);
+ move = move_from_san(string,board);
+
+ if (move != MoveNone && move_is_legal(move,board)) {
+
+ XB->new_hack = FALSE;
+ ASSERT(!XB->result);
+ XB->result = FALSE;
+
+ move_step(move);
+ no_mess(move);
+
+ } else if (move != MoveNone) {
+
+ gui_send(GUI,"Illegal move: %s",string);
+
+ } else {
+
+ gui_send(GUI,"Error (unknown command): %s",string);
+ }
+ }
+ return;
+}
+
+// xboard2uci_engine_step()
+
+void xboard2uci_engine_step(char string[]) {
+
+ int event;
+ board_t board[1];
+ event = uci_parse(Uci,string);
+
+ // react to events
+
+ if ((event & EVENT_READY) != 0) {
+
+ // the engine is now ready
+
+ if (!Uci->ready) {
+ Uci->ready = TRUE;
+ // if (XB->proto_ver >= 2) xboard_send(XBoard,"feature done=1");
+ }
+
+ if (!DelayPong && XB->ping >= 0) {
+ gui_send(GUI,"pong %d",XB->ping);
+ XB->ping = -1;
+ }
+ }
+
+ if ((event & EVENT_MOVE) != 0 && State->state == THINK) {
+
+ // the engine is playing a move
+
+ // MEGA HACK: estimate remaining time because XBoard won't send it!
+
+ my_timer_stop(State->timer);
+
+ XB->my_time -= my_timer_elapsed_real(State->timer);
+ XB->my_time += XB->inc;
+ if (XB->mps != 0 && (game_move_nb(Game) + 1) % XB->mps == 0) XB->my_time += XB->base;
+
+ if (XB->my_time < 0.0) XB->my_time = 0.0;
+
+ // make sure to remember the ponder move
+
+ State->hint_move=Uci->ponder_move;
+
+ // play the engine move
+
+ comp_move(Uci->best_move);
+
+ }
+
+ if ((event & EVENT_PV) != 0) {
+
+ // the engine has sent a new PV
+
+ send_pv();
+ }
+ if ((event & EVENT_INFO) != 0) {
+
+ // the engine has sent info
+
+ send_info();
+ }
+ if((event & (EVENT_DRAW|EVENT_RESIGN))!=0){
+ my_log("POYGLOT draw offer/resign from engine\n");
+ if(option_find(Uci->option,"UCI_DrawOffers")){
+ if(event & EVENT_DRAW)
+ gui_send(GUI,"offer draw");
+ else
+ gui_send(GUI,"resign");
+ }
+ }
+ if(((event & EVENT_ILLEGAL_MOVE)!=0) && (State->state == THINK)){
+ game_get_board(Game,board);
+ if(board->turn==White){
+ gui_send(GUI,"0-1 {polyglot: resign"
+ " (illegal engine move by white: %s)}",Uci->bestmove);
+ }else{
+ gui_send(GUI,"1-0 {polyglot: resign"
+ " (illegal engine move by black: %s)}",Uci->bestmove);
+ }
+ board_disp(board);
+ XB->result = TRUE;
+ mess();
+ }
+}
+
+// format_xboard_option_line
+
+void format_xboard_option_line(char * option_line, option_t *opt){
+ int j;
+ char option_string[StringSize];
+ char *tmp;
+ strcpy(option_line,"");
+ // buffer overflow alert
+ strcat(option_line,"feature option=\"");
+ if(opt->mode&PG){
+ strcat(option_line,"Polyglot ");
+ }
+ sprintf(option_string,"%s",opt->name);
+ strcat(option_line,option_string);
+ sprintf(option_string," -%s",opt->type);
+ strcat(option_line,option_string);
+ if(!IS_BUTTON(opt->type) && strcmp(opt->type,"combo")){
+ if(strcmp(opt->type,"check")){
+ sprintf(option_string," %s",opt->value);
+ }else{
+ sprintf(option_string," %d",
+ my_string_case_equal(opt->value,"true")||
+ my_string_equal(opt->value,"1")
+ ?1:0);
+ }
+ strcat(option_line,option_string);
+ }
+ if(IS_SPIN(opt->type)){
+ sprintf(option_string," %s",opt->min);
+ strcat(option_line,option_string);
+ }
+ if(IS_SPIN(opt->type)){
+ sprintf(option_string," %s",opt->max);
+ strcat(option_line,option_string);
+ }
+ for(j=0;j<opt->var_nb;j++){
+ if(!strcmp(opt->var[j],opt->value)){
+ sprintf(option_string," *%s",opt->var[j]);
+ }else{
+ sprintf(option_string," %s",opt->var[j]);
+ }
+ strcat(option_line,option_string);
+ if(j!=opt->var_nb-1){
+ strcat(option_line," ///");
+ }
+ }
+ strcat(option_line,"\"");
+ if(option_get_bool(Option,"WbWorkArounds") &&
+ (tmp=strstr(option_line,"Draw"))){
+ *tmp='d';
+ my_log("POLYGLOT Decapitalizing \"Draw\" in option \"%s\"\n",
+ opt->name);
+ }
+}
+
+// send_xboard_options()
+
+static void send_xboard_options(){
+
+ char egtfeature[StringSize];
+ int tbs=0;
+
+ gui_send(GUI,"feature done=0");
+
+ gui_send(GUI,"feature analyze=1");
+ gui_send(GUI,"feature colors=0");
+ gui_send(GUI,"feature draw=1");
+ gui_send(GUI,"feature ics=1");
+ gui_send(GUI,"feature myname=\"%s\"",
+ option_get_string(Option,"EngineName"));
+ gui_send(GUI,"feature name=1");
+ gui_send(GUI,"feature pause=0");
+ gui_send(GUI,"feature ping=1");
+ gui_send(GUI,"feature playother=1");
+ gui_send(GUI,"feature sigint=1");
+ gui_send(GUI,"feature reuse=1");
+ gui_send(GUI,"feature san=0");
+ gui_send(GUI,"feature setboard=1");
+ gui_send(GUI,"feature sigint=0");
+ gui_send(GUI,"feature sigterm=0");
+ gui_send(GUI,"feature time=1");
+ gui_send(GUI,"feature usermove=1");
+ gui_send(GUI,"feature nps=1");
+ if (XB->has_feature_memory){
+ gui_send(GUI,"feature memory=1");
+ }else{
+ gui_send(GUI,"feature memory=0");
+ }
+ if (XB->has_feature_smp){
+ gui_send(GUI,"feature smp=1");
+ }else{
+ gui_send(GUI,"feature smp=0");
+ }
+ egtfeature[0]='\0';
+ strncat(egtfeature,"feature egt=\"",StringSize);
+ if (XB->has_feature_egt_nalimov){
+ tbs++;
+ strncat(egtfeature,"nalimov",StringSize-strlen(egtfeature));
+ }
+ if (XB->has_feature_egt_gaviota){
+ if(tbs>0){
+ strncat(egtfeature,",",StringSize-strlen(egtfeature));
+ }
+ strncat(egtfeature,"gaviota",StringSize-strlen(egtfeature));
+ }
+ strncat(egtfeature,"\"",StringSize-strlen(egtfeature));
+ egtfeature[StringSize-1]='\0';
+ gui_send(GUI,egtfeature);
+
+ if (option_find(Uci->option,"UCI_Chess960")) {
+ gui_send(GUI,"feature variants=\"normal,fischerandom\"");
+ } else {
+ gui_send(GUI,"feature variants=\"normal\"");
+ }
+
+ xboard2uci_send_options();
+}
+
+void xboard2uci_send_options(){
+ char option_line[StringSize]="";
+ const char * name;
+ option_t *opt;
+
+ option_start_iter(Uci->option);
+ while((opt=option_next(Uci->option))){
+ if(my_string_case_equal(opt->name,"UCI_AnalyseMode")) continue;
+ if(my_string_case_equal(opt->name,"UCI_Opponent")) continue;
+ if(my_string_case_equal(opt->name,"UCI_Chess960")) continue;
+ if(my_string_case_equal(opt->name,"UCI_ShowCurrLine")) continue;
+ if(my_string_case_equal(opt->name,"UCI_ShowRefutations")) continue;
+ if(my_string_case_equal(opt->name,"UCI_ShredderbasesPath")) continue;
+ if(my_string_case_equal(opt->name,"UCI_SetPositionValue")) continue;
+ if(my_string_case_equal(opt->name,"UCI_DrawOffers")) continue;
+ if(my_string_case_equal(opt->name,"Ponder")) continue;
+ if(my_string_case_equal(opt->name,"Hash")) continue;
+ if(my_string_case_equal(opt->name,"NalimovPath")) continue;
+ if(my_string_case_equal(opt->name,"GaviotaTbPath")) continue;
+ if((name=uci_thread_option(Uci))!=NULL &&
+ my_string_case_equal(opt->name,name)) continue;
+ format_xboard_option_line(option_line,opt);
+
+ gui_send(GUI,"%s",option_line);
+ }
+
+
+ option_start_iter(Option);
+ while((opt=option_next(Option))){
+ if(opt->mode &XBOARD){
+ format_xboard_option_line(option_line,opt);
+ gui_send(GUI,"%s",option_line);
+ }
+ }
+ gui_send(GUI,"feature done=1");
+
+}
+
+// report_best_score()
+
+static int report_best_score(){
+ if(!option_get_bool(Option,"ScoreWhite") ||
+ colour_is_white(Uci->board->turn)){
+ return Uci->best_score;
+ }else{
+ return -Uci->best_score;
+ }
+}
+
+// comp_move()
+
+static void comp_move(int move) {
+
+ board_t board[1];
+ char string[256];
+
+ ASSERT(move_is_ok(move));
+
+ ASSERT(State->state==THINK);
+ ASSERT(!XB->analyse);
+
+ if(option_get_bool(Option,"RepeatPV"))
+ send_pv(); // to update time and nodes
+
+ // send the move
+
+ game_get_board(Game,board);
+
+ if (move_is_castle(move,board) && option_get_bool(Option,"Chess960")) {
+ if (!move_to_san(move,board,string,256)) my_fatal("comp_move(): move_to_san() failed\n"); // O-O/O-O-O
+ } else {
+ if (!move_to_can(move,board,string,256)) my_fatal("comp_move(): move_to_can() failed\n");
+ }
+
+ gui_send(GUI,"move %s",string);
+
+ // resign?
+
+ if (option_get_bool(Option,"Resign") && Uci->root_move_nb > 1) {
+
+ if (Uci->best_score <= -abs(option_get_int(Option,"ResignScore"))) {
+
+ State->resign_nb++;
+ my_log("POLYGLOT %d move%s with resign score\n",State->resign_nb,(State->resign_nb>1)?"s":"");
+
+ if (State->resign_nb >= option_get_int(Option,"ResignMoves")) {
+ my_log("POLYGLOT *** RESIGN ***\n");
+ gui_send(GUI,"resign");
+ }
+
+ } else {
+
+ if (State->resign_nb > 0) my_log("POLYGLOT resign reset (State->resign_nb=%d)\n",State->resign_nb);
+ State->resign_nb = 0;
+ }
+ }
+
+ // play the move
+
+ move_step(move);
+ no_mess(move);
+}
+
+// move_step()
+
+static void move_step(int move) {
+
+ board_t board[1];
+ char move_string[256];
+
+ ASSERT(move_is_ok(move));
+
+ // log
+
+ game_get_board(Game,board);
+
+ if (move != MoveNone && move_is_legal(move,board)) {
+
+ move_to_san(move,board,move_string,256);
+ my_log("POLYGLOT MOVE %s\n",move_string);
+
+ } else {
+
+ move_to_can(move,board,move_string,256);
+ my_log("POLYGLOT ILLEGAL MOVE \"%s\"\n",move_string);
+ board_disp(board);
+
+ my_fatal("move_step(): illegal move \"%s\"\n",move_string);
+ }
+
+ // play the move
+
+ game_add_move(Game,move);
+ board_update();
+}
+
+// board_update()
+
+static void board_update() {
+
+ // handle game end
+
+ ASSERT(!XB->result);
+
+ switch (game_status(Game)) {
+ case PLAYING:
+ break;
+ case WHITE_MATES:
+ gui_send(GUI,"1-0 {White mates}");
+ break;
+ case BLACK_MATES:
+ gui_send(GUI,"0-1 {Black mates}");
+ break;
+ case STALEMATE:
+ gui_send(GUI,"1/2-1/2 {Stalemate}");
+ break;
+ case DRAW_MATERIAL:
+ gui_send(GUI,"1/2-1/2 {Draw by insufficient material}");
+ break;
+ case DRAW_FIFTY:
+ gui_send(GUI,"1/2-1/2 {Draw by fifty-move rule}");
+ break;
+ case DRAW_REPETITION:
+ gui_send(GUI,"1/2-1/2 {Draw by repetition}");
+ break;
+ default:
+ ASSERT(FALSE);
+ break;
+ }
+}
+
+// mess()
+
+static void mess() {
+
+ // clear state variables
+
+ State->resign_nb = 0;
+ State->exp_move = MoveNone;
+ my_timer_reset(State->timer);
+
+ // abort a possible search
+
+ stop_search();
+
+ // calculate the new state
+
+ if (FALSE) {
+ } else if (!active()) {
+ State->state = WAIT;
+ my_log("POLYGLOT WAIT\n");
+ } else if (XB->analyse) {
+ State->state = ANALYSE;
+ my_log("POLYGLOT ANALYSE\n");
+ } else if (State->computer[game_turn(Game)]) {
+ State->state = THINK;
+ my_log("POLYGLOT THINK\n");
+ } else {
+ State->state = WAIT;
+ my_log("POLYGLOT WAIT\n");
+ }
+
+ search_update();
+}
+
+// no_mess()
+
+static void no_mess(int move) {
+
+ ASSERT(move_is_ok(move));
+
+ // just received a move, calculate the new state
+
+ if (FALSE) {
+
+ } else if (!active()) {
+
+ stop_search(); // abort a possible search
+
+ State->state = WAIT;
+ State->exp_move = MoveNone;
+
+ my_log("POLYGLOT WAIT\n");
+
+ } else if (State->state == WAIT) {
+
+ ASSERT(State->computer[game_turn(Game)]);
+ ASSERT(!State->computer[colour_opp(game_turn(Game))]);
+ ASSERT(!XB->analyse);
+
+ my_log("POLYGLOT WAIT -> THINK\n");
+
+ State->state = THINK;
+ State->exp_move = MoveNone;
+
+ } else if (State->state == THINK) {
+
+ ASSERT(!State->computer[game_turn(Game)]);
+ ASSERT(State->computer[colour_opp(game_turn(Game))]);
+ ASSERT(!XB->analyse);
+
+ if (ponder() && ponder_ok(Uci->ponder_move)) {
+
+ my_log("POLYGLOT THINK -> PONDER\n");
+
+ State->state = PONDER;
+ State->exp_move = Uci->ponder_move;
+
+ } else {
+
+ my_log("POLYGLOT THINK -> WAIT\n");
+
+ State->state = WAIT;
+ State->exp_move = MoveNone;
+ }
+
+ } else if (State->state == PONDER) {
+
+ ASSERT(State->computer[game_turn(Game)]);
+ ASSERT(!State->computer[colour_opp(game_turn(Game))]);
+ ASSERT(!XB->analyse);
+
+ if (move == State->exp_move && Uci->searching) {
+
+ ASSERT(Uci->searching);
+ ASSERT(Uci->pending_nb>=1);
+
+ my_timer_start(State->timer);//also resets
+
+ my_log("POLYGLOT PONDER -> THINK (*** HIT ***)\n");
+ engine_send(Engine,"ponderhit");
+
+ State->state = THINK;
+ State->exp_move = MoveNone;
+
+ send_pv(); // update display
+
+ return; // do not launch a new search
+
+ } else {
+
+ my_log("POLYGLOT PONDER -> THINK (miss)\n");
+
+ stop_search();
+
+ State->state = THINK;
+ State->exp_move = MoveNone;
+ }
+
+ } else if (State->state == ANALYSE) {
+
+ ASSERT(XB->analyse);
+
+ my_log("POLYGLOT ANALYSE -> ANALYSE\n");
+
+ stop_search();
+
+ } else {
+
+ ASSERT(FALSE);
+ }
+
+ search_update();
+}
+
+// start_protected_command()
+
+static void start_protected_command(){
+ stop_search();
+}
+
+static void end_protected_command(){
+ if(Uci->ready){ // not init faze
+ uci_send_isready_sync(Uci); // gobble up spurious "bestmove"
+ }
+ update_remaining_time();
+ search_update(); // relaunch search if necessary
+}
+
+// update_remaining_time()
+
+static void update_remaining_time(){
+ double reduce;
+ if(State->timer->running){
+ my_timer_stop(State->timer);
+ reduce = my_timer_elapsed_real(State->timer);
+ my_log("POLYGLOT reducing remaing time by %f seconds\n",reduce);
+ XB->my_time -= reduce;
+ if(XB->my_time<0.0){
+ XB->my_time=0.0;
+ }
+ }
+}
+
+
+// search_update()
+
+static void search_update() {
+
+ int move;
+ int move_nb;
+ board_t board[1];
+
+ ASSERT(!Uci->searching);
+
+
+
+
+ // launch a new search if needed
+
+
+
+ if (State->state == THINK || State->state == PONDER || State->state == ANALYSE) {
+
+ // [VdB] moved up as we need the move number
+
+ game_get_board(Game,Uci->board);
+
+ // opening book
+
+ if (State->state == THINK &&
+ option_get_bool(Option,"Book") &&
+ Uci->board->move_nb<option_get_int(Option,"BookDepth")
+ ) {
+
+
+ move = book_move(Uci->board,option_get_bool(Option,"BookRandom"));
+
+ if (move != MoveNone && move_is_legal(move,Uci->board)) {
+
+ my_log("POLYGLOT *BOOK MOVE*\n");
+
+ search_clear(); // clears Uci->ponder_move
+ Uci->best_move = move;
+
+ board_copy(board,Uci->board);
+ move_do(board,move);
+ Uci->ponder_move = book_move(board,FALSE); // expected move = best book move
+
+ Uci->best_pv[0] = Uci->best_move;
+ Uci->best_pv[1] = Uci->ponder_move; // can be MoveNone
+ Uci->best_pv[2] = MoveNone;
+
+ comp_move(Uci->best_move);
+
+ return;
+ }
+ }
+
+ // engine search
+
+ my_log("POLYGLOT START SEARCH\n");
+
+ // options
+
+ uci_send_option(Uci,"UCI_Chess960","%s",
+ option_get_bool(Option,"Chess960")?"true":"false");
+
+ if (option_get_int(Option,"UCIVersion") >= 2) {
+ uci_send_option(Uci,"UCI_Opponent","none none %s %s",(XB->computer)?"computer":"human",XB->name);
+ uci_send_option(Uci,"UCI_AnalyseMode","%s",(XB->analyse)?"true":"false");
+ }
+
+ uci_send_option(Uci,"Ponder","%s",ponder()?"true":"false");
+
+ // position
+
+ move = (State->state == PONDER) ? State->exp_move : MoveNone;
+ send_board(move); // updates Uci->board global variable
+
+ // search
+
+ if (State->state == THINK || State->state == PONDER) {
+
+ engine_send_queue(Engine,"go");
+
+ if (XB->time_limit) {
+
+ // fixed time per move
+
+ if(XB->node_rate > 0){
+ engine_send_queue(Engine,
+ " nodes %.0f",
+ XB->time_max*((double)XB->node_rate));
+ }else{
+ engine_send_queue(Engine,
+ " movetime %.0f",
+ XB->time_max*1000.0);
+ }
+
+ } else {
+
+ // time controls
+
+ if(XB->node_rate > 0) {
+ double time;
+ move_nb = 40;
+ if (XB->mps != 0){
+ move_nb = XB->mps - (Uci->board->move_nb % XB->mps);
+ }
+ time = XB->my_time / move_nb;
+ if(XB->inc != 0){
+ time += XB->inc;
+ }
+ if(time > XB->my_time){
+ time = XB->my_time;
+ }
+ engine_send_queue(Engine,
+ " nodes %.0f",
+ time*XB->node_rate);
+ } else {
+
+ if (colour_is_white(Uci->board->turn)) {
+ engine_send_queue(Engine,
+ " wtime %.0f btime %.0f",
+ XB->my_time*1000.0,XB->opp_time*1000.0);
+ } else {
+ engine_send_queue(Engine,
+ " wtime %.0f btime %.0f",
+ XB->opp_time*1000.0,XB->my_time*1000.0);
+ }
+
+ if (XB->inc != 0.0){
+ engine_send_queue(Engine,
+ " winc %.0f binc %.0f",
+ XB->inc*1000.0,XB->inc*1000.0);
+ }
+ if (XB->mps != 0) {
+
+ move_nb = XB->mps - (Uci->board->move_nb % XB->mps);
+ ASSERT(move_nb>=1&&move_nb<=XB->mps);
+
+ engine_send_queue(Engine," movestogo %d",move_nb);
+ }
+ }
+ }
+ if (XB->depth_limit) engine_send_queue(Engine," depth %d",XB->depth_max);
+
+ if (State->state == PONDER) engine_send_queue(Engine," ponder");
+
+ engine_send(Engine,""); // newline
+
+ } else if (State->state == ANALYSE) {
+
+ engine_send(Engine,"go infinite");
+
+ } else {
+
+ ASSERT(FALSE);
+ }
+
+ // init search info
+
+ ASSERT(!Uci->searching);
+
+ search_clear();
+
+ Uci->searching = TRUE;
+ Uci->pending_nb++;
+ }
+}
+
+// search_clear()
+
+static void search_clear() {
+
+ uci_clear(Uci);
+
+ // TODO: MOVE ME
+
+ my_timer_start(State->timer);//also resets
+}
+
+// active()
+
+static bool active() {
+
+ // position state
+
+ if (game_status(Game) != PLAYING) return FALSE; // game ended
+
+ // xboard state
+
+ if (XB->analyse) return TRUE; // analysing
+ if (!State->computer[White] && !State->computer[Black]) return FALSE; // force mode
+ if (XB->new_hack || XB->result) return FALSE; // unstarted or ended game
+
+ return TRUE; // playing
+}
+
+// ponder()
+
+static bool ponder() {
+
+ return XB->ponder && (option_get_bool(Option,"CanPonder") ||
+ option_find(Uci->option,"Ponder"));
+}
+// ponder_ok()
+
+static bool ponder_ok(int move) {
+ int status;
+ board_t board[1];
+
+ ASSERT(move==MoveNone||move_is_ok(move));
+
+ // legal ponder move?
+
+ if (move == MoveNone) return FALSE;
+
+ game_get_board(Game,board);
+ if (!move_is_legal(move,board)) return FALSE;
+
+ // UCI-legal resulting position?
+
+ game_add_move(Game,move);
+
+ game_get_board(Game,board);
+ status = game_status(Game);
+
+ game_rem_move(Game);
+
+ if (status != PLAYING) return FALSE; // game ended
+
+ if (option_get_bool(Option,"Book") && is_in_book(board)) {
+ return FALSE;
+ }
+
+ return TRUE;
+}
+
+// stop_search()
+
+static void stop_search() {
+
+ if (Uci->searching) {
+
+ ASSERT(Uci->searching);
+ ASSERT(Uci->pending_nb>=1);
+
+ my_log("POLYGLOT STOP SEARCH\n");
+
+/*
+ engine_send(Engine,"stop");
+ Uci->searching = FALSE;
+*/
+
+ if (option_get_bool(Option,"SyncStop")) {
+ uci_send_stop_sync(Uci);
+ } else {
+ uci_send_stop(Uci);
+ }
+ }
+}
+
+// send_board()
+
+static void send_board(int extra_move) {
+
+ char fen[256];
+ int start, end;
+ board_t board[1];
+ int pos;
+ int move;
+ char string[256];
+
+ ASSERT(extra_move==MoveNone||move_is_ok(extra_move));
+
+ ASSERT(!Uci->searching);
+
+ // init
+
+ game_get_board(Game,Uci->board);
+ if (extra_move != MoveNone) move_do(Uci->board,extra_move);
+
+ board_to_fen(Uci->board,fen,256);
+ my_log("POLYGLOT FEN %s\n",fen);
+
+ ASSERT(board_can_play(Uci->board));
+
+ // more init
+
+ start = 0;
+ end = game_pos(Game);
+ ASSERT(end>=start);
+
+ // position
+
+ game_get_board_ex(Game,board,start);
+ board_to_fen(board,string,256);
+
+ engine_send_queue(Engine,"position");
+
+ if (my_string_equal(string,StartFen)) {
+ engine_send_queue(Engine," startpos");
+ } else {
+ engine_send_queue(Engine," fen %s",string);
+ }
+
+ // move list
+
+ if (end > start || extra_move != MoveNone) engine_send_queue(Engine," moves");
+
+ for (pos = start; pos < end; pos++) { // game moves
+
+ move = game_move(Game,pos);
+
+ move_to_can(move,board,string,256);
+ engine_send_queue(Engine," %s",string);
+
+ move_do(board,move);
+ }
+
+ if (extra_move != MoveNone) { // move to ponder on
+ move_to_can(extra_move,board,string,256);
+ engine_send_queue(Engine," %s",string);
+ }
+
+ // end
+
+ engine_send(Engine,""); // newline
+}
+
+// send_info()
+
+static void send_info() {
+ int min_depth;
+ if(option_get_bool(Option,"WbWorkArounds2")){
+ // Silly bug in some versions of WinBoard.
+ // depth <=1 clears the engine output window.
+ // Why shouldn't an engine be allowed to send info at depth 1?
+ min_depth=2;
+ }else{
+ min_depth=1;
+ }
+ gui_send(GUI,"%d %+d %.0f "S64_FORMAT" %s",Uci->best_depth>min_depth?Uci->best_depth:min_depth,
+ 0,0,0.0,0,Uci->info);
+}
+
+// send_pv()
+
+static void send_pv() {
+
+ char pv_string[StringSize];
+ board_t board[1];
+ int move;
+ char move_string[StringSize];
+
+ ASSERT(State->state!=WAIT);
+
+ if (Uci->best_depth == 0) return;
+
+ // xboard search information
+
+ if (XB->post) {
+
+ if (State->state == THINK || State->state == ANALYSE) {
+
+ line_to_san(Uci->best_pv,Uci->board,pv_string,StringSize);
+
+ if(Uci->depth==-1) //hack to clear the engine output window
+ gui_send(GUI,"%d %+d %.0f "S64_FORMAT" ",0,report_best_score(),Uci->time*100.0,Uci->node_nb);
+
+ gui_send(GUI,"%d %+d %.0f "S64_FORMAT" %s",Uci->best_depth,report_best_score(),Uci->time*100.0,Uci->node_nb,pv_string);
+
+ } else if (State->state == PONDER &&
+ option_get_bool(Option,"ShowPonder")) {
+
+ game_get_board(Game,board);
+ move = State->exp_move;
+
+ if (move != MoveNone && move_is_legal(move,board)) {
+ move_to_san(move,board,move_string,256);
+ line_to_san(Uci->best_pv,Uci->board,pv_string,StringSize);
+ gui_send(GUI,"%d %+d %.0f "S64_FORMAT" (%s) %s",Uci->best_depth,report_best_score(),Uci->time*100.0,Uci->node_nb,move_string,pv_string);
+ }
+ }
+ }
+
+ // kibitz
+
+ if ((Uci->searching &&
+ option_get_bool(Option,"KibitzPV") &&
+ Uci->time >= option_get_double(Option,"KibitzDelay"))
+ || (!Uci->searching && option_get_bool(Option,"KibitzMove"))) {
+
+ if (State->state == THINK || State->state == ANALYSE) {
+
+ line_to_san(Uci->best_pv,Uci->board,pv_string,StringSize);
+ if(kibitz_throttle(Uci->searching)){
+ gui_send(GUI,"%s depth=%d time=%.2f node="S64_FORMAT" speed=%.0f score=%+.2f pv=\"%s\"",option_get_string(Option,"KibitzCommand"),Uci->best_depth,Uci->time,Uci->node_nb,Uci->speed,((double)report_best_score())/100.0,pv_string);
+ }
+ } else if (State->state == PONDER) {
+
+ game_get_board(Game,board);
+ move = State->exp_move;
+
+ if (move != MoveNone && move_is_legal(move,board)) {
+ move_to_san(move,board,move_string,256);
+ line_to_san(Uci->best_pv,Uci->board,pv_string,StringSize);
+ if(kibitz_throttle(Uci->searching)){
+ gui_send(GUI,"%s depth=%d time=%.2f node="S64_FORMAT" speed=%.0f score=%+.2f pv=\"(%s) %s\"",option_get_string(Option,"KibitzCommand"),Uci->best_depth,Uci->time,Uci->node_nb,Uci->speed,((double)report_best_score())/100.0,move_string,pv_string);
+ }
+ }
+ }
+ }
+}
+
+// kibitz_throttle()
+
+static bool kibitz_throttle(bool searching){
+ time_t curr_time;
+ static time_t lastKibitzMove=0;
+ static time_t lastKibitzPV=0;
+ curr_time = time(NULL);
+ if(searching){ // KibitzPV
+ if(curr_time >=
+ (option_get_int(Option,"KibitzInterval") + lastKibitzPV)){
+ lastKibitzPV=curr_time;
+ return TRUE;
+ }
+ }else{ // KibitzMove
+ if(curr_time >=
+ (option_get_int(Option,"KibitzInterval") + lastKibitzMove)){
+ lastKibitzPV=curr_time;
+ lastKibitzMove=curr_time;
+ return TRUE;
+ }
+ }
+ return FALSE;
+}
+
+// learn()
+
+static void learn(int result) {
+
+ int pos;
+ board_t board[1];
+ int move;
+
+ ASSERT(result>=-1&&result<=+1);
+
+ ASSERT(XB->result);
+ ASSERT(State->computer[White]||State->computer[Black]);
+
+ // init
+
+ pos = 0;
+
+ if (FALSE) {
+ } else if (State->computer[White]) {
+ pos = 0;
+ } else if (State->computer[Black]) {
+ pos = 1;
+ result = -result;
+ } else {
+ my_fatal("learn(): unknown side\n");
+ }
+
+ if (FALSE) {
+ } else if (result > 0) {
+ my_log("POLYGLOT *LEARN WIN*\n");
+ } else if (result < 0) {
+ my_log("POLYGLOT *LEARN LOSS*\n");
+ } else {
+ my_log("POLYGLOT *LEARN DRAW*\n");
+ }
+
+ // loop
+
+ for (; pos < Game->size; pos += 2) {
+
+ game_get_board_ex(Game,board,pos);
+ move = game_move(Game,pos);
+
+ book_learn_move(board,move,result);
+ }
+
+ book_flush();
+}
+
+// end of xboard2uci.c
-\r
-// xboard2uci.h\r
-\r
-#ifndef XBOARD2UCI_H\r
-#define XBOARD2UCI_H\r
-\r
-// includes\r
-\r
-#include "util.h"\r
-\r
-// types\r
-\r
-// functions\r
-\r
-extern void xboard2uci_init ();\r
-extern void xboard2uci_gui_step (char string[]);\r
-extern void xboard2uci_engine_step (char string[]);\r
-extern void xboard2uci_send_options ();\r
-\r
-\r
-#endif // !defined XBOARD2UCI_H\r
-\r
-// end of xboard2uci.h\r
-\r
+
+// xboard2uci.h
+
+#ifndef XBOARD2UCI_H
+#define XBOARD2UCI_H
+
+// includes
+
+#include "util.h"
+
+// types
+
+// functions
+
+extern void xboard2uci_init ();
+extern void xboard2uci_gui_step (char string[]);
+extern void xboard2uci_engine_step (char string[]);
+extern void xboard2uci_send_options ();
+
+
+#endif // !defined XBOARD2UCI_H
+
+// end of xboard2uci.h
+
projects / polyglot.git / commitdiff