Kasianov Nikolai Alekseevich
1 year ago
commit
58a8a3008f
23 changed files with 2718 additions and 0 deletions
@ -0,0 +1,661 @@
|
||||
GNU AFFERO GENERAL PUBLIC LICENSE |
||||
Version 3, 19 November 2007 |
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/> |
||||
Everyone is permitted to copy and distribute verbatim copies |
||||
of this license document, but changing it is not allowed. |
||||
|
||||
Preamble |
||||
|
||||
The GNU Affero General Public License is a free, copyleft license for |
||||
software and other kinds of works, specifically designed to ensure |
||||
cooperation with the community in the case of network server software. |
||||
|
||||
The licenses for most software and other practical works are designed |
||||
to take away your freedom to share and change the works. By contrast, |
||||
our General Public Licenses are intended to guarantee your freedom to |
||||
share and change all versions of a program--to make sure it remains free |
||||
software for all its users. |
||||
|
||||
When we speak of free software, we are referring to freedom, not |
||||
price. Our General Public Licenses are designed to make sure that you |
||||
have the freedom to distribute copies of free software (and charge for |
||||
them if you wish), that you receive source code or can get it if you |
||||
want it, that you can change the software or use pieces of it in new |
||||
free programs, and that you know you can do these things. |
||||
|
||||
Developers that use our General Public Licenses protect your rights |
||||
with two steps: (1) assert copyright on the software, and (2) offer |
||||
you this License which gives you legal permission to copy, distribute |
||||
and/or modify the software. |
||||
|
||||
A secondary benefit of defending all users' freedom is that |
||||
improvements made in alternate versions of the program, if they |
||||
receive widespread use, become available for other developers to |
||||
incorporate. Many developers of free software are heartened and |
||||
encouraged by the resulting cooperation. However, in the case of |
||||
software used on network servers, this result may fail to come about. |
||||
The GNU General Public License permits making a modified version and |
||||
letting the public access it on a server without ever releasing its |
||||
source code to the public. |
||||
|
||||
The GNU Affero General Public License is designed specifically to |
||||
ensure that, in such cases, the modified source code becomes available |
||||
to the community. It requires the operator of a network server to |
||||
provide the source code of the modified version running there to the |
||||
users of that server. Therefore, public use of a modified version, on |
||||
a publicly accessible server, gives the public access to the source |
||||
code of the modified version. |
||||
|
||||
An older license, called the Affero General Public License and |
||||
published by Affero, was designed to accomplish similar goals. This is |
||||
a different license, not a version of the Affero GPL, but Affero has |
||||
released a new version of the Affero GPL which permits relicensing under |
||||
this license. |
||||
|
||||
The precise terms and conditions for copying, distribution and |
||||
modification follow. |
||||
|
||||
TERMS AND CONDITIONS |
||||
|
||||
0. Definitions. |
||||
|
||||
"This License" refers to version 3 of the GNU Affero General Public License. |
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of |
||||
works, such as semiconductor masks. |
||||
|
||||
"The Program" refers to any copyrightable work licensed under this |
||||
License. Each licensee is addressed as "you". "Licensees" and |
||||
"recipients" may be individuals or organizations. |
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work |
||||
in a fashion requiring copyright permission, other than the making of an |
||||
exact copy. The resulting work is called a "modified version" of the |
||||
earlier work or a work "based on" the earlier work. |
||||
|
||||
A "covered work" means either the unmodified Program or a work based |
||||
on the Program. |
||||
|
||||
To "propagate" a work means to do anything with it that, without |
||||
permission, would make you directly or secondarily liable for |
||||
infringement under applicable copyright law, except executing it on a |
||||
computer or modifying a private copy. Propagation includes copying, |
||||
distribution (with or without modification), making available to the |
||||
public, and in some countries other activities as well. |
||||
|
||||
To "convey" a work means any kind of propagation that enables other |
||||
parties to make or receive copies. Mere interaction with a user through |
||||
a computer network, with no transfer of a copy, is not conveying. |
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices" |
||||
to the extent that it includes a convenient and prominently visible |
||||
feature that (1) displays an appropriate copyright notice, and (2) |
||||
tells the user that there is no warranty for the work (except to the |
||||
extent that warranties are provided), that licensees may convey the |
||||
work under this License, and how to view a copy of this License. If |
||||
the interface presents a list of user commands or options, such as a |
||||
menu, a prominent item in the list meets this criterion. |
||||
|
||||
1. Source Code. |
||||
|
||||
The "source code" for a work means the preferred form of the work |
||||
for making modifications to it. "Object code" means any non-source |
||||
form of a work. |
||||
|
||||
A "Standard Interface" means an interface that either is an official |
||||
standard defined by a recognized standards body, or, in the case of |
||||
interfaces specified for a particular programming language, one that |
||||
is widely used among developers working in that language. |
||||
|
||||
The "System Libraries" of an executable work include anything, other |
||||
than the work as a whole, that (a) is included in the normal form of |
||||
packaging a Major Component, but which is not part of that Major |
||||
Component, and (b) serves only to enable use of the work with that |
||||
Major Component, or to implement a Standard Interface for which an |
||||
implementation is available to the public in source code form. A |
||||
"Major Component", in this context, means a major essential component |
||||
(kernel, window system, and so on) of the specific operating system |
||||
(if any) on which the executable work runs, or a compiler used to |
||||
produce the work, or an object code interpreter used to run it. |
||||
|
||||
The "Corresponding Source" for a work in object code form means all |
||||
the source code needed to generate, install, and (for an executable |
||||
work) run the object code and to modify the work, including scripts to |
||||
control those activities. However, it does not include the work's |
||||
System Libraries, or general-purpose tools or generally available free |
||||
programs which are used unmodified in performing those activities but |
||||
which are not part of the work. For example, Corresponding Source |
||||
includes interface definition files associated with source files for |
||||
the work, and the source code for shared libraries and dynamically |
||||
linked subprograms that the work is specifically designed to require, |
||||
such as by intimate data communication or control flow between those |
||||
subprograms and other parts of the work. |
||||
|
||||
The Corresponding Source need not include anything that users |
||||
can regenerate automatically from other parts of the Corresponding |
||||
Source. |
||||
|
||||
The Corresponding Source for a work in source code form is that |
||||
same work. |
||||
|
||||
2. Basic Permissions. |
||||
|
||||
All rights granted under this License are granted for the term of |
||||
copyright on the Program, and are irrevocable provided the stated |
||||
conditions are met. This License explicitly affirms your unlimited |
||||
permission to run the unmodified Program. The output from running a |
||||
covered work is covered by this License only if the output, given its |
||||
content, constitutes a covered work. This License acknowledges your |
||||
rights of fair use or other equivalent, as provided by copyright law. |
||||
|
||||
You may make, run and propagate covered works that you do not |
||||
convey, without conditions so long as your license otherwise remains |
||||
in force. You may convey covered works to others for the sole purpose |
||||
of having them make modifications exclusively for you, or provide you |
||||
with facilities for running those works, provided that you comply with |
||||
the terms of this License in conveying all material for which you do |
||||
not control copyright. Those thus making or running the covered works |
||||
for you must do so exclusively on your behalf, under your direction |
||||
and control, on terms that prohibit them from making any copies of |
||||
your copyrighted material outside their relationship with you. |
||||
|
||||
Conveying under any other circumstances is permitted solely under |
||||
the conditions stated below. Sublicensing is not allowed; section 10 |
||||
makes it unnecessary. |
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law. |
||||
|
||||
No covered work shall be deemed part of an effective technological |
||||
measure under any applicable law fulfilling obligations under article |
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or |
||||
similar laws prohibiting or restricting circumvention of such |
||||
measures. |
||||
|
||||
When you convey a covered work, you waive any legal power to forbid |
||||
circumvention of technological measures to the extent such circumvention |
||||
is effected by exercising rights under this License with respect to |
||||
the covered work, and you disclaim any intention to limit operation or |
||||
modification of the work as a means of enforcing, against the work's |
||||
users, your or third parties' legal rights to forbid circumvention of |
||||
technological measures. |
||||
|
||||
4. Conveying Verbatim Copies. |
||||
|
||||
You may convey verbatim copies of the Program's source code as you |
||||
receive it, in any medium, provided that you conspicuously and |
||||
appropriately publish on each copy an appropriate copyright notice; |
||||
keep intact all notices stating that this License and any |
||||
non-permissive terms added in accord with section 7 apply to the code; |
||||
keep intact all notices of the absence of any warranty; and give all |
||||
recipients a copy of this License along with the Program. |
||||
|
||||
You may charge any price or no price for each copy that you convey, |
||||
and you may offer support or warranty protection for a fee. |
||||
|
||||
5. Conveying Modified Source Versions. |
||||
|
||||
You may convey a work based on the Program, or the modifications to |
||||
produce it from the Program, in the form of source code under the |
||||
terms of section 4, provided that you also meet all of these conditions: |
||||
|
||||
a) The work must carry prominent notices stating that you modified |
||||
it, and giving a relevant date. |
||||
|
||||
b) The work must carry prominent notices stating that it is |
||||
released under this License and any conditions added under section |
||||
7. This requirement modifies the requirement in section 4 to |
||||
"keep intact all notices". |
||||
|
||||
c) You must license the entire work, as a whole, under this |
||||
License to anyone who comes into possession of a copy. This |
||||
License will therefore apply, along with any applicable section 7 |
||||
additional terms, to the whole of the work, and all its parts, |
||||
regardless of how they are packaged. This License gives no |
||||
permission to license the work in any other way, but it does not |
||||
invalidate such permission if you have separately received it. |
||||
|
||||
d) If the work has interactive user interfaces, each must display |
||||
Appropriate Legal Notices; however, if the Program has interactive |
||||
interfaces that do not display Appropriate Legal Notices, your |
||||
work need not make them do so. |
||||
|
||||
A compilation of a covered work with other separate and independent |
||||
works, which are not by their nature extensions of the covered work, |
||||
and which are not combined with it such as to form a larger program, |
||||
in or on a volume of a storage or distribution medium, is called an |
||||
"aggregate" if the compilation and its resulting copyright are not |
||||
used to limit the access or legal rights of the compilation's users |
||||
beyond what the individual works permit. Inclusion of a covered work |
||||
in an aggregate does not cause this License to apply to the other |
||||
parts of the aggregate. |
||||
|
||||
6. Conveying Non-Source Forms. |
||||
|
||||
You may convey a covered work in object code form under the terms |
||||
of sections 4 and 5, provided that you also convey the |
||||
machine-readable Corresponding Source under the terms of this License, |
||||
in one of these ways: |
||||
|
||||
a) Convey the object code in, or embodied in, a physical product |
||||
(including a physical distribution medium), accompanied by the |
||||
Corresponding Source fixed on a durable physical medium |
||||
customarily used for software interchange. |
||||
|
||||
b) Convey the object code in, or embodied in, a physical product |
||||
(including a physical distribution medium), accompanied by a |
||||
written offer, valid for at least three years and valid for as |
||||
long as you offer spare parts or customer support for that product |
||||
model, to give anyone who possesses the object code either (1) a |
||||
copy of the Corresponding Source for all the software in the |
||||
product that is covered by this License, on a durable physical |
||||
medium customarily used for software interchange, for a price no |
||||
more than your reasonable cost of physically performing this |
||||
conveying of source, or (2) access to copy the |
||||
Corresponding Source from a network server at no charge. |
||||
|
||||
c) Convey individual copies of the object code with a copy of the |
||||
written offer to provide the Corresponding Source. This |
||||
alternative is allowed only occasionally and noncommercially, and |
||||
only if you received the object code with such an offer, in accord |
||||
with subsection 6b. |
||||
|
||||
d) Convey the object code by offering access from a designated |
||||
place (gratis or for a charge), and offer equivalent access to the |
||||
Corresponding Source in the same way through the same place at no |
||||
further charge. You need not require recipients to copy the |
||||
Corresponding Source along with the object code. If the place to |
||||
copy the object code is a network server, the Corresponding Source |
||||
may be on a different server (operated by you or a third party) |
||||
that supports equivalent copying facilities, provided you maintain |
||||
clear directions next to the object code saying where to find the |
||||
Corresponding Source. Regardless of what server hosts the |
||||
Corresponding Source, you remain obligated to ensure that it is |
||||
available for as long as needed to satisfy these requirements. |
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided |
||||
you inform other peers where the object code and Corresponding |
||||
Source of the work are being offered to the general public at no |
||||
charge under subsection 6d. |
||||
|
||||
A separable portion of the object code, whose source code is excluded |
||||
from the Corresponding Source as a System Library, need not be |
||||
included in conveying the object code work. |
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any |
||||
tangible personal property which is normally used for personal, family, |
||||
or household purposes, or (2) anything designed or sold for incorporation |
||||
into a dwelling. In determining whether a product is a consumer product, |
||||
doubtful cases shall be resolved in favor of coverage. For a particular |
||||
product received by a particular user, "normally used" refers to a |
||||
typical or common use of that class of product, regardless of the status |
||||
of the particular user or of the way in which the particular user |
||||
actually uses, or expects or is expected to use, the product. A product |
||||
is a consumer product regardless of whether the product has substantial |
||||
commercial, industrial or non-consumer uses, unless such uses represent |
||||
the only significant mode of use of the product. |
||||
|
||||
"Installation Information" for a User Product means any methods, |
||||
procedures, authorization keys, or other information required to install |
||||
and execute modified versions of a covered work in that User Product from |
||||
a modified version of its Corresponding Source. The information must |
||||
suffice to ensure that the continued functioning of the modified object |
||||
code is in no case prevented or interfered with solely because |
||||
modification has been made. |
||||
|
||||
If you convey an object code work under this section in, or with, or |
||||
specifically for use in, a User Product, and the conveying occurs as |
||||
part of a transaction in which the right of possession and use of the |
||||
User Product is transferred to the recipient in perpetuity or for a |
||||
fixed term (regardless of how the transaction is characterized), the |
||||
Corresponding Source conveyed under this section must be accompanied |
||||
by the Installation Information. But this requirement does not apply |
||||
if neither you nor any third party retains the ability to install |
||||
modified object code on the User Product (for example, the work has |
||||
been installed in ROM). |
||||
|
||||
The requirement to provide Installation Information does not include a |
||||
requirement to continue to provide support service, warranty, or updates |
||||
for a work that has been modified or installed by the recipient, or for |
||||
the User Product in which it has been modified or installed. Access to a |
||||
network may be denied when the modification itself materially and |
||||
adversely affects the operation of the network or violates the rules and |
||||
protocols for communication across the network. |
||||
|
||||
Corresponding Source conveyed, and Installation Information provided, |
||||
in accord with this section must be in a format that is publicly |
||||
documented (and with an implementation available to the public in |
||||
source code form), and must require no special password or key for |
||||
unpacking, reading or copying. |
||||
|
||||
7. Additional Terms. |
||||
|
||||
"Additional permissions" are terms that supplement the terms of this |
||||
License by making exceptions from one or more of its conditions. |
||||
Additional permissions that are applicable to the entire Program shall |
||||
be treated as though they were included in this License, to the extent |
||||
that they are valid under applicable law. If additional permissions |
||||
apply only to part of the Program, that part may be used separately |
||||
under those permissions, but the entire Program remains governed by |
||||
this License without regard to the additional permissions. |
||||
|
||||
When you convey a copy of a covered work, you may at your option |
||||
remove any additional permissions from that copy, or from any part of |
||||
it. (Additional permissions may be written to require their own |
||||
removal in certain cases when you modify the work.) You may place |
||||
additional permissions on material, added by you to a covered work, |
||||
for which you have or can give appropriate copyright permission. |
||||
|
||||
Notwithstanding any other provision of this License, for material you |
||||
add to a covered work, you may (if authorized by the copyright holders of |
||||
that material) supplement the terms of this License with terms: |
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the |
||||
terms of sections 15 and 16 of this License; or |
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or |
||||
author attributions in that material or in the Appropriate Legal |
||||
Notices displayed by works containing it; or |
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or |
||||
requiring that modified versions of such material be marked in |
||||
reasonable ways as different from the original version; or |
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or |
||||
authors of the material; or |
||||
|
||||
e) Declining to grant rights under trademark law for use of some |
||||
trade names, trademarks, or service marks; or |
||||
|
||||
f) Requiring indemnification of licensors and authors of that |
||||
material by anyone who conveys the material (or modified versions of |
||||
it) with contractual assumptions of liability to the recipient, for |
||||
any liability that these contractual assumptions directly impose on |
||||
those licensors and authors. |
||||
|
||||
All other non-permissive additional terms are considered "further |
||||
restrictions" within the meaning of section 10. If the Program as you |
||||
received it, or any part of it, contains a notice stating that it is |
||||
governed by this License along with a term that is a further |
||||
restriction, you may remove that term. If a license document contains |
||||
a further restriction but permits relicensing or conveying under this |
||||
License, you may add to a covered work material governed by the terms |
||||
of that license document, provided that the further restriction does |
||||
not survive such relicensing or conveying. |
||||
|
||||
If you add terms to a covered work in accord with this section, you |
||||
must place, in the relevant source files, a statement of the |
||||
additional terms that apply to those files, or a notice indicating |
||||
where to find the applicable terms. |
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the |
||||
form of a separately written license, or stated as exceptions; |
||||
the above requirements apply either way. |
||||
|
||||
8. Termination. |
||||
|
||||
You may not propagate or modify a covered work except as expressly |
||||
provided under this License. Any attempt otherwise to propagate or |
||||
modify it is void, and will automatically terminate your rights under |
||||
this License (including any patent licenses granted under the third |
||||
paragraph of section 11). |
||||
|
||||
However, if you cease all violation of this License, then your |
||||
license from a particular copyright holder is reinstated (a) |
||||
provisionally, unless and until the copyright holder explicitly and |
||||
finally terminates your license, and (b) permanently, if the copyright |
||||
holder fails to notify you of the violation by some reasonable means |
||||
prior to 60 days after the cessation. |
||||
|
||||
Moreover, your license from a particular copyright holder is |
||||
reinstated permanently if the copyright holder notifies you of the |
||||
violation by some reasonable means, this is the first time you have |
||||
received notice of violation of this License (for any work) from that |
||||
copyright holder, and you cure the violation prior to 30 days after |
||||
your receipt of the notice. |
||||
|
||||
Termination of your rights under this section does not terminate the |
||||
licenses of parties who have received copies or rights from you under |
||||
this License. If your rights have been terminated and not permanently |
||||
reinstated, you do not qualify to receive new licenses for the same |
||||
material under section 10. |
||||
|
||||
9. Acceptance Not Required for Having Copies. |
||||
|
||||
You are not required to accept this License in order to receive or |
||||
run a copy of the Program. Ancillary propagation of a covered work |
||||
occurring solely as a consequence of using peer-to-peer transmission |
||||
to receive a copy likewise does not require acceptance. However, |
||||
nothing other than this License grants you permission to propagate or |
||||
modify any covered work. These actions infringe copyright if you do |
||||
not accept this License. Therefore, by modifying or propagating a |
||||
covered work, you indicate your acceptance of this License to do so. |
||||
|
||||
10. Automatic Licensing of Downstream Recipients. |
||||
|
||||
Each time you convey a covered work, the recipient automatically |
||||
receives a license from the original licensors, to run, modify and |
||||
propagate that work, subject to this License. You are not responsible |
||||
for enforcing compliance by third parties with this License. |
||||
|
||||
An "entity transaction" is a transaction transferring control of an |
||||
organization, or substantially all assets of one, or subdividing an |
||||
organization, or merging organizations. If propagation of a covered |
||||
work results from an entity transaction, each party to that |
||||
transaction who receives a copy of the work also receives whatever |
||||
licenses to the work the party's predecessor in interest had or could |
||||
give under the previous paragraph, plus a right to possession of the |
||||
Corresponding Source of the work from the predecessor in interest, if |
||||
the predecessor has it or can get it with reasonable efforts. |
||||
|
||||
You may not impose any further restrictions on the exercise of the |
||||
rights granted or affirmed under this License. For example, you may |
||||
not impose a license fee, royalty, or other charge for exercise of |
||||
rights granted under this License, and you may not initiate litigation |
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that |
||||
any patent claim is infringed by making, using, selling, offering for |
||||
sale, or importing the Program or any portion of it. |
||||
|
||||
11. Patents. |
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this |
||||
License of the Program or a work on which the Program is based. The |
||||
work thus licensed is called the contributor's "contributor version". |
||||
|
||||
A contributor's "essential patent claims" are all patent claims |
||||
owned or controlled by the contributor, whether already acquired or |
||||
hereafter acquired, that would be infringed by some manner, permitted |
||||
by this License, of making, using, or selling its contributor version, |
||||
but do not include claims that would be infringed only as a |
||||
consequence of further modification of the contributor version. For |
||||
purposes of this definition, "control" includes the right to grant |
||||
patent sublicenses in a manner consistent with the requirements of |
||||
this License. |
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free |
||||
patent license under the contributor's essential patent claims, to |
||||
make, use, sell, offer for sale, import and otherwise run, modify and |
||||
propagate the contents of its contributor version. |
||||
|
||||
In the following three paragraphs, a "patent license" is any express |
||||
agreement or commitment, however denominated, not to enforce a patent |
||||
(such as an express permission to practice a patent or covenant not to |
||||
sue for patent infringement). To "grant" such a patent license to a |
||||
party means to make such an agreement or commitment not to enforce a |
||||
patent against the party. |
||||
|
||||
If you convey a covered work, knowingly relying on a patent license, |
||||
and the Corresponding Source of the work is not available for anyone |
||||
to copy, free of charge and under the terms of this License, through a |
||||
publicly available network server or other readily accessible means, |
||||
then you must either (1) cause the Corresponding Source to be so |
||||
available, or (2) arrange to deprive yourself of the benefit of the |
||||
patent license for this particular work, or (3) arrange, in a manner |
||||
consistent with the requirements of this License, to extend the patent |
||||
license to downstream recipients. "Knowingly relying" means you have |
||||
actual knowledge that, but for the patent license, your conveying the |
||||
covered work in a country, or your recipient's use of the covered work |
||||
in a country, would infringe one or more identifiable patents in that |
||||
country that you have reason to believe are valid. |
||||
|
||||
If, pursuant to or in connection with a single transaction or |
||||
arrangement, you convey, or propagate by procuring conveyance of, a |
||||
covered work, and grant a patent license to some of the parties |
||||
receiving the covered work authorizing them to use, propagate, modify |
||||
or convey a specific copy of the covered work, then the patent license |
||||
you grant is automatically extended to all recipients of the covered |
||||
work and works based on it. |
||||
|
||||
A patent license is "discriminatory" if it does not include within |
||||
the scope of its coverage, prohibits the exercise of, or is |
||||
conditioned on the non-exercise of one or more of the rights that are |
||||
specifically granted under this License. You may not convey a covered |
||||
work if you are a party to an arrangement with a third party that is |
||||
in the business of distributing software, under which you make payment |
||||
to the third party based on the extent of your activity of conveying |
||||
the work, and under which the third party grants, to any of the |
||||
parties who would receive the covered work from you, a discriminatory |
||||
patent license (a) in connection with copies of the covered work |
||||
conveyed by you (or copies made from those copies), or (b) primarily |
||||
for and in connection with specific products or compilations that |
||||
contain the covered work, unless you entered into that arrangement, |
||||
or that patent license was granted, prior to 28 March 2007. |
||||
|
||||
Nothing in this License shall be construed as excluding or limiting |
||||
any implied license or other defenses to infringement that may |
||||
otherwise be available to you under applicable patent law. |
||||
|
||||
12. No Surrender of Others' Freedom. |
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or |
||||
otherwise) that contradict the conditions of this License, they do not |
||||
excuse you from the conditions of this License. If you cannot convey a |
||||
covered work so as to satisfy simultaneously your obligations under this |
||||
License and any other pertinent obligations, then as a consequence you may |
||||
not convey it at all. For example, if you agree to terms that obligate you |
||||
to collect a royalty for further conveying from those to whom you convey |
||||
the Program, the only way you could satisfy both those terms and this |
||||
License would be to refrain entirely from conveying the Program. |
||||
|
||||
13. Remote Network Interaction; Use with the GNU General Public License. |
||||
|
||||
Notwithstanding any other provision of this License, if you modify the |
||||
Program, your modified version must prominently offer all users |
||||
interacting with it remotely through a computer network (if your version |
||||
supports such interaction) an opportunity to receive the Corresponding |
||||
Source of your version by providing access to the Corresponding Source |
||||
from a network server at no charge, through some standard or customary |
||||
means of facilitating copying of software. This Corresponding Source |
||||
shall include the Corresponding Source for any work covered by version 3 |
||||
of the GNU General Public License that is incorporated pursuant to the |
||||
following paragraph. |
||||
|
||||
Notwithstanding any other provision of this License, you have |
||||
permission to link or combine any covered work with a work licensed |
||||
under version 3 of the GNU General Public License into a single |
||||
combined work, and to convey the resulting work. The terms of this |
||||
License will continue to apply to the part which is the covered work, |
||||
but the work with which it is combined will remain governed by version |
||||
3 of the GNU General Public License. |
||||
|
||||
14. Revised Versions of this License. |
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of |
||||
the GNU Affero General Public License from time to time. Such new versions |
||||
will be similar in spirit to the present version, but may differ in detail to |
||||
address new problems or concerns. |
||||
|
||||
Each version is given a distinguishing version number. If the |
||||
Program specifies that a certain numbered version of the GNU Affero General |
||||
Public License "or any later version" applies to it, you have the |
||||
option of following the terms and conditions either of that numbered |
||||
version or of any later version published by the Free Software |
||||
Foundation. If the Program does not specify a version number of the |
||||
GNU Affero General Public License, you may choose any version ever published |
||||
by the Free Software Foundation. |
||||
|
||||
If the Program specifies that a proxy can decide which future |
||||
versions of the GNU Affero General Public License can be used, that proxy's |
||||
public statement of acceptance of a version permanently authorizes you |
||||
to choose that version for the Program. |
||||
|
||||
Later license versions may give you additional or different |
||||
permissions. However, no additional obligations are imposed on any |
||||
author or copyright holder as a result of your choosing to follow a |
||||
later version. |
||||
|
||||
15. Disclaimer of Warranty. |
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY |
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT |
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY |
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, |
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM |
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF |
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION. |
||||
|
||||
16. Limitation of Liability. |
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING |
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS |
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY |
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE |
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF |
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD |
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), |
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF |
||||
SUCH DAMAGES. |
||||
|
||||
17. Interpretation of Sections 15 and 16. |
||||
|
||||
If the disclaimer of warranty and limitation of liability provided |
||||
above cannot be given local legal effect according to their terms, |
||||
reviewing courts shall apply local law that most closely approximates |
||||
an absolute waiver of all civil liability in connection with the |
||||
Program, unless a warranty or assumption of liability accompanies a |
||||
copy of the Program in return for a fee. |
||||
|
||||
END OF TERMS AND CONDITIONS |
||||
|
||||
How to Apply These Terms to Your New Programs |
||||
|
||||
If you develop a new program, and you want it to be of the greatest |
||||
possible use to the public, the best way to achieve this is to make it |
||||
free software which everyone can redistribute and change under these terms. |
||||
|
||||
To do so, attach the following notices to the program. It is safest |
||||
to attach them to the start of each source file to most effectively |
||||
state the exclusion of warranty; and each file should have at least |
||||
the "copyright" line and a pointer to where the full notice is found. |
||||
|
||||
<one line to give the program's name and a brief idea of what it does.> |
||||
Copyright (C) <year> <name of author> |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>. |
||||
|
||||
Also add information on how to contact you by electronic and paper mail. |
||||
|
||||
If your software can interact with users remotely through a computer |
||||
network, you should also make sure that it provides a way for users to |
||||
get its source. For example, if your program is a web application, its |
||||
interface could display a "Source" link that leads users to an archive |
||||
of the code. There are many ways you could offer source, and different |
||||
solutions will be better for different programs; see section 13 for the |
||||
specific requirements. |
||||
|
||||
You should also get your employer (if you work as a programmer) or school, |
||||
if any, to sign a "copyright disclaimer" for the program, if necessary. |
||||
For more information on this, and how to apply and follow the GNU AGPL, see |
||||
<https://www.gnu.org/licenses/>. |
@ -0,0 +1,6 @@
|
||||
all: |
||||
mkdir -p bin
|
||||
gcc -Wall -Werror -static -O2 src/*.c -o bin/chess
|
||||
|
||||
clean: |
||||
rm -rf bin
|
@ -0,0 +1,26 @@
|
||||
# C3hess - Console Chess written in C |
||||
|
||||
## A portable chess game and an engine in one package |
||||
|
||||
|
||||
## About |
||||
|
||||
|
||||
|
||||
## Building |
||||
|
||||
```make``` |
||||
|
||||
or |
||||
|
||||
```./make.sh``` |
||||
|
||||
or compile yourself, there are no dependencies |
||||
|
||||
|
||||
## Installation |
||||
|
||||
|
||||
## License |
||||
|
||||
AGPLv3 |
@ -0,0 +1,2 @@
|
||||
1. Algebraic notation: notation_move_from_string, notation_move_to_string, documentation |
||||
2. Board: board_is_move_legal, add other piece's moves |
@ -0,0 +1,4 @@
|
||||
#!/bin/sh |
||||
|
||||
mkdir -p bin |
||||
gcc -Wall -Werror -static -O2 src/*.c -o bin/chess |
@ -0,0 +1,335 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#include <stddef.h> |
||||
#include <stdlib.h> |
||||
#include <string.h> |
||||
#include "algebraic_notation.h" |
||||
|
||||
|
||||
// Converts a tile notation to a position on the board
|
||||
Position notation_tile_to_position(TileNotation notation) { |
||||
Position pos; |
||||
switch (notation.file) { |
||||
case 'a': { |
||||
pos.column = 1;
|
||||
break; |
||||
} |
||||
case 'b': { |
||||
pos.column = 2;
|
||||
break; |
||||
} |
||||
case 'c': { |
||||
pos.column = 3;
|
||||
break; |
||||
} |
||||
case 'd': { |
||||
pos.column = 4;
|
||||
break; |
||||
} |
||||
case 'e': { |
||||
pos.column = 5;
|
||||
break; |
||||
} |
||||
case 'f': { |
||||
pos.column = 6;
|
||||
break; |
||||
} |
||||
case 'g': { |
||||
pos.column = 7;
|
||||
break; |
||||
} |
||||
case 'h': { |
||||
pos.column = 8;
|
||||
break; |
||||
} |
||||
default: { |
||||
break; |
||||
} |
||||
} |
||||
pos.row = notation.rank; |
||||
|
||||
return pos; |
||||
} |
||||
|
||||
|
||||
char* notation_tile_to_string(TileNotation tile) { |
||||
char* notation = (char*) malloc(sizeof(char) * 2); |
||||
if (!notation) { |
||||
return NULL; |
||||
} |
||||
|
||||
notation[0] = tile.file; // col
|
||||
notation[1] = (char) tile.rank; // row
|
||||
|
||||
return notation; |
||||
} |
||||
|
||||
void notation_tile_to_string_cpy(TileNotation tile, char* dest) { |
||||
if (!dest) { |
||||
return; |
||||
} |
||||
|
||||
char* notation = notation_tile_to_string(tile); |
||||
strcpy(dest, notation); |
||||
free(notation); |
||||
|
||||
return; |
||||
} |
||||
|
||||
|
||||
TileNotation notation_tile_from_string(const char* tile_string) { |
||||
if (!tile_string) { |
||||
return notation_tile_new('a', 1); |
||||
} |
||||
|
||||
TileNotation tile; |
||||
tile.file = tile_string[0]; |
||||
tile.rank = (unsigned int) tile_string[1]; |
||||
|
||||
return tile; |
||||
} |
||||
|
||||
|
||||
TileNotation notation_tile_new(char file, unsigned int rank) { |
||||
TileNotation tile; |
||||
tile.file = file; |
||||
tile.rank = rank; |
||||
|
||||
return tile; |
||||
} |
||||
|
||||
|
||||
// Converts
|
||||
TileNotation notation_tile_from_pos(Position pos) { |
||||
TileNotation tile;
|
||||
switch (pos.row) { |
||||
case 1: { |
||||
tile.file = 'a';
|
||||
break; |
||||
} |
||||
case 2: { |
||||
tile.file = 'b';
|
||||
break; |
||||
} |
||||
case 3: { |
||||
tile.file = 'c';
|
||||
break; |
||||
} |
||||
case 4: { |
||||
tile.file = 'd';
|
||||
break; |
||||
} |
||||
case 5: { |
||||
tile.file = 'e';
|
||||
break; |
||||
} |
||||
case 6: { |
||||
tile.file = 'f';
|
||||
break; |
||||
} |
||||
case 7: { |
||||
tile.file = 'g';
|
||||
break; |
||||
} |
||||
case 8: { |
||||
tile.file = 'h';
|
||||
break; |
||||
} |
||||
default: { |
||||
tile.file = '\0'; |
||||
break; |
||||
} |
||||
} |
||||
tile.rank = pos.column; |
||||
|
||||
return tile; |
||||
} |
||||
|
||||
|
||||
|
||||
// Returns a piece character. Upper case for white, lower case for black
|
||||
char notation_piece_to_char(Piece piece) { |
||||
switch (piece.type) { |
||||
case KING: { |
||||
if (piece.color == WHITE) { |
||||
return 'K'; |
||||
} else { |
||||
return 'k'; |
||||
} |
||||
break; |
||||
} |
||||
case ROOK: { |
||||
if (piece.color == WHITE) { |
||||
return 'R'; |
||||
} else { |
||||
return 'r'; |
||||
} |
||||
break; |
||||
} |
||||
case BISHOP: { |
||||
if (piece.color == WHITE) { |
||||
return 'B'; |
||||
} else { |
||||
return 'b'; |
||||
} |
||||
break; |
||||
} |
||||
case KNIGHT: { |
||||
if (piece.color == WHITE) { |
||||
return 'N'; |
||||
} else { |
||||
return 'n'; |
||||
} |
||||
break; |
||||
} |
||||
case PAWN: { |
||||
if (piece.color == WHITE) { |
||||
return 'P'; |
||||
} else { |
||||
return 'p'; |
||||
} |
||||
break; |
||||
} |
||||
case QUEEN: { |
||||
if (piece.color == WHITE) { |
||||
return 'Q'; |
||||
} else { |
||||
return 'q'; |
||||
} |
||||
break; |
||||
} |
||||
default: { |
||||
return '\0'; |
||||
} |
||||
}; |
||||
} |
||||
|
||||
|
||||
// Returns 1 if character is one of the piece characters, 0 otherwise
|
||||
int notation_is_piece_char(char character) { |
||||
if ( |
||||
character == 'K' || character == 'k' || \
|
||||
character == 'R' || character == 'r' || \
|
||||
character == 'B' || character == 'b' || \
|
||||
character == 'N' || character == 'n' || \
|
||||
character == 'P' || character == 'p' || \
|
||||
character == 'Q' || character == 'q' |
||||
) { |
||||
return 1; |
||||
} |
||||
|
||||
return 0; |
||||
} |
||||
|
||||
|
||||
char* notation_move_to_string(MoveNotation move) { |
||||
char* move_notation = (char*) malloc(sizeof(char) * 10); |
||||
if (!move_notation) { |
||||
return NULL; |
||||
} |
||||
|
||||
// if (move.move_type == MOVE) {
|
||||
|
||||
// }
|
||||
|
||||
switch (move.move_type) { |
||||
case MOVE: { |
||||
move_notation[0] = notation_piece_to_char(move.piece); |
||||
notation_tile_to_string_cpy(move.target, &move_notation[1]); |
||||
break; |
||||
} |
||||
|
||||
case CHECK: { |
||||
move_notation[0] = notation_piece_to_char(move.piece); |
||||
notation_tile_to_string_cpy(move.target, &move_notation[1]); |
||||
move_notation[3] = '+'; |
||||
break; |
||||
} |
||||
|
||||
case CAPTURE: { |
||||
move_notation[0] = notation_piece_to_char(move.piece); |
||||
move_notation[1] = 'x'; |
||||
notation_tile_to_string_cpy(move.target, &move_notation[2]); |
||||
break; |
||||
} |
||||
|
||||
case CHECK & CAPTURE: { |
||||
move_notation[0] = notation_piece_to_char(move.piece); |
||||
move_notation[1] = 'x'; |
||||
notation_tile_to_string_cpy(move.target, &move_notation[2]); |
||||
move_notation[4] = '+'; |
||||
break; |
||||
} |
||||
|
||||
case SHORTCASTLE: { |
||||
move_notation = strcpy(move_notation, "0-0"); |
||||
break; |
||||
} |
||||
|
||||
// case SHORTCASTLE&CHECK: {
|
||||
|
||||
// }
|
||||
|
||||
case LONGCASTLE: { |
||||
move_notation = strcpy(move_notation, "0-0-0"); |
||||
break; |
||||
} |
||||
|
||||
default: { |
||||
free(move_notation); |
||||
return NULL; |
||||
} |
||||
} |
||||
|
||||
return move_notation; |
||||
} |
||||
|
||||
|
||||
MoveNotation* notation_move_from_string(const char* move_string) { |
||||
if (!move_string) { |
||||
return NULL; |
||||
} |
||||
|
||||
MoveNotation* move = (MoveNotation*) malloc(sizeof(MoveNotation) * 1); |
||||
if (!move) { |
||||
return NULL; |
||||
} |
||||
|
||||
// printf();
|
||||
if (notation_is_piece_char(move_string[0])) { |
||||
|
||||
} |
||||
|
||||
return move; |
||||
} |
||||
|
||||
|
||||
MoveNotation notation_move_new(Piece piece, TileNotation origin, TileNotation target, int move_type); |
||||
|
||||
|
||||
// Converts move notation to a move
|
||||
Move notation_to_move(MoveNotation notation) { |
||||
Move move = move_new( |
||||
notation_tile_to_position(notation.origin), |
||||
notation_tile_to_position(notation.target) |
||||
); |
||||
|
||||
return move; |
||||
} |
@ -0,0 +1,83 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#ifndef algebraic_notation_h |
||||
#define algebraic_notation_h |
||||
|
||||
|
||||
#include "position.h" |
||||
#include "piece.h" |
||||
#include "move.h" |
||||
|
||||
|
||||
typedef struct TileNotation { |
||||
char file; |
||||
unsigned int rank; |
||||
} TileNotation; |
||||
|
||||
|
||||
// Converts a tile notation to a position on the board
|
||||
Position notation_tile_to_position(TileNotation notation); |
||||
|
||||
|
||||
char* notation_tile_to_string(TileNotation tile); |
||||
|
||||
|
||||
void notation_tile_to_string_cpy(TileNotation tile, char* dest); |
||||
|
||||
|
||||
TileNotation notation_tile_from_string(const char* tile_string); |
||||
|
||||
|
||||
TileNotation notation_tile_new(char file, unsigned int rank); |
||||
|
||||
|
||||
// Converts
|
||||
TileNotation notation_tile_from_pos(Position pos); |
||||
|
||||
|
||||
// Returns a piece character. Upper case for white, lower case for black
|
||||
char notation_piece_to_char(Piece piece); |
||||
|
||||
|
||||
// Returns 1 if character is one of the piece characters, 0 otherwise
|
||||
int notation_is_piece_char(char character); |
||||
|
||||
|
||||
typedef struct MoveNotation { |
||||
Piece piece; |
||||
TileNotation origin; |
||||
TileNotation target; |
||||
int move_type; |
||||
} MoveNotation; |
||||
|
||||
|
||||
char* notation_move_to_string(MoveNotation move); |
||||
|
||||
|
||||
MoveNotation* notation_move_from_string(const char* move_string); |
||||
|
||||
|
||||
MoveNotation notation_move_new(Piece piece, TileNotation origin, TileNotation target, int move_type); |
||||
|
||||
|
||||
// Converts move notation to a move
|
||||
Move notation_to_move(MoveNotation notation); |
||||
|
||||
#endif |
@ -0,0 +1,584 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#include "board.h" |
||||
#include "tile.h" |
||||
#include "position.h" |
||||
#include "util.h" |
||||
#include "algebraic_notation.h" |
||||
#include <stddef.h> |
||||
#include <stdlib.h> |
||||
|
||||
|
||||
|
||||
// Returns a newly allocated chess board with pieces placed
|
||||
Board* board_new_default() { |
||||
Board* board = NULL; |
||||
|
||||
board = (Board*) malloc(sizeof(Board) * 1); |
||||
if (!board) { |
||||
return NULL; |
||||
} |
||||
|
||||
board->rows = 8; |
||||
board->columns = 8; |
||||
board->tiles = (Tile*) malloc(sizeof(Tile) * (board->rows * board->columns)); |
||||
if (!board->tiles) { |
||||
free(board); |
||||
return NULL; |
||||
} |
||||
|
||||
// Initialize the board with empty tiles
|
||||
for (int r = 0; r < board->rows; r++) { |
||||
for (int c = 0; c < board->columns; c++) { |
||||
board->tiles[r * board->columns + c] = tile_new_empty(position_new(r, c)); |
||||
} |
||||
} |
||||
|
||||
// Put pieces into their initial positions
|
||||
|
||||
// White
|
||||
board_place_piece(board, position_new(0, 0), piece_new(WHITE, ROOK)); |
||||
board_place_piece(board, position_new(0, 1), piece_new(WHITE, KNIGHT)); |
||||
board_place_piece(board, position_new(0, 2), piece_new(WHITE, BISHOP)); |
||||
board_place_piece(board, position_new(0, 3), piece_new(WHITE, KING)); |
||||
board_place_piece(board, position_new(0, 4), piece_new(WHITE, QUEEN)); |
||||
board_place_piece(board, position_new(0, 5), piece_new(WHITE, BISHOP)); |
||||
board_place_piece(board, position_new(0, 6), piece_new(WHITE, KNIGHT)); |
||||
board_place_piece(board, position_new(0, 7), piece_new(WHITE, ROOK)); |
||||
board_place_piece(board, position_new(1, 0), piece_new(WHITE, PAWN)); |
||||
board_place_piece(board, position_new(1, 1), piece_new(WHITE, PAWN)); |
||||
board_place_piece(board, position_new(1, 2), piece_new(WHITE, PAWN)); |
||||
board_place_piece(board, position_new(1, 3), piece_new(WHITE, PAWN)); |
||||
board_place_piece(board, position_new(1, 4), piece_new(WHITE, PAWN)); |
||||
board_place_piece(board, position_new(1, 5), piece_new(WHITE, PAWN)); |
||||
board_place_piece(board, position_new(1, 6), piece_new(WHITE, PAWN)); |
||||
board_place_piece(board, position_new(1, 7), piece_new(WHITE, PAWN)); |
||||
|
||||
// Black
|
||||
board_place_piece(board, position_new(7, 0), piece_new(BLACK, ROOK)); |
||||
board_place_piece(board, position_new(7, 1), piece_new(BLACK, KNIGHT)); |
||||
board_place_piece(board, position_new(7, 2), piece_new(BLACK, BISHOP)); |
||||
board_place_piece(board, position_new(7, 3), piece_new(BLACK, KING)); |
||||
board_place_piece(board, position_new(7, 4), piece_new(BLACK, QUEEN)); |
||||
board_place_piece(board, position_new(7, 5), piece_new(BLACK, BISHOP)); |
||||
board_place_piece(board, position_new(7, 6), piece_new(BLACK, KNIGHT)); |
||||
board_place_piece(board, position_new(7, 7), piece_new(BLACK, ROOK)); |
||||
board_place_piece(board, position_new(6, 0), piece_new(BLACK, PAWN)); |
||||
board_place_piece(board, position_new(6, 1), piece_new(BLACK, PAWN)); |
||||
board_place_piece(board, position_new(6, 2), piece_new(BLACK, PAWN)); |
||||
board_place_piece(board, position_new(6, 3), piece_new(BLACK, PAWN)); |
||||
board_place_piece(board, position_new(6, 4), piece_new(BLACK, PAWN)); |
||||
board_place_piece(board, position_new(6, 5), piece_new(BLACK, PAWN)); |
||||
board_place_piece(board, position_new(6, 6), piece_new(BLACK, PAWN)); |
||||
board_place_piece(board, position_new(6, 7), piece_new(BLACK, PAWN)); |
||||
|
||||
|
||||
return board; |
||||
} |
||||
|
||||
|
||||
/*
|
||||
Returns a newly allocated chess board with custom amount of
|
||||
rows and columns, without pieces placed |
||||
*/
|
||||
Board* board_new_empty_custom(unsigned int rows, unsigned int columns) { |
||||
Board* board = NULL; |
||||
return board; |
||||
} |
||||
|
||||
|
||||
// Frees up board and sets the pointer to it to NULL
|
||||
void board_delete(Board** board) { |
||||
if (board == NULL) { |
||||
return; |
||||
} else if (*board == NULL) { |
||||
return; |
||||
} |
||||
|
||||
free((*board)->tiles); |
||||
free(*board); |
||||
*board = NULL; |
||||
|
||||
return; |
||||
} |
||||
|
||||
|
||||
// Prints board to some FILE
|
||||
void board_print(const Board* board, FILE* out) { |
||||
if (!board || !out) { |
||||
return; |
||||
} |
||||
|
||||
// Files
|
||||
fputc(' ', out); |
||||
for (unsigned int i = 0; i < board->columns; i++) { |
||||
if (i > 0) { |
||||
fputc(' ', out); |
||||
} |
||||
fputc(0x61 + i, out); |
||||
} |
||||
fputc('\n', out); |
||||
|
||||
|
||||
// Upper border
|
||||
fputc(' ', out); |
||||
for (unsigned int i = 0; i < board->columns; i++) { |
||||
if (i + 1 != board->columns) { |
||||
fputc('_', out); |
||||
} |
||||
fputc('_', out); |
||||
} |
||||
fputc('\n', out); |
||||
|
||||
|
||||
for (unsigned int r = 0; r < board->rows; r++) { |
||||
// Left border
|
||||
fputc('|', out); |
||||
|
||||
for (unsigned int c = 0; c < board->columns; c++) { |
||||
// Tile
|
||||
char tile_character = '\0'; |
||||
|
||||
if ((r + c) % 2 == 0) { |
||||
// tile_character = '▓';
|
||||
tile_character = '#'; |
||||
} else { |
||||
// tile_character = '░';
|
||||
tile_character = ' '; |
||||
} |
||||
|
||||
Tile* tile = board_get_tile(board, position_new(r, c)); |
||||
if (tile->piece.type != NONE) { |
||||
tile_character = notation_piece_to_char(tile->piece); |
||||
} |
||||
|
||||
if (c > 0) { |
||||
fputc(' ', out); |
||||
} |
||||
fputc(tile_character, out); |
||||
} |
||||
|
||||
// Right border
|
||||
fputc('|', out); |
||||
|
||||
|
||||
// Ranks
|
||||
fprintf(out, " %d", board->rows - r); |
||||
|
||||
fputc('\n', out); |
||||
} |
||||
|
||||
// Lower border
|
||||
fputc(' ', out); |
||||
for (unsigned int i = 0; i < board->columns; i++) { |
||||
if (i + 1 != board->columns) { |
||||
fputc('-', out); |
||||
} |
||||
fputc('-', out); |
||||
} |
||||
fputc('\n', out); |
||||
|
||||
|
||||
return; |
||||
} |
||||
|
||||
|
||||
// Checks if given tile position is in bounds on this board. Returns 1 if it is, 0 - otherwise
|
||||
int board_is_tile_in_bounds(const Board* board, Position pos) { |
||||
if (pos.row >= board->rows || pos.column >= board->columns) { |
||||
return 0; |
||||
} |
||||
|
||||
return 1; |
||||
} |
||||
|
||||
|
||||
|
||||
// Retrieves a tile on provided position. If available - returns a pointer to it, if not - returns NULL
|
||||
Tile* board_get_tile_raw(const Board* board, Position pos) { |
||||
if (!board) { |
||||
return NULL; |
||||
} |
||||
|
||||
if (!board_is_tile_in_bounds(board, pos)) { |
||||
return NULL; |
||||
} |
||||
|
||||
return &board->tiles[(pos.row * board->columns) + pos.column]; |
||||
} |
||||
|
||||
|
||||
/*
|
||||
Retrieves a tile on provided position as if (0, 0) is the bottom left tile. If available
|
||||
- returns a pointer to it, if not - returns NULL. |
||||
*/
|
||||
Tile* board_get_tile(const Board* board, Position pos) { |
||||
/*
|
||||
Invert position so, for example (0, 0) would be the leftmost
|
||||
tile on the bottom (as it should be) |
||||
*/ |
||||
Position inverted_pos = position_new( |
||||
_sub_abs(pos.row + 1, board->rows),
|
||||
_sub_abs(pos.column + 1, board->columns) |
||||
); |
||||
|
||||
return board_get_tile_raw(board, inverted_pos); |
||||
} |
||||
|
||||
|
||||
// Returns all tiles with pieces on them on the board
|
||||
Tile** board_get_occupied_tiles(const Board* board) { |
||||
if (!board) { |
||||
return NULL; |
||||
} |
||||
|
||||
unsigned int i = 0; |
||||
Tile** occupied_tiles = (Tile**) malloc(sizeof(Tile) * board->rows * board->columns); |
||||
if (!occupied_tiles) { |
||||
return NULL; |
||||
} |
||||
|
||||
// Loop through the whole board
|
||||
Tile* tile = NULL; |
||||
for (unsigned int r = 0; r < board->rows; r++) { |
||||
for (unsigned int c = 0; c < board->columns; c++) { |
||||
// Always in bounds
|
||||
if (board_is_tile_occupied(board, position_new(r, c))) { |
||||
// It is occupied!
|
||||
occupied_tiles[i] = tile; |
||||
i++; |
||||
} |
||||
} |
||||
} |
||||
|
||||
// Realloc
|
||||
occupied_tiles = realloc(occupied_tiles, sizeof(Tile) * i); |
||||
|
||||
return occupied_tiles; |
||||
} |
||||
|
||||
|
||||
// Places a piece on a tile with provided position. Returns 1 if the piece has been placed, 0 if position is out of bounds
|
||||
int board_place_piece(Board* board, Position pos, Piece piece) { |
||||
if (!board) { |
||||
return 0; |
||||
} |
||||
|
||||
/*
|
||||
Invert position so, for example (0, 0) would be the leftmost
|
||||
tile on the bottom (as it should be) |
||||
*/ |
||||
Position inverted_pos = position_new( |
||||
_sub_abs(pos.row + 1, board->rows),
|
||||
_sub_abs(pos.column + 1, board->columns) |
||||
); |
||||
|
||||
Tile* tile = board_get_tile(board, inverted_pos); |
||||
if (!tile) { |
||||
return 0; |
||||
} |
||||
|
||||
// Place the piece
|
||||
tile->piece = piece; |
||||
|
||||
return 1; |
||||
} |
||||
|
||||
|
||||
// Checks if a tile of given position is occupied or not. Returns 1 if it is occupied, 0 - otherwise
|
||||
int board_is_tile_occupied(const Board* board, Position pos) { |
||||
if (!board) { |
||||
return 0; |
||||
} |
||||
|
||||
Tile* tile = board_get_tile(board, pos); |
||||
if (!tile) { |
||||
return 0; |
||||
} |
||||
|
||||
if (tile->piece.type == NONE) { |
||||
return 0; |
||||
} |
||||
|
||||
return 1; |
||||
} |
||||
|
||||
|
||||
/*
|
||||
Returns all possible legal positions either in diagonal or in straight lines |
||||
|
||||
If mode is 0 - returns positions in straight lines, 1 - in diagonals, 2 - in both
|
||||
*/ |
||||
Position* board_get_moves(const Board* board, const Tile* piece_tile, int mode, unsigned int* pos_count) { |
||||
if (!board || !piece_tile || !pos_count) { |
||||
return NULL; |
||||
} |
||||
|
||||
unsigned int i = 0; |
||||
Position* legal_moves = (Position*) malloc(sizeof(Position) * board->rows * board->columns); |
||||
if (!legal_moves) { |
||||
return NULL; |
||||
} |
||||
|
||||
switch (mode) { |
||||
case 0: { |
||||
for (unsigned int j = 0; j < 4; j++) { |
||||
int vx = CARDINALS[j].x; |
||||
int vy = CARDINALS[j].y; |
||||
|
||||
int xtmp = piece_tile->position.row + vx; |
||||
int ytmp = piece_tile->position.column + vy; |
||||
while (board_is_tile_in_bounds(board, position_new(xtmp, ytmp))) { |
||||
Tile* tile = board_get_tile(board, position_new(xtmp, ytmp)); |
||||
if (tile->piece.type == NONE) { |
||||
legal_moves[i] = tile->position; |
||||
i++; |
||||
} else if (tile->piece.color != piece_tile->piece.color) { |
||||
legal_moves[i] = tile->position; |
||||
i++; |
||||
break; // Don't proceed
|
||||
} else { |
||||
break; |
||||
} |
||||
|
||||
xtmp = xtmp + vx; |
||||
ytmp = ytmp + vy; |
||||
} |
||||
} |
||||
break; |
||||
} |
||||
|
||||
case 1: { |
||||
for (unsigned int j = 0; j < 4; j++) { |
||||
int vx = DIAGONALS[j].x; |
||||
int vy = DIAGONALS[j].y; |
||||
|
||||
int xtmp = piece_tile->position.row + vx; |
||||
int ytmp = piece_tile->position.column + vy; |
||||
while (board_is_tile_in_bounds(board, position_new(xtmp, ytmp))) { |
||||
Tile* tile = board_get_tile(board, position_new(xtmp, ytmp)); |
||||
if (tile->piece.type == NONE) { |
||||
legal_moves[i] = tile->position; |
||||
i++; |
||||
} else if (tile->piece.color != piece_tile->piece.color) { |
||||
legal_moves[i] = tile->position; |
||||
i++; |
||||
break; // Don't proceed
|
||||
} else { |
||||
break; |
||||
} |
||||
|
||||
xtmp = xtmp + vx; |
||||
ytmp = ytmp + vy; |
||||
} |
||||
} |
||||
break; |
||||
} |
||||
|
||||
case 2: { |
||||
for (unsigned int j = 0; j < 4; j++) { |
||||
int vx = CARDINALS[j].x; |
||||
int vy = CARDINALS[j].y; |
||||
|
||||
int xtmp = piece_tile->position.row + vx; |
||||
int ytmp = piece_tile->position.column + vy; |
||||
while (board_is_tile_in_bounds(board, position_new(xtmp, ytmp))) { |
||||
Tile* tile = board_get_tile(board, position_new(xtmp, ytmp)); |
||||
if (tile->piece.type == NONE) { |
||||
legal_moves[i] = tile->position; |
||||
i++; |
||||
} else if (tile->piece.color != piece_tile->piece.color) { |
||||
legal_moves[i] = tile->position; |
||||
i++; |
||||
break; // Don't proceed
|
||||
} else { |
||||
break; |
||||
} |
||||
|
||||
xtmp = xtmp + vx; |
||||
ytmp = ytmp + vy; |
||||
} |
||||
} |
||||
|
||||
for (unsigned int j = 0; j < 4; j++) { |
||||
int vx = DIAGONALS[j].x; |
||||
int vy = DIAGONALS[j].y; |
||||
|
||||
int xtmp = piece_tile->position.row + vx; |
||||
int ytmp = piece_tile->position.column + vy; |
||||
while (board_is_tile_in_bounds(board, position_new(xtmp, ytmp))) { |
||||
Tile* tile = board_get_tile(board, position_new(xtmp, ytmp)); |
||||
if (tile->piece.type == NONE) { |
||||
legal_moves[i] = tile->position; |
||||
i++; |
||||
} else if (tile->piece.color != piece_tile->piece.color) { |
||||
legal_moves[i] = tile->position; |
||||
i++; |
||||
break; // Don't proceed
|
||||
} else { |
||||
break; |
||||
} |
||||
|
||||
xtmp = xtmp + vx; |
||||
ytmp = ytmp + vy; |
||||
} |
||||
} |
||||
break; |
||||
} |
||||
|
||||
default: { |
||||
return NULL; |
||||
} |
||||
} |
||||
|
||||
legal_moves = realloc(legal_moves, sizeof(Position) * i); |
||||
*pos_count = i; |
||||
|
||||
return legal_moves; |
||||
} |
||||
|
||||
|
||||
// Returns all possible legal rook moves. Returns NULL if given tile does not contain a rook piece
|
||||
Position* board_get_rook_moves(const Board* board, const Tile* rook_tile, unsigned int* pos_count) { |
||||
if (!board || !rook_tile || !pos_count) { |
||||
return NULL; |
||||
} |
||||
|
||||
if (rook_tile->piece.type != ROOK) { |
||||
return NULL; |
||||
} |
||||
|
||||
|
||||
return board_get_moves(board, rook_tile, 0, pos_count); |
||||
} |
||||
|
||||
|
||||
/*
|
||||
Checks if a move is legal on this board. |
||||
|
||||
Returns 1 - if the move is legal, 0 - otherwise |
||||
*/ |
||||
int board_is_move_legal(const Board* board, Move move) { |
||||
// Check if the tiles are not out of bounds
|
||||
if (!board_is_tile_in_bounds(board, move.origin) ||
|
||||
!board_is_tile_in_bounds(board, move.target) |
||||
) { |
||||
|
||||
return 0; |
||||
} |
||||
|
||||
// Check if there is a piece at all
|
||||
if (board_get_tile(board, move.origin)->piece.type == NONE) { |
||||
return 0; |
||||
} |
||||
|
||||
Tile* origin_tile = board_get_tile(board, move.origin); |
||||
Tile* target_tile = board_get_tile(board, move.target); |
||||
|
||||
// Check based on the piece type
|
||||
Piece origin_piece = origin_tile->piece;
|
||||
switch (origin_piece.type) { |
||||
case KING: { |
||||
if (position_distance(move.origin, move.target) > 1) { |
||||
// Too far away
|
||||
return 0; |
||||
} |
||||
|
||||
// See if the target tile is occupied or not
|
||||
if (tile_is_occupied(*target_tile)) { |
||||
// The tile is occupied
|
||||
if (target_tile->piece.color == origin_piece.color) { |
||||
// The pieces are allied, can't go there
|
||||
return 0; |
||||
} |
||||
} |
||||
|
||||
return 1; |
||||
} |
||||
|
||||
case QUEEN: { |
||||
return 1; |
||||
} |
||||
|
||||
case ROOK: { |
||||
unsigned int pos_count = 0; |
||||
Position* legal_positions = board_get_rook_moves( |
||||
board,
|
||||
board_get_tile(board, move.origin), |
||||
&pos_count |
||||
); |
||||
|
||||
for (unsigned int i = 0; i < pos_count; i++) { |
||||
if (legal_positions[i].row == move.target.row && |
||||
legal_positions[i].column == move.target.column |
||||
)
|
||||
{ |
||||
// This position is allowed to be moved to
|
||||
free(legal_positions); |
||||
return 1; |
||||
} |
||||
} |
||||
|
||||
free(legal_positions); |
||||
return 0; |
||||
} |
||||
|
||||
case KNIGHT: { |
||||
return 1; |
||||
} |
||||
|
||||
case BISHOP: { |
||||
return 1; |
||||
} |
||||
|
||||
case PAWN: { |
||||
return 1; |
||||
} |
||||
|
||||
default: { |
||||
// Non reachable
|
||||
return 0; |
||||
} |
||||
} |
||||
} |
||||
|
||||
|
||||
/*
|
||||
Moves piece from one place to other,
|
||||
checking whether it is a legal move or not. |
||||
|
||||
Returns 1 if a move has been successfully done, |
||||
0 - if it is an illegal move |
||||
*/
|
||||
int board_process_move(Board* board, Move move) { |
||||
if (!board_is_move_legal(board, move)) { |
||||
return 0; |
||||
} |
||||
|
||||
// The tiles are legal, no need to re-check
|
||||
Tile* tile_origin = board_get_tile(board, move.origin); |
||||
Tile* tile_target = board_get_tile(board, move.target); |
||||
|
||||
// Move the piece from one tile to another
|
||||
tile_target->piece = tile_origin->piece; |
||||
tile_origin->piece.type = NONE; |
||||
|
||||
return 1; |
||||
} |
@ -0,0 +1,143 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#ifndef board_h |
||||
#define board_h |
||||
|
||||
#include "tile.h" |
||||
#include "move.h" |
||||
#include "position.h" |
||||
#include "piece.h" |
||||
#include <stdio.h> |
||||
|
||||
|
||||
typedef struct Vec2 { |
||||
int x; |
||||
int y; |
||||
} Vec2; |
||||
|
||||
|
||||
static const Vec2 CARDINALS[4] = { |
||||
{x: 1, y: 0}, {x: 0, y: 1}, |
||||
{x: -1, y: 0}, {x: 0, y: -1} |
||||
}; |
||||
|
||||
|
||||
static const Vec2 DIAGONALS[4] = { |
||||
{x: 1, y: 1}, {x: -1, y: 1}, |
||||
{x: 1, y: -1}, {x: -1, y: -1} |
||||
}; |
||||
|
||||
|
||||
static const Vec2 KNIGHTDELTAS[8] = { |
||||
{x: 1, y: 2}, {x: 2, y: 1}, |
||||
{x: -1, y: 2}, {x: -2, y: 1}, |
||||
{x: 1, y: -2}, {x: 2, y: -1}, |
||||
{x: -1, y: -2}, {x: -2, y: -1} |
||||
}; |
||||
|
||||
|
||||
typedef struct Board { |
||||
unsigned int rows; |
||||
unsigned int columns; |
||||
Tile* tiles; |
||||
} Board; |
||||
|
||||
|
||||
// Returns a newly allocated chess board with pieces placed
|
||||
Board* board_new_default(); |
||||
|
||||
|
||||
/*
|
||||
Returns a newly allocated chess board with custom amount of
|
||||
rows and columns, without pieces placed |
||||
*/
|
||||
Board* board_new_empty_custom(unsigned int rows, unsigned int columns); |
||||
|
||||
|
||||
// Frees up board and sets the pointer to it to NULL
|
||||
void board_delete(Board** board); |
||||
|
||||
|
||||
// Checks if given tile position is in bounds on this board. Returns 1 if it is, 0 - otherwise
|
||||
int board_is_tile_in_bounds(const Board* board, Position pos); |
||||
|
||||
|
||||
// Places a piece on a tile with provided position. Returns 1 if the piece has been placed, 0 if position is out of bounds
|
||||
int board_place_piece(Board* board, Position pos, Piece piece); |
||||
|
||||
|
||||
// Retrieves a tile on provided position. If available - returns a pointer to it, if not - returns NULL
|
||||
Tile* board_get_tile_raw(const Board* board, Position pos); |
||||
|
||||
|
||||
/*
|
||||
Retrieves a tile on provided position as if (0, 0) is the bottom left tile. If available
|
||||
- returns a pointer to it, if not - returns NULL. |
||||
*/
|
||||
Tile* board_get_tile(const Board* board, Position pos); |
||||
|
||||
|
||||
// Returns all tiles with pieces on them on the board
|
||||
Tile** board_get_occupied_tiles(const Board* board); |
||||
|
||||
|
||||
// Checks if a tile of given position is occupied or not. Returns 1 if it is occupied, 0 - otherwise
|
||||
int board_is_tile_occupied(const Board* board, Position pos); |
||||
|
||||
|
||||
|
||||
// Prints board to some FILE
|
||||
void board_print(const Board* board, FILE* out); |
||||
|
||||
|
||||
/*
|
||||
Returns all possible legal positions either in diagonal or in straight lines |
||||
|
||||
If mode is 0 - returns positions in straight lines, 1 - in diagonals, 2 - in both
|
||||
*/ |
||||
Position* board_get_moves(const Board* board, const Tile* piece_tile, int mode, unsigned int* pos_count); |
||||
|
||||
|
||||
// Returns all possible legal king positions. Returns NULL if given tile does not contain a king piece
|
||||
Position* board_get_king_moves(const Board* board, const Tile* king_tile, unsigned int* pos_count); |
||||
|
||||
|
||||
// Returns all possible legal king positions. Returns NULL if given tile does not contain a rook piece
|
||||
Position* board_get_rook_moves(const Board* board, const Tile* rook_tile, unsigned int* pos_count); |
||||
|
||||
|
||||
/*
|
||||
Checks if a move is legal on this board. |
||||
|
||||
Returns 1 - if the move is legal, 0 - otherwise |
||||
*/ |
||||
int board_is_move_legal(const Board* board, Move move); |
||||
|
||||
|
||||
/*
|
||||
Moves piece from one place to other,
|
||||
checking whether it is a legal move or not. |
||||
|
||||
Returns 1 if a move has been successfully done, |
||||
0 - if it is an illegal move |
||||
*/
|
||||
int board_process_move(Board* board, Move move); |
||||
|
||||
#endif |
@ -0,0 +1,157 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#include "chess.h" |
||||
#include "algebraic_notation.h" |
||||
#include <stdlib.h> |
||||
|
||||
|
||||
Chess* chess_new(Options options) { |
||||
if (!options.input || !options.output) { |
||||
return NULL; |
||||
} |
||||
|
||||
Chess* game = (Chess*) malloc(sizeof(Chess) * 1); |
||||
if (!game) { |
||||
return NULL; |
||||
} |
||||
|
||||
game->board = board_new_default(); |
||||
game->moves_made = 0; |
||||
game->turn = WHITE; |
||||
game->state = READY; |
||||
game->options = options; |
||||
|
||||
return game; |
||||
} |
||||
|
||||
|
||||
void chess_delete(Chess** chess) { |
||||
if (!chess) { |
||||
return; |
||||
} |
||||
|
||||
if (!*chess) { |
||||
return; |
||||
} |
||||
|
||||
|
||||
board_delete(&(*chess)->board); |
||||
free(*chess); |
||||
*chess = NULL; |
||||
|
||||
return; |
||||
} |
||||
|
||||
|
||||
void chess_display(const Chess* chess) { |
||||
char* color_string = color_to_string(chess->turn); |
||||
fprintf( |
||||
chess->options.output, |
||||
"[%s to move; %d moves made]\n\n", |
||||
color_string, |
||||
chess->moves_made
|
||||
); |
||||
free(color_string); |
||||
|
||||
board_print(chess->board, chess->options.output); |
||||
fprintf(chess->options.output, "\n"); |
||||
|
||||
return; |
||||
} |
||||
|
||||
|
||||
Move* chess_take_move_input(Chess* chess) { |
||||
if (!chess) { |
||||
return NULL; |
||||
} |
||||
|
||||
// Ask for input
|
||||
fprintf(chess->options.output, "Move: "); |
||||
char* input = (char*) malloc(sizeof(char) * 64); |
||||
input = fgets(input, 64, chess->options.input); |
||||
|
||||
// Try to parse input
|
||||
MoveNotation* move_notation = notation_move_from_string(input); |
||||
if (!move_notation) { |
||||
// Failed!
|
||||
return NULL; |
||||
} |
||||
|
||||
// Convert it to a useable move
|
||||
Move* move = (Move*) malloc(sizeof(Move) * 1); |
||||
if (!move) { |
||||
free(move_notation); |
||||
return NULL; |
||||
} |
||||
*move = notation_to_move(*move_notation); |
||||
free(move_notation); |
||||
|
||||
return move; |
||||
} |
||||
|
||||
|
||||
void chess_toggle_turn(Chess* chess) { |
||||
if (!chess) { |
||||
return; |
||||
} |
||||
|
||||
if (chess->turn == WHITE) { |
||||
chess->turn = BLACK; |
||||
} else { |
||||
chess->turn = WHITE; |
||||
} |
||||
|
||||
return; |
||||
} |
||||
|
||||
|
||||
void chess_next_turn(Chess* chess) { |
||||
if (!chess) { |
||||
return; |
||||
} |
||||
|
||||
// Keep asking for a legitimate move
|
||||
Move* move = NULL; |
||||
int result = 0; |
||||
while (1) { |
||||
// Get a move
|
||||
move = chess_take_move_input(chess); |
||||
if (!move) { |
||||
printf("Invalid move input!\n"); |
||||
continue; |
||||
} |
||||
|
||||
// Make a move
|
||||
result = board_process_move(chess->board, *move); |
||||
if (!result) { |
||||
printf("Illegal move!\n"); |
||||
free(move); |
||||
continue; |
||||
} |
||||
|
||||
break; |
||||
} |
||||
free(move); |
||||
|
||||
chess->moves_made++; |
||||
chess_toggle_turn(chess); |
||||
|
||||
return; |
||||
} |
@ -0,0 +1,72 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#ifndef chess_h |
||||
#define chess_h |
||||
|
||||
|
||||
#include <stdio.h> |
||||
#include "board.h" |
||||
|
||||
|
||||
typedef enum GameState { |
||||
READY, |
||||
RUNNING, |
||||
WHITEWON, |
||||
BLACKWON |
||||
} GameState; |
||||
|
||||
|
||||
typedef struct Options { |
||||
FILE* input; |
||||
FILE* output; |
||||
int use_ansi; |
||||
} Options; |
||||
|
||||
|
||||
typedef struct Chess { |
||||
Board* board; |
||||
Color turn; |
||||
unsigned int moves_made; |
||||
unsigned int timer_white_ms; |
||||
unsigned int timer_black_ms; |
||||
GameState state; |
||||
Options options; |
||||
} Chess; |
||||
|
||||
|
||||
Chess* chess_new(Options options); |
||||
|
||||
|
||||
void chess_display(const Chess* chess); |
||||
|
||||
|
||||
Move* chess_take_move_input(Chess* chess); |
||||
|
||||
|
||||
void chess_toggle_turn(Chess* chess); |
||||
|
||||
|
||||
void chess_next_turn(Chess* chess); |
||||
|
||||
|
||||
void chess_delete(Chess** chess); |
||||
|
||||
|
||||
#endif |
@ -0,0 +1,82 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#include <stdio.h> |
||||
#include <string.h> |
||||
#include <stddef.h> |
||||
#include "chess.h" |
||||
|
||||
|
||||
const char* VERSION = "0.1.0"; |
||||
|
||||
int main(int argc, const char** argv) { |
||||
int use_ansi = 0; |
||||
|
||||
unsigned int i = 0; |
||||
while (i < (unsigned int) argc) { |
||||
if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "--help") == 0) { |
||||
printf( |
||||
"chess -[h|v|na]\n\n\
|
||||
-h --help -> prints this help message\n\
|
||||
-v --version -> prints version information\n\
|
||||
-a --ansi -> use ANSI escape codes to output colors\n\
|
||||
" |
||||
); |
||||
return 0; |
||||
} |
||||
|
||||
if (strcmp(argv[i], "-v") == 0 || strcmp(argv[i], "--version") == 0) { |
||||
printf( |
||||
"c3hess v%s\n(C) 2023 Kasyanov Nikolay Alexeyevich (Unbewohnte)\n\n\
|
||||
This program is free software: you can redistribute it and/or modify\n\
|
||||
it under the terms of the GNU Affero General Public License as published by\n\
|
||||
the Free Software Foundation, either version 3 of the License, or\n\
|
||||
(at your option) any later version.\n\
|
||||
\n\
|
||||
This program is distributed in the hope that it will be useful,\n\
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of\n\
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\
|
||||
GNU Affero General Public License for more details.\n\
|
||||
\n\
|
||||
You should have received a copy of the GNU Affero General Public License\n\
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.\n", VERSION);
|
||||
return 0; |
||||
} |
||||
|
||||
if (strcmp(argv[i], "-na") == 0 || strcmp(argv[i], "--no-ansi") == 0) { |
||||
use_ansi = 1; |
||||
} |
||||
|
||||
i++; |
||||
}
|
||||
|
||||
Chess* game = chess_new((Options) { |
||||
input: stdin, |
||||
output: stdout, |
||||
use_ansi: use_ansi |
||||
}); |
||||
game->state = RUNNING; |
||||
while (game->state == RUNNING) { |
||||
chess_display(game); |
||||
chess_next_turn(game); |
||||
} |
||||
chess_delete(&game); |
||||
|
||||
return 0; |
||||
} |
@ -0,0 +1,29 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#include "move.h" |
||||
|
||||
|
||||
Move move_new(Position origin, Position target) { |
||||
Move move; |
||||
move.origin = origin; |
||||
move.target = target; |
||||
|
||||
return move; |
||||
} |
@ -0,0 +1,46 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#ifndef move_h |
||||
#define move_h |
||||
|
||||
#include "piece.h" |
||||
#include "position.h" |
||||
|
||||
|
||||
typedef enum MoveType { |
||||
MOVE = 1 << 0, |
||||
LONGCASTLE = 1 << 1, |
||||
SHORTCASTLE = 1 << 2, |
||||
CHECK = 1 << 3, |
||||
CHECKMATE = 1 << 4, |
||||
PROMOTION = 1 << 5, |
||||
CAPTURE = 1 << 6 |
||||
} MoveType; |
||||
|
||||
|
||||
typedef struct Move { |
||||
Position origin; |
||||
Position target; |
||||
} Move; |
||||
|
||||
|
||||
Move move_new(Position origin, Position target); |
||||
|
||||
#endif |
@ -0,0 +1,59 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#include "piece.h" |
||||
#include <stdlib.h> |
||||
#include <string.h> |
||||
|
||||
|
||||
// Color to a string representation
|
||||
char* color_to_string(Color color) { |
||||
char* color_string = (char*) malloc(sizeof(char) * 6); |
||||
if (!color_string) { |
||||
return NULL; |
||||
} |
||||
|
||||
switch (color) { |
||||
case WHITE: { |
||||
strcpy(color_string, "WHITE\0"); |
||||
break; |
||||
} |
||||
case BLACK: { |
||||
strcpy(color_string, "BLACK\0"); |
||||
break; |
||||
} |
||||
|
||||
default: { |
||||
free(color_string); |
||||
return NULL; |
||||
} |
||||
} |
||||
|
||||
return color_string; |
||||
} |
||||
|
||||
|
||||
// Creates a new piece
|
||||
Piece piece_new(Color color, PieceType type) { |
||||
Piece new_piece; |
||||
new_piece.color = color; |
||||
new_piece.type = type; |
||||
|
||||
return new_piece; |
||||
} |
@ -0,0 +1,57 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#ifndef piece_h |
||||
#define piece_h |
||||
|
||||
|
||||
// Color of a piece
|
||||
typedef enum Color { |
||||
WHITE, |
||||
BLACK |
||||
} Color; |
||||
|
||||
|
||||
// Color to a string representation
|
||||
char* color_to_string(Color color); |
||||
|
||||
|
||||
// Piece type enumeration
|
||||
typedef enum PieceType { |
||||
NONE, |
||||
KING, |
||||
QUEEN, |
||||
ROOK, |
||||
BISHOP, |
||||
KNIGHT, |
||||
PAWN |
||||
} PieceType; |
||||
|
||||
|
||||
typedef struct Piece { |
||||
Color color; |
||||
PieceType type; |
||||
} Piece; |
||||
|
||||
|
||||
// Creates a new piece
|
||||
Piece piece_new(Color color, PieceType type); |
||||
|
||||
|
||||
#endif |
@ -0,0 +1,138 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#include "position.h" |
||||
#include "util.h" |
||||
|
||||
|
||||
// Returns a copy of a new position
|
||||
Position position_new(unsigned int row, unsigned int column) { |
||||
Position new_pos; |
||||
new_pos.row = row; |
||||
new_pos.column = column; |
||||
|
||||
return new_pos; |
||||
} |
||||
|
||||
|
||||
// Returns 1 if position (which) is diagonal to the other (to_which) position, 0 - otherwise
|
||||
int position_is_diagonal_to(Position which, Position to_which) { |
||||
if (_sub_abs(which.column, to_which.column) == _sub_abs(which.row, to_which.row)) { |
||||
return 1; |
||||
} |
||||
|
||||
return 0; |
||||
} |
||||
|
||||
|
||||
// Returns 1 if position (which) is in a straight (not diagonal) line to the other one (to_which), returns 0 if not
|
||||
int position_is_straight_to(Position which, Position to_which) { |
||||
if (which.row == to_which.row || which.column == to_which.column) { |
||||
return 1; |
||||
} |
||||
|
||||
return 0; |
||||
} |
||||
|
||||
|
||||
// Returns a diagonal distance between two positions
|
||||
int position_diagonal_distance(Position which, Position to_which) { |
||||
return _sub_abs(which.column, to_which.column); |
||||
} |
||||
|
||||
|
||||
int _max(int x, int y) { |
||||
if (x > y) { |
||||
return x; |
||||
} |
||||
|
||||
return y; |
||||
} |
||||
|
||||
// Returns a distance between the two tile positions
|
||||
int position_distance(Position which, Position to_which) { |
||||
// 0 0 - 1 1 gives 1
|
||||
// 0 0 - 2 0 gives 2
|
||||
// 0 0 - 0 3 gives 3
|
||||
return _max(_sub_abs(which.row, to_which.row), _sub_abs(which.column, to_which.column)); |
||||
} |
||||
|
||||
|
||||
// Returns a position with the row incremented
|
||||
Position position_up(Position pos) { |
||||
return position_new(pos.row + 1, pos.column); |
||||
} |
||||
|
||||
// Returns a position with the row decremented
|
||||
Position position_down(Position pos) { |
||||
if (pos.row == 0) { |
||||
return pos; |
||||
} |
||||
|
||||
return position_new(pos.row - 1, pos.column); |
||||
} |
||||
|
||||
// Returns a position with the column decremented
|
||||
Position position_left(Position pos) { |
||||
if (pos.column == 0) { |
||||
return pos; |
||||
} |
||||
|
||||
return position_new(pos.row, pos.column - 1); |
||||
} |
||||
|
||||
// Returns a position with the column incremented
|
||||
Position position_right(Position pos) { |
||||
return position_new(pos.row, pos.column + 1); |
||||
} |
||||
|
||||
|
||||
// Returns a position with the row incremented and column incremented
|
||||
Position position_up_right(Position pos) { |
||||
return position_new(pos.row + 1, pos.column + 1); |
||||
} |
||||
|
||||
|
||||
// Returns a position with the row incremented and column decremented
|
||||
Position position_up_left(Position pos) { |
||||
if (pos.column == 0) { |
||||
return pos; |
||||
} |
||||
|
||||
return position_new(pos.row + 1, pos.column - 1); |
||||
} |
||||
|
||||
// Returns a position with the row decremented and column incremented
|
||||
Position position_down_right(Position pos) { |
||||
if (pos.row == 0) { |
||||
return pos; |
||||
} |
||||
|
||||
return position_new(pos.row - 1, pos.column + 1); |
||||
} |
||||
|
||||
|
||||
// Returns a position with the row decremented and column decremented
|
||||
Position position_down_left(Position pos) { |
||||
if (pos.row == 0 || pos.column == 0) { |
||||
return pos; |
||||
} |
||||
|
||||
return position_new(pos.row - 1, pos.column - 1); |
||||
} |
@ -0,0 +1,79 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#ifndef position_h |
||||
#define position_h |
||||
|
||||
typedef struct Position { |
||||
unsigned int row; |
||||
unsigned int column; |
||||
} Position; |
||||
|
||||
|
||||
// Returns a copy of a new position
|
||||
Position position_new(unsigned int row, unsigned int column); |
||||
|
||||
|
||||
// Returns 1 if position (which) is diagonal to the other (to_which) position, 0 - otherwise
|
||||
int position_is_diagonal_to(Position which, Position to_which); |
||||
|
||||
|
||||
// Returns 1 if position (which) is in a straight (not diagonal) line to the other one (to_which), returns 0 if not
|
||||
int position_is_straight_to(Position which, Position to_which); |
||||
|
||||
|
||||
// Returns a diagonal distance between two positions
|
||||
int position_diagonal_distance(Position which, Position to_which); |
||||
|
||||
|
||||
// Returns a distance between the two tile positions
|
||||
int position_distance(Position which, Position to_which); |
||||
|
||||
|
||||
// Returns a position with the row incremented
|
||||
Position position_up(Position pos); |
||||
|
||||
|
||||
// Returns a position with the row decremented
|
||||
Position position_down(Position pos); |
||||
|
||||
|
||||
// Returns a position with the column decremented
|
||||
Position position_left(Position pos); |
||||
|
||||
|
||||
// Returns a position with the column incremented
|
||||
Position position_right(Position pos); |
||||
|
||||
|
||||
// Returns a position with the row incremented and column incremented
|
||||
Position position_up_right(Position pos); |
||||
|
||||
|
||||
// Returns a position with the row incremented and column decremented
|
||||
Position position_up_left(Position pos); |
||||
|
||||
// Returns a position with the row decremented and column incremented
|
||||
Position position_down_right(Position pos); |
||||
|
||||
|
||||
// Returns a position with the row decremented and column decremented
|
||||
Position position_down_left(Position pos); |
||||
|
||||
#endif |
@ -0,0 +1,50 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#include "tile.h" |
||||
#include <stddef.h> |
||||
|
||||
// Creates a copy of a new tile
|
||||
Tile tile_new(Position position, Piece piece) { |
||||
Tile tile; |
||||
tile.position = position; |
||||
tile.piece = piece; |
||||
|
||||
return tile; |
||||
} |
||||
|
||||
|
||||
// Creates a copy of an empty tile
|
||||
Tile tile_new_empty(Position position) { |
||||
Tile tile; |
||||
tile.position = position; |
||||
tile.piece.type = NONE; |
||||
|
||||
return tile; |
||||
} |
||||
|
||||
|
||||
// Returns 1 if the tile is occupied and 0 if it is not
|
||||
int tile_is_occupied(Tile tile) { |
||||
if (tile.piece.type == NONE) { |
||||
return 0; |
||||
} |
||||
|
||||
return 1; |
||||
} |
@ -0,0 +1,46 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#ifndef tile_h |
||||
#define tile_h |
||||
|
||||
#include "piece.h" |
||||
#include "position.h" |
||||
|
||||
typedef struct Tile { |
||||
Position position; |
||||
Piece piece; |
||||
} Tile; |
||||
|
||||
|
||||
// Creates a copy of a new tile
|
||||
Tile tile_new(Position position, Piece piece); |
||||
|
||||
|
||||
// Creates a copy of an empty tile
|
||||
Tile tile_new_empty(Position position); |
||||
|
||||
|
||||
// Returns 1 if the tile is occupied and 0 if it is not
|
||||
int tile_is_occupied(Tile tile); |
||||
|
||||
|
||||
|
||||
|
||||
#endif |
@ -0,0 +1,30 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#include "util.h" |
||||
|
||||
|
||||
// Subtracts smaller value from bigger value
|
||||
unsigned int _sub_abs(unsigned int x, unsigned int y) { |
||||
if (x > y) { |
||||
return x - y; |
||||
} |
||||
|
||||
return y - x; |
||||
} |
@ -0,0 +1,27 @@
|
||||
/*
|
||||
c3hess - Console Chess written in C |
||||
Copyright (C) 2023 Kasyanov Nikolay Alexeyevich |
||||
|
||||
This program is free software: you can redistribute it and/or modify |
||||
it under the terms of the GNU Affero General Public License as published by |
||||
the Free Software Foundation, either version 3 of the License, or |
||||
(at your option) any later version. |
||||
|
||||
This program is distributed in the hope that it will be useful, |
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
GNU Affero General Public License for more details. |
||||
|
||||
You should have received a copy of the GNU Affero General Public License |
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/ |
||||
|
||||
|
||||
#ifndef util_h |
||||
#define util_h |
||||
|
||||
// Subtracts smaller value from bigger value
|
||||
unsigned int _sub_abs(unsigned int x, unsigned int y); |
||||
|
||||
|
||||
#endif |
Loading…
Reference in new issue