Foxarc/maze_generator
SHA256
1
0
Fork 0
Code Issues Pull Requests Projects Releases 1 Wiki Activity

Import Godot project into Git.

Browse Source
This commit is contained in:
Foxarc 2024-07-14 09:29:13 +02:00
parent 098ab1d238
commit 11777a48d2
Signed by: Foxarc
GPG Key ID: A531D34DB1580884
18 changed files with 2461 additions and 235 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
.gitignore vendored Normal file
View File

@ -0,0 +1,2 @@
.godot/
export/

16
2D.profile Normal file
View File

@ -0,0 +1,16 @@
{
"disabled_classes": [
"NavigationAgent3D",
"Node3D",
"Shape3D",
"SkeletonIK3D",
"World3D"
],
"disabled_editors": [],
"disabled_features": [
"3d",
"asset_lib"
],
"disabled_properties": [],
"type": "feature_profile"
}

235
LICENSE
View File

@ -1,235 +0,0 @@
GNU AFFERO GENERAL PUBLIC LICENSE
Version 3, 19 November 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed.
Preamble
The GNU 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.
maze_generator
Copyright (C) 2024 Foxarc
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 <http://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 <http://www.gnu.org/licenses/>.

661
LICENSE.txt Normal file
View File

@ -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/>.

245
export_presets.cfg Normal file
View File

@ -0,0 +1,245 @@
[preset.0]
name="Windows Desktop"
platform="Windows Desktop"
runnable=true
dedicated_server=false
custom_features=""
export_filter="all_resources"
include_filter=""
exclude_filter=""
export_path="export/maze_generator.exe"
encryption_include_filters=""
encryption_exclude_filters=""
encrypt_pck=false
encrypt_directory=false
[preset.0.options]
custom_template/debug=""
custom_template/release=""
debug/export_console_wrapper=0
binary_format/embed_pck=true
texture_format/bptc=false
texture_format/s3tc=false
texture_format/etc=false
texture_format/etc2=false
binary_format/architecture="x86_64"
codesign/enable=false
codesign/timestamp=true
codesign/timestamp_server_url=""
codesign/digest_algorithm=1
codesign/description=""
codesign/custom_options=PackedStringArray()
application/modify_resources=false
application/icon=""
application/console_wrapper_icon=""
application/icon_interpolation=4
application/file_version=""
application/product_version=""
application/company_name=""
application/product_name=""
application/file_description=""
application/copyright=""
application/trademarks=""
application/export_angle=1
ssh_remote_deploy/enabled=false
ssh_remote_deploy/host="user@host_ip"
ssh_remote_deploy/port="22"
ssh_remote_deploy/extra_args_ssh=""
ssh_remote_deploy/extra_args_scp=""
ssh_remote_deploy/run_script="Expand-Archive -LiteralPath '{temp_dir}\\{archive_name}' -DestinationPath '{temp_dir}'
$action = New-ScheduledTaskAction -Execute '{temp_dir}\\{exe_name}' -Argument '{cmd_args}'
$trigger = New-ScheduledTaskTrigger -Once -At 00:00
$settings = New-ScheduledTaskSettingsSet
$task = New-ScheduledTask -Action $action -Trigger $trigger -Settings $settings
Register-ScheduledTask godot_remote_debug -InputObject $task -Force:$true
Start-ScheduledTask -TaskName godot_remote_debug
while (Get-ScheduledTask -TaskName godot_remote_debug | ? State -eq running) { Start-Sleep -Milliseconds 100 }
Unregister-ScheduledTask -TaskName godot_remote_debug -Confirm:$false -ErrorAction:SilentlyContinue"
ssh_remote_deploy/cleanup_script="Stop-ScheduledTask -TaskName godot_remote_debug -ErrorAction:SilentlyContinue
Unregister-ScheduledTask -TaskName godot_remote_debug -Confirm:$false -ErrorAction:SilentlyContinue
Remove-Item -Recurse -Force '{temp_dir}'"
[preset.1]
name="macOS"
platform="macOS"
runnable=true
dedicated_server=false
custom_features=""
export_filter="all_resources"
include_filter=""
exclude_filter=""
export_path="export/maze_generator.zip"
encryption_include_filters=""
encryption_exclude_filters=""
encrypt_pck=false
encrypt_directory=false
[preset.1.options]
export/distribution_type=1
binary_format/architecture="universal"
custom_template/debug=""
custom_template/release=""
debug/export_console_wrapper=0
application/icon=""
application/icon_interpolation=4
application/bundle_identifier="website.foxarc.maze.generator"
application/signature=""
application/app_category="Games"
application/short_version=""
application/version=""
application/copyright="Foxarc"
application/copyright_localized={}
application/min_macos_version="10.12"
application/export_angle=1
display/high_res=false
xcode/platform_build="14C18"
xcode/sdk_version="13.1"
xcode/sdk_build="22C55"
xcode/sdk_name="macosx13.1"
xcode/xcode_version="1420"
xcode/xcode_build="14C18"
codesign/codesign=1
codesign/installer_identity=""
codesign/apple_team_id=""
codesign/identity=""
codesign/entitlements/custom_file=""
codesign/entitlements/allow_jit_code_execution=false
codesign/entitlements/allow_unsigned_executable_memory=false
codesign/entitlements/allow_dyld_environment_variables=false
codesign/entitlements/disable_library_validation=false
codesign/entitlements/audio_input=false
codesign/entitlements/camera=false
codesign/entitlements/location=false
codesign/entitlements/address_book=false
codesign/entitlements/calendars=false
codesign/entitlements/photos_library=false
codesign/entitlements/apple_events=false
codesign/entitlements/debugging=false
codesign/entitlements/app_sandbox/enabled=false
codesign/entitlements/app_sandbox/network_server=false
codesign/entitlements/app_sandbox/network_client=false
codesign/entitlements/app_sandbox/device_usb=false
codesign/entitlements/app_sandbox/device_bluetooth=false
codesign/entitlements/app_sandbox/files_downloads=0
codesign/entitlements/app_sandbox/files_pictures=0
codesign/entitlements/app_sandbox/files_music=0
codesign/entitlements/app_sandbox/files_movies=0
codesign/entitlements/app_sandbox/files_user_selected=0
codesign/entitlements/app_sandbox/helper_executables=[]
codesign/custom_options=PackedStringArray()
notarization/notarization=0
privacy/microphone_usage_description=""
privacy/microphone_usage_description_localized={}
privacy/camera_usage_description=""
privacy/camera_usage_description_localized={}
privacy/location_usage_description=""
privacy/location_usage_description_localized={}
privacy/address_book_usage_description=""
privacy/address_book_usage_description_localized={}
privacy/calendar_usage_description=""
privacy/calendar_usage_description_localized={}
privacy/photos_library_usage_description=""
privacy/photos_library_usage_description_localized={}
privacy/desktop_folder_usage_description=""
privacy/desktop_folder_usage_description_localized={}
privacy/documents_folder_usage_description=""
privacy/documents_folder_usage_description_localized={}
privacy/downloads_folder_usage_description=""
privacy/downloads_folder_usage_description_localized={}
privacy/network_volumes_usage_description=""
privacy/network_volumes_usage_description_localized={}
privacy/removable_volumes_usage_description=""
privacy/removable_volumes_usage_description_localized={}
ssh_remote_deploy/enabled=false
ssh_remote_deploy/host="user@host_ip"
ssh_remote_deploy/port="22"
ssh_remote_deploy/extra_args_ssh=""
ssh_remote_deploy/extra_args_scp=""
ssh_remote_deploy/run_script="#!/usr/bin/env bash
unzip -o -q \"{temp_dir}/{archive_name}\" -d \"{temp_dir}\"
open \"{temp_dir}/{exe_name}.app\" --args {cmd_args}"
ssh_remote_deploy/cleanup_script="#!/usr/bin/env bash
kill $(pgrep -x -f \"{temp_dir}/{exe_name}.app/Contents/MacOS/{exe_name} {cmd_args}\")
rm -rf \"{temp_dir}\""
[preset.2]
name="Linux/X11"
platform="Linux/X11"
runnable=true
dedicated_server=false
custom_features=""
export_filter="all_resources"
include_filter=""
exclude_filter=""
export_path="export/maze_generator.x86_64"
encryption_include_filters=""
encryption_exclude_filters=""
encrypt_pck=false
encrypt_directory=false
[preset.2.options]
custom_template/debug=""
custom_template/release=""
debug/export_console_wrapper=0
binary_format/embed_pck=true
texture_format/bptc=false
texture_format/s3tc=false
texture_format/etc=false
texture_format/etc2=false
binary_format/architecture="x86_64"
ssh_remote_deploy/enabled=false
ssh_remote_deploy/host="user@host_ip"
ssh_remote_deploy/port="22"
ssh_remote_deploy/extra_args_ssh=""
ssh_remote_deploy/extra_args_scp=""
ssh_remote_deploy/run_script="#!/usr/bin/env bash
export DISPLAY=:0
unzip -o -q \"{temp_dir}/{archive_name}\" -d \"{temp_dir}\"
\"{temp_dir}/{exe_name}\" {cmd_args}"
ssh_remote_deploy/cleanup_script="#!/usr/bin/env bash
kill $(pgrep -x -f \"{temp_dir}/{exe_name} {cmd_args}\")
rm -rf \"{temp_dir}\""
[preset.3]
name="Web"
platform="Web"
runnable=true
dedicated_server=false
custom_features=""
export_filter="all_resources"
include_filter=""
exclude_filter=""
export_path="export/html/maze_generator.html"
encryption_include_filters=""
encryption_exclude_filters=""
encrypt_pck=false
encrypt_directory=false
[preset.3.options]
custom_template/debug=""
custom_template/release=""
variant/extensions_support=false
vram_texture_compression/for_desktop=false
vram_texture_compression/for_mobile=false
html/export_icon=true
html/custom_html_shell=""
html/head_include=""
html/canvas_resize_policy=1
html/focus_canvas_on_start=true
html/experimental_virtual_keyboard=false
progressive_web_app/enabled=false
progressive_web_app/offline_page=""
progressive_web_app/display=1
progressive_web_app/orientation=0
progressive_web_app/icon_144x144=""
progressive_web_app/icon_180x180=""
progressive_web_app/icon_512x512=""
progressive_web_app/background_color=Color(0, 0, 0, 1)

1
icon.svg Normal file
View File

@ -0,0 +1 @@
<svg height="128" width="128" xmlns="http://www.w3.org/2000/svg"><rect x="2" y="2" width="124" height="124" rx="14" fill="#363d52" stroke="#212532" stroke-width="4"/><g transform="scale(.101) translate(122 122)"><g fill="#fff"><path d="M105 673v33q407 354 814 0v-33z"/><path d="m105 673 152 14q12 1 15 14l4 67 132 10 8-61q2-11 15-15h162q13 4 15 15l8 61 132-10 4-67q3-13 15-14l152-14V427q30-39 56-81-35-59-83-108-43 20-82 47-40-37-88-64 7-51 8-102-59-28-123-42-26 43-46 89-49-7-98 0-20-46-46-89-64 14-123 42 1 51 8 102-48 27-88 64-39-27-82-47-48 49-83 108 26 42 56 81zm0 33v39c0 276 813 276 814 0v-39l-134 12-5 69q-2 10-14 13l-162 11q-12 0-16-11l-10-65H446l-10 65q-4 11-16 11l-162-11q-12-3-14-13l-5-69z" fill="#478cbf"/><path d="M483 600c0 34 58 34 58 0v-86c0-34-58-34-58 0z"/><circle cx="725" cy="526" r="90"/><circle cx="299" cy="526" r="90"/></g><g fill="#414042"><circle cx="307" cy="532" r="60"/><circle cx="717" cy="532" r="60"/></g></g></svg>
Side by Side

After

Width:  |  Height:  |  Size: 949 B

37
icon.svg.import Normal file
View File

@ -0,0 +1,37 @@
[remap]
importer="texture"
type="CompressedTexture2D"
uid="uid://b531ilql76nr6"
path="res://.godot/imported/icon.svg-218a8f2b3041327d8a5756f3a245f83b.ctex"
metadata={
"vram_texture": false
}
[deps]
source_file="res://icon.svg"
dest_files=["res://.godot/imported/icon.svg-218a8f2b3041327d8a5756f3a245f83b.ctex"]
[params]
compress/mode=0
compress/high_quality=false
compress/lossy_quality=0.7
compress/hdr_compression=1
compress/normal_map=0
compress/channel_pack=0
mipmaps/generate=false
mipmaps/limit=-1
roughness/mode=0
roughness/src_normal=""
process/fix_alpha_border=true
process/premult_alpha=false
process/normal_map_invert_y=false
process/hdr_as_srgb=false
process/hdr_clamp_exposure=false
process/size_limit=0
detect_3d/compress_to=1
svg/scale=1.0
editor/scale_with_editor_scale=false
editor/convert_colors_with_editor_theme=false

28
languages.csv Normal file
View File

@ -0,0 +1,28 @@
keys,en,fr,es,de,pl
PROJECT_TITLE,"[b][font_size=30]Maze generator[/font_size][/b]\n[font_size=20]by Foxarc, version 1[/font_size]","[b][font_size=18]Générateur de labyrinthe[/font_size][/b]\n[font_size=20]par Foxarc, version 1[/font_size]","[b][font_size=20]Generador de laberinto[/font_size][/b]\n[font_size=20]de Foxarc, versión 1[/font_size]","[b][font_size=23]Labyrinth-Generator[/font_size][/b]\n[font_size=20]von Foxarc, Version 1[/font_size]","[b][font_size=25]Generator labirynt[/font_size][/b]\n[font_size=20]od Foxarc, wersja 1[/font_size]"
SURFACE_SIZE,"Surface size","[font_size=10]Taille de la surface[/font_size]","[font_size=8]Tamaño de la superficie[/font_size]","[font_size=14]Flächengröße[/font_size]","[font_size=9]Rozmiar powierzchni[/font_size]"
CASE_SIZE,"Case size","[font_size=12]Taille de la case[/font_size]","[font_size=9]Tamaño de la casilla[/font_size]","[font_size=12]Kästchengröße[/font_size]","[font_size=11]Rozmiar komórki[/font_size]"
FREE,"[font_size=10][color=yellow]Free[/color][/font_size]","[font_size=10][color=yellow]Libre[/color][/font_size]","[font_size=10][color=yellow]Libre[/color][/font_size]","[font_size=10][color=yellow]Frei[/color][/font_size]","[font_size=10][color=yellow]Wolny[/color][/font_size]"
CLOSED_WALL,"[font_size=10][color=yellow]Closed wall[/color][/font_size]","[font_size=10][color=yellow]Mur fermé[/color][/font_size]","[font_size=9][color=yellow]Muro cerrado[/color][/font_size]","[font_size=10][color=yellow]Geschlossen[/color][/font_size]","[font_size=10][color=yellow]Zamknięty[/color][/font_size]"
VISITED,"[font_size=10][color=yellow]Visited[/color][/font_size]","[font_size=10][color=yellow]Visitée[/color][/font_size]","[font_size=10][color=yellow]Visitada[/color][/font_size]","[font_size=10][color=yellow]Besucht[/color][/font_size]","[font_size=8][color=yellow]Odwiedziła[/color][/font_size]"
AVAILABLE,"[font_size=10][color=yellow]Available[/color][/font_size]","[font_size=10][color=yellow]Disponible[/color][/font_size]","[font_size=10][color=yellow]Disponible[/color][/font_size]","[font_size=10][color=yellow]Verfügbar[/color][/font_size]","[font_size=10][color=yellow]Dostępny[/color][/font_size]"
WALL,"[font_size=10][color=yellow]Wall[/color][/font_size]","[font_size=10][color=yellow]Mur[/color][/font_size]","[font_size=10][color=yellow]Muro[/color][/font_size]","[font_size=10][color=yellow]Wand[/color][/font_size]","[font_size=10][color=yellow]Ściana[/color][/font_size]"
INTERSECTION,"[font_size=10][color=yellow]3-way intersection[/color][/font_size]","[font_size=10][color=yellow]Intersection à 3 voies[/color][/font_size]","[font_size=10][color=yellow]Intersección de 3 vías[/color][/font_size]","[font_size=10][color=yellow]3-Wege-Kreuzung[/color][/font_size]","[font_size=10][color=yellow]3-drożny skrzyżowanie[/color][/font_size]"
WARNING,"Available only when recording is enabled.","Indisponibles si pas d'animation.","Indisponibles si no animación.","Erst verfügbar wenn Aufnahme.","Dostępne tylko kiedy nagranie."
DEMO,"[center][color=yellow]Demo limitations[/color][/center]","[center][color=yellow]Limites de la démo[/color][/center]","[center][color=yellow]Limitaciones de la demo[/color][/center]","[center][color=yellow]Grenzwerten der Demo[/color][/center]","[center][color=yellow]Demo ograniczenia[/color][/center]"
DEMO_CASE,"[center]1 ≤ Case size ≤ 9[/center]","[center]1 ≤ Taille de la case ≤ 9[/center]","[center][font_size=14]1 ≤ Tamaño de la casilla ≤ 9[/font_size][/center]","[center]1 ≤ Kästchengröße ≤ 9[/center]","[center]1 ≤ Rozmiar komórki ≤ 9[/center]"
GENERATE,"GENERATE!","GÉNÉRER !","¡GENERAR!","Generat!","Wytworzyć!"
CASE_FREE,"Free","Libre","Libre","Frei","Wolny"
CASE_CLOSED,"Closed wall","Mur fermé","Muro cerrado","Geschlossen Wand","Zamknięty ściana"
CASE_VISITED,"Visited","Visitée","Visitada","Besucht","Odwiedziła"
CASE_AVAILABLE,"Available","Disponible","Disponible","Verfügbar","Dostępny"
CASE_WALL,"Wall","Mur","Muro","Wand","Ściana"
CASE_INTERSECTION,"3-way intersection","Intersection à 3 voies","Intersección de 3 vías","3-Wege-Kreuzung","3-drożny skrzyżowanie"
CANCEL,"Cancel","Annuler","Anular","Absagen","Anulować"
RECORD,"Record maze animation","Enregistrer l’animation","Guardar la animación","Aufzeichnung die Anime","Nagrywać animacja"
LANGUAGE,"Press L on the keyboard to switch to another language.","Appuyer sur L sur le clavier pour basculer vers un autre langage.","Pulsar L en el teclado para cambiar a otro idioma.","Drücken Sie die Taste L auf der Tastatur auf eine andere Sprache wechseln.","Wcisnąć L na klawiaturze abym przeniosła się na inny język."
PROGRESS,"case(s) remaining","case(s) restante(s)","casilla(s) restante(s)","Kästchen verbleibenden","pozostałe komórk(a/i)"
EXPORT,"[center]Export as:[/center]","[center]Exporter vers :[/center]","[center]Exportar a:[/center]","[center]Export als:[/center]","[center]Eksport do:[/center]"
EXPORT_CSV,"CSV (maze layout)","CSV (plan)","CSV (plano)","CSV (Grundriss)","CSV (układ)"
EXPORT_JS,"JS (animation)","JS (animation)","JS (animación)","JS (Animation)","JS (animacja)"
NO_JS,"JS (unavailable)","JS (indisponible)","JS (indisponible)","JS (unerreichbar)","JS (niedostępny)"
1 keys en fr es de pl
2 PROJECT_TITLE [b][font_size=30]Maze generator[/font_size][/b]\n[font_size=20]by Foxarc, version 1[/font_size] [b][font_size=18]Générateur de labyrinthe[/font_size][/b]\n[font_size=20]par Foxarc, version 1[/font_size] [b][font_size=20]Generador de laberinto[/font_size][/b]\n[font_size=20]de Foxarc, versión 1[/font_size] [b][font_size=23]Labyrinth-Generator[/font_size][/b]\n[font_size=20]von Foxarc, Version 1[/font_size] [b][font_size=25]Generator labirynt[/font_size][/b]\n[font_size=20]od Foxarc, wersja 1[/font_size]
3 SURFACE_SIZE Surface size [font_size=10]Taille de la surface[/font_size] [font_size=8]Tamaño de la superficie[/font_size] [font_size=14]Flächengröße[/font_size] [font_size=9]Rozmiar powierzchni[/font_size]
4 CASE_SIZE Case size [font_size=12]Taille de la case[/font_size] [font_size=9]Tamaño de la casilla[/font_size] [font_size=12]Kästchengröße[/font_size] [font_size=11]Rozmiar komórki[/font_size]
5 FREE [font_size=10][color=yellow]Free[/color][/font_size] [font_size=10][color=yellow]Libre[/color][/font_size] [font_size=10][color=yellow]Libre[/color][/font_size] [font_size=10][color=yellow]Frei[/color][/font_size] [font_size=10][color=yellow]Wolny[/color][/font_size]
6 CLOSED_WALL [font_size=10][color=yellow]Closed wall[/color][/font_size] [font_size=10][color=yellow]Mur fermé[/color][/font_size] [font_size=9][color=yellow]Muro cerrado[/color][/font_size] [font_size=10][color=yellow]Geschlossen[/color][/font_size] [font_size=10][color=yellow]Zamknięty[/color][/font_size]
7 VISITED [font_size=10][color=yellow]Visited[/color][/font_size] [font_size=10][color=yellow]Visitée[/color][/font_size] [font_size=10][color=yellow]Visitada[/color][/font_size] [font_size=10][color=yellow]Besucht[/color][/font_size] [font_size=8][color=yellow]Odwiedziła[/color][/font_size]
8 AVAILABLE [font_size=10][color=yellow]Available[/color][/font_size] [font_size=10][color=yellow]Disponible[/color][/font_size] [font_size=10][color=yellow]Disponible[/color][/font_size] [font_size=10][color=yellow]Verfügbar[/color][/font_size] [font_size=10][color=yellow]Dostępny[/color][/font_size]
9 WALL [font_size=10][color=yellow]Wall[/color][/font_size] [font_size=10][color=yellow]Mur[/color][/font_size] [font_size=10][color=yellow]Muro[/color][/font_size] [font_size=10][color=yellow]Wand[/color][/font_size] [font_size=10][color=yellow]Ściana[/color][/font_size]
10 INTERSECTION [font_size=10][color=yellow]3-way intersection[/color][/font_size] [font_size=10][color=yellow]Intersection à 3 voies[/color][/font_size] [font_size=10][color=yellow]Intersección de 3 vías[/color][/font_size] [font_size=10][color=yellow]3-Wege-Kreuzung[/color][/font_size] [font_size=10][color=yellow]3-drożny skrzyżowanie[/color][/font_size]
11 WARNING Available only when recording is enabled. Indisponibles si pas d'animation. Indisponibles si no animación. Erst verfügbar wenn Aufnahme. Dostępne tylko kiedy nagranie.
12 DEMO [center][color=yellow]Demo limitations[/color][/center] [center][color=yellow]Limites de la démo[/color][/center] [center][color=yellow]Limitaciones de la demo[/color][/center] [center][color=yellow]Grenzwerten der Demo[/color][/center] [center][color=yellow]Demo ograniczenia[/color][/center]
13 DEMO_CASE [center]1 ≤ Case size ≤ 9[/center] [center]1 ≤ Taille de la case ≤ 9[/center] [center][font_size=14]1 ≤ Tamaño de la casilla ≤ 9[/font_size][/center] [center]1 ≤ Kästchengröße ≤ 9[/center] [center]1 ≤ Rozmiar komórki ≤ 9[/center]
14 GENERATE GENERATE! GÉNÉRER ! ¡GENERAR! Generat! Wytworzyć!
15 CASE_FREE Free Libre Libre Frei Wolny
16 CASE_CLOSED Closed wall Mur fermé Muro cerrado Geschlossen Wand Zamknięty ściana
17 CASE_VISITED Visited Visitée Visitada Besucht Odwiedziła
18 CASE_AVAILABLE Available Disponible Disponible Verfügbar Dostępny
19 CASE_WALL Wall Mur Muro Wand Ściana
20 CASE_INTERSECTION 3-way intersection Intersection à 3 voies Intersección de 3 vías 3-Wege-Kreuzung 3-drożny skrzyżowanie
21 CANCEL Cancel Annuler Anular Absagen Anulować
22 RECORD Record maze animation Enregistrer l’animation Guardar la animación Aufzeichnung die Anime Nagrywać animacja
23 LANGUAGE Press L on the keyboard to switch to another language. Appuyer sur L sur le clavier pour basculer vers un autre langage. Pulsar L en el teclado para cambiar a otro idioma. Drücken Sie die Taste L auf der Tastatur auf eine andere Sprache wechseln. Wcisnąć L na klawiaturze abym przeniosła się na inny język.
24 PROGRESS case(s) remaining case(s) restante(s) casilla(s) restante(s) Kästchen verbleibenden pozostałe komórk(a/i)
25 EXPORT [center]Export as:[/center] [center]Exporter vers :[/center] [center]Exportar a:[/center] [center]Export als:[/center] [center]Eksport do:[/center]
26 EXPORT_CSV CSV (maze layout) CSV (plan) CSV (plano) CSV (Grundriss) CSV (układ)
27 EXPORT_JS JS (animation) JS (animation) JS (animación) JS (Animation) JS (animacja)
28 NO_JS JS (unavailable) JS (indisponible) JS (indisponible) JS (unerreichbar) JS (niedostępny)

17
languages.csv.import Normal file
View File

@ -0,0 +1,17 @@
[remap]
importer="csv_translation"
type="Translation"
uid="uid://ialoju8o0ela"
[deps]
files=["res://languages.en.translation", "res://languages.fr.translation", "res://languages.es.translation", "res://languages.de.translation", "res://languages.pl.translation"]
source_file="res://languages.csv"
dest_files=["res://languages.en.translation", "res://languages.fr.translation", "res://languages.es.translation", "res://languages.de.translation", "res://languages.pl.translation"]
[params]
compress=false
delimiter=0

BIN
languages.de.translation Normal file
View File

Binary file not shown.

BIN
languages.en.translation Normal file
View File

Binary file not shown.

BIN
languages.es.translation Normal file
View File

Binary file not shown.

BIN
languages.fr.translation Normal file
View File

Binary file not shown.

BIN
languages.pl.translation Normal file
View File

Binary file not shown.

828
maze.gd Normal file
View File

@ -0,0 +1,828 @@
# Maze generator, version 1
# Copyright (C) 2024 Foxarc
#
# 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/>.
extends Node
var language = TranslationServer.get_loaded_locales().find(TranslationServer.get_locale().left(-3))
# For every case size, / 1 2 3 4 5 6 7 8 9
var max_cases = [0, [57,27], [28,13], [19,9], [14,6], [11,5], [9,4], [8,3], [7,3], [6,3]]
var offset = [0, [0,0], [10,10], [0,0], [10,30], [20,20], [30,30], [10,60], [10,30], [30,0]]
var render_cells = []
var time_spent = 0
var generating = false
var JS_animation = []
func clear_cells():
for i in range(render_cells.size()):
for j in range(render_cells[i].size()):
render_cells[i][j].queue_free()
render_cells.clear()
func rerender_cells(new_x,new_y):
if $"Export".visible:
$"Export".visible = false
clear_cells()
$"Progress".visible = false
var border = StyleBoxFlat.new()
border.bg_color = Color("303030")
border.border_color = Color("ffffff")
border.border_width_top = 1
border.border_width_right = 1
border.border_width_bottom = 1
border.border_width_left = 1
for x in range(new_x):
render_cells.append([])
for y in range(new_y):
render_cells[x].append(Panel.new())
render_cells[x][y].name = str(x) + " " + str(y)
render_cells[x][y].add_theme_stylebox_override("panel",border)
render_cells[x][y].size.x = 20*$"case_size".value
render_cells[x][y].size.y = 20*$"case_size".value
render_cells[x][y].position.x = render_cells[x][y].size.x*x + offset[$"case_size".value][0]
render_cells[x][y].position.y = render_cells[x][y].size.y*y + offset[$"case_size".value][1]
$"maze".add_child(render_cells[x][y])
func update_cell(x,y,state):
var update = render_cells[x][y].get_theme_stylebox("panel").duplicate()
var cell_type = {0:Color("303030"),1:Color("ff0000"),2:Color("00ff00"),3:Color("ffffff"),4:Color("800080"),5:Color("0000ff")}
update.bg_color = cell_type[state]
render_cells[x][y].add_theme_stylebox_override("panel",update)
if Vector2(x,y) == get_tooltip_position():
update_tooltip(-1,-1)
func get_cell_state(x,y):
if x < 0 or x > render_cells.size()-1 or y < 0 or y > render_cells[x].size()-1:
return -1
var state = render_cells[x][y].get_theme_stylebox("panel").bg_color
# 5: Visual only, 3-way intersection
# 4: Visual only, openable wall cell
# 3: Visual only, available cell
# 2: Visited cell
# 1: Unopenable wall cell
# 0: Free cell
var cell_type = {Color("303030"):0,Color("ff0000"):1,Color("00ff00"):2,Color("ffffff"):3,Color("800080"):4,Color("0000ff"):5}
return cell_type[state]
func get_tooltip_position():
return Vector2(int($"Tooltip/position/x".text) - 1,int($"Tooltip/position/y".text) - 1)
func update_tooltip(x,y):
var update_only = (x == -1 and y == -1)
var inside_maze_renderer = (x >= $"maze".position.x and x < $"maze".size.x+$"maze".position.x) and (y >= $"maze".position.y and y < $"maze".size.y+$"maze".position.y)
var relative_position = Vector2(x - $"maze".position.x - offset[$"case_size".value][0] , y - $"maze".position.y - offset[$"case_size".value][1])
var inside_case = (relative_position.x > 0 and relative_position.y > 0) and (relative_position.x < $"maze".size.x - offset[$"case_size".value][0]*2 and relative_position.y < $"maze".size.y - offset[$"case_size".value][1]*2)
if update_only or inside_maze_renderer:
if update_only or inside_case:
if !$"Tooltip".visible:
$"Tooltip".visible = true
var case
if !update_only:
$"Tooltip".position = Vector2(x,y)
case = (relative_position/(20*$"case_size".value)).floor()
$"Tooltip/position/x".text = str(case.x + 1)
$"Tooltip/position/y".text = str(case.y + 1)
else:
case = Vector2(int($"Tooltip/position/x".text) - 1,int($"Tooltip/position/y".text) - 1)
var resize = ["CASE_FREE", "CASE_CLOSED", "CASE_VISITED", "CASE_AVAILABLE", "CASE_WALL", "CASE_INTERSECTION"]
var state = get_cell_state(case.x,case.y)
if state == -1:
$"Tooltip".size.x = 86
$"Tooltip/case_type".size.x = 73
$"Tooltip/case_type".size.y = 24
$"Tooltip/case_type".text = ""
else:
$"Tooltip/case_type".size.y = 43
$"Tooltip/case_type".text = resize[state]
$"Tooltip".size.x = max(86,$"Tooltip/case_type".get_content_width() + 4*2)
$"Tooltip/case_type".size.x = $"Tooltip".size.x
if x+$"Tooltip".size.x > $"maze".position.x+$"maze".size.x:
$"Tooltip".position.x -= $"Tooltip".size.x
if y+$"Tooltip".size.y > $"maze".position.y+$"maze".size.y:
$"Tooltip".position.y -= $"Tooltip".size.y
time_spent = Time.get_ticks_msec()
elif $"Tooltip".visible:
$"Tooltip".visible = false
time_spent = 0
elif $"Tooltip".visible:
$"Tooltip".visible = false
time_spent = 0
return true
func update_progress(taken:float,remaining:float):
$"Progress/bar".size.x = (taken/remaining)*1152
$"Progress/count".position.x = 1110 - $"Progress/text".get_content_width() - 3
$"Progress/count".text = str(taken) + "/" + str(remaining)
func get_save_path(file_format,callback):
var path = FileDialog.new()
path.name = "SAVE"
path.file_mode = FileDialog.FILE_MODE_SAVE_FILE
path.access = FileDialog.ACCESS_FILESYSTEM
path.filters = PackedStringArray(["*." + file_format])
path.use_native_dialog = true
path.file_selected.connect(callback)
path.visible = true
add_child(path)
func write_save_path(file_format,path,content):
var shortest = 2 + file_format.length() + 1
# Werewolves are on your way
if path.length() < shortest or\
# For know-it-all users
path.right(shortest-1) == "\\." + file_format or\
# For normal users
path.right(shortest-2) != "." + file_format:
path += "." + file_format
var file = FileAccess.open(path,FileAccess.WRITE)
file.store_string(content)
func maze_to_CSV():
get_save_path("csv",save_CSV)
func maze_to_JS():
get_save_path("html",save_JS)
func save_CSV(path):
var CSV = ""
for y in range(render_cells[0].size()):
for x in range(render_cells.size()):
CSV += str(get_cell_state(x,y)) + ","
CSV = CSV.left(-1) + "\n"
write_save_path("csv",path,CSV)
func save_JS(path):
var JS = '''<!--
Maze replay, version 1
Copyright (C) 2024 Foxarc
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/>.
-->
<html>
<head>
<title>Maze replay</title>
<style>
body {
background-color: black;
}
h1, h2, p, td {
color: white;
}
a {
color: orange;
}
#maze, #maze td {
border: solid 1px white;
border-spacing: 0;
}
#maze td {
height: 1.2vw;
width: 1.2vw;
}
*[state="0"] {background-color: #303030;}
*[state="1"] {background-color: #ff0000;}
*[state="2"] {background-color: #00ff00;}
*[state="3"] {background-color: #ffffff;}
*[state="4"] {background-color: #800080;}
*[state="5"] {background-color: #0000ff;}
#control, #caption {
margin-top: 1vw;
}
#control p {
display: inline;
}
#caption th {
border: solid 1px white;
border-spacing: 0;
height: 1vh;
width: 2vw;
}
#caption td {
color: yellow;
}
footer {
bottom: 0;
color: white;
white-space: pre-wrap;
}
</style>
</head>
<body>
<h1>Maze replay</h1>
<h2>By <a href="https://foxarc.website">Foxarc</a>, 2024.</h2>
<noscript>JavaScript required to replay the maze.</noscript>
<table id="maze"></table>
<div id="control">
<p>Speed: <input id="speed" type="number" min="0.1" max="1" step="0.1" value="0.1"> second(s). </p>
<button id="replay" onclick="replay();">Replay</button>
<button id="export_CSV" onclick="export_CSV();" disabled>Export as CSV (maze layout only)</button>
<br>
<button id="backward" onclick="set_frame(-1);" disabled>&lt;</button>
<button id="pause" onclick="pause_replay();" disabled>Pause</button>
<button id="forward" onclick="set_frame(1);">&gt;</button>
<p>Frame: <span id="current_frame">0</span>/<span id="max_frames">1</span></p>
</div>
<table id="caption">
<tr>
<th state="0"></th>
<td>Free</td>
</tr>
<tr>
<th state="1"></th>
<td>Closed wall</td>
</tr>
<tr>
<th state="2"></th>
<td>Visited</td>
</tr>
<tr>
<th state="3"></th>
<td>Available</td>
</tr>
<tr>
<th state="4"></th>
<td>Wall</td>
</tr>
<tr>
<th state="5"></th>
<td>3-way intersection</td>
</tr>
</div>
<!-- Animation -->
<script>
/**
Maze replay file format
[x,y,preview,animation]
x: the size of the maze along the x-axis.
y: the size of the maze along the y-axis.
preview: an x*y array preview of the untouched maze.
animation:
x,y,state
From [x,y,preview,..., do x,y,state each time until the end of the array.
When x == y == state == -1, it's the end of the animation: replace the remaining walls with closed walls.
x,y: the coordinates where to change the state.
state: the state to affect.
**/
const animation = JS_ANIMATION;
</script>
<!-- Maze replay -->
<script>
let current_frame = 0;
let max_frames = (animation.length - 3 - 3)/3;
let animations = [];
let pause = true;
document.getElementById("max_frames").innerText = max_frames;
let tr;
let td;
for (let y = 0; y < animation[1]; y++) {
tr = document.createElement("tr");
for (let x = 0; x < animation[0]; x++) {
td = document.createElement("td");
td.id = x.toString() + " " + y.toString();
td.setAttribute("state",animation[2][x][y]);
tr.appendChild(td);
}
document.getElementById("maze").appendChild(tr);
}
function toggle(state,...ids) {
for (const id of ids) {
if (state == 2 && id == "pause") {
document.getElementById("pause").disabled = false;
if (document.getElementById("pause").innerText == "Resume") {
document.getElementById("pause").innerText = "Pause";
}
pause = false;
} else if (state == 3 && id == "pause") {
if (document.getElementById("pause").innerText == "Pause") {
document.getElementById("pause").innerText = "Resume";
document.getElementById("pause").disabled = false;
}
} else {
document.getElementById(id).disabled = !state;
}
}
}
function rewind() {
for (let y = 0; y < animation[1]; y++) {
for (let x = 0; x < animation[0]; x++) {
document.getElementById(x + " " + y).setAttribute("state",animation[2][x][y]);
}
}
current_frame = 0;
document.getElementById("current_frame").innerText = 0;
}
function replay(do_rewind = true) {
toggle(false,"export_CSV","replay","backward","forward");
if (do_rewind) { rewind(); }
toggle(2,"pause"); // Don't forget to unpause if the animation was paused!
let speed = document.getElementById("speed").value;
// 3 * the animation frame to resume from:
for (let i = 3*(current_frame+1); i < animation.length; i += 3) {
// An animation is made of 3 things: x,y and the state. Divide by 3 to get the whole frame then multiply by speed*1000 for
// how long we wait before playing the next state in JavaScript. We will also remember to remove the previous frames in case
// we resume the animation so that we won't have to wait and waste current_frame*speed*1000 of time for the cases that were
// already drawn on the grid.
animations.push(setTimeout(() => play(animation[i],animation[i+1],animation[i+2]), (i/3)*speed*1000 - current_frame*speed*1000));
}
}
function play(x,y,state,ignore_pause = false,direction = 1) {
if (!pause || ignore_pause) {
if (x == -1 && y == -1 && state == -1) {
for (let y2 = 0; y2 < animation[1]; y2++) { for (let x2 = 0; x2 < animation[0]; x2++) {
if (document.getElementById(x2 + " " + y2).getAttribute("state") == 4) {
document.getElementById(x2 + " " + y2).setAttribute("state",1);
}
}}
toggle(true,"export_CSV","replay","backward");
toggle(false,"pause");
pause = true;
} else {
current_frame += direction;
document.getElementById("current_frame").innerText = current_frame;
document.getElementById(x + " " + y).setAttribute("state",state);
}
} else { for (let i = 0; i < animations.length; i++) { clearTimeout(animations[i]); }}
}
function pause_replay() {
if (pause) {
pause = false;
document.getElementById("pause").innerText = "Pause";
toggle(false,"export_CSV","replay");
replay(false);
} else {
pause = true;
document.getElementById("pause").innerText = "Resume";
toggle(true,"export_CSV","replay");
if (current_frame != 0) { toggle(true,"backward"); }
if (current_frame != max_frames) { toggle(true,"forward"); }
}
}
function set_frame(next_frame) {
if (!current_frame) {
play(animation[3],animation[4],animation[5],true,next_frame);
toggle(3,"pause");
toggle(true,"backward");
} else if (next_frame == -1) {
toggle(3,"pause");
if (current_frame == 1) {
toggle(false,"backward");
} else if (current_frame == max_frames) {
toggle(true,"pause");
}
if (current_frame == max_frames) {
// We could have an array previously to store the walls at the last step but we didn't.
// The reason being optimization at first so is memory. We have no choice therefore but
// to rewind the animation then replay quickly the animation until the second to last.
rewind();
for (let i = 3; i < animation.length - 3*2; i += 3) {
play(animation[i],animation[i+1],animation[i+2],true);
}
toggle(true,"forward");
} else {
// Get the current coordinates of this frame then undo the state using the state from the preview maze:
let x = animation[ 2+3*current_frame-2 ] , y = animation[ 2+3*current_frame-1 ];
play(x,y,animation[2][x][y],true,-1);
}
} else {
toggle(3,"pause");
play(animation[2+3*(current_frame+next_frame)-2],animation[2+3*(current_frame+next_frame)-1],animation[2+3*(current_frame+next_frame)],true,1);
if (current_frame == max_frames) {
play(-1,-1,-1,1);
toggle(false,"forward");
}
}
}
function export_CSV() {
let CSV = [""];
for (let y = 0; y < animation[1]; y++) {
for (let x = 0; x < animation[0]; x++) {
CSV[0] += document.getElementById(x + " " + y).getAttribute("state") + ",";
}
CSV[0] = CSV[0].slice(0,-1) + "\\n";
}
let CSV_file = URL.createObjectURL(new File(CSV,window.location.href.split("/").pop().replace(".html",".csv"),{type:"text/csv"}));
window.location.href = CSV_file;
}
</script>
<footer>
Maze replay, version 1
Copyright (C) 2024 Foxarc
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 <a href="https://www.gnu.org/licenses/">&lt;https://www.gnu.org/licenses/&gt;</a>.
</footer>
</body>
</html>'''
var JS_array = "["
JS_array += str(JS_animation[0]) + "," + str(JS_animation[1]) + ",["
for x in range(JS_animation[2].size()):
JS_array += "["
for y in range(JS_animation[2][x].size()):
JS_array += str(JS_animation[2][x][y]) + ","
JS_array = JS_array.left(-1) + "],"
JS_array = JS_array.left(-1) + "],"
for i in range(3,JS_animation.size()):
JS_array += str(JS_animation[i]) + ","
JS_array = JS_array.left(-1) + "]"
JS = JS.replace("JS_ANIMATION",JS_array)
write_save_path("html",path,JS)
func _on_surface_size_x_changed(value):
rerender_cells(value,$"surface_size_y".value)
func _on_surface_size_y_changed(value):
rerender_cells($"surface_size_x".value,value)
func _on_case_size_value_changed(value):
$"surface_size_x".max_value = max_cases[value][0]
$"surface_size_y".max_value = max_cases[value][1]
$"Limitations/x/max".text = str(max_cases[value][0])
$"Limitations/y/max".text = str(max_cases[value][1])
rerender_cells($"surface_size_x".value,$"surface_size_y".value)
func _on_record_toggled(toggled_on):
if (toggled_on):
$"Captions/Visualization box".visible = false
$"Captions/Visualization text".visible = false
else:
$"Captions/Visualization box".visible = true
$"Captions/Visualization text".visible = true
func _on_generate_pressed():
if $"Language hint".visible:
$"Language hint".visible = false
if $"Export".visible:
$"Export".visible = false
JS_animation = []
$"Progress".visible = false
if generating:
generating = false
$"Generate".text = "GENERATE"
return true
var generated = false
# For know-it-all users
if $"surface_size_x".value == 1:
for y in range(render_cells[0].size()):
update_cell(0,y,1)
generated = true
elif $"surface_size_y".value == 1:
for x in range(render_cells.size()):
update_cell(x,0,1)
generated = true
elif $"surface_size_x".value == 2 and $"surface_size_y".value == 2:
update_cell(0,0,1)
update_cell(1,0,1)
update_cell(0,1,1)
update_cell(1,1,1)
generated = true
elif $"surface_size_x".value == 2 or $"surface_size_y".value == 2:
for x in range($"surface_size_x".value):
for y in range(render_cells[x].size()):
update_cell(x,y,1)
generated = true
elif $"surface_size_x".value >= 100 or $"surface_size_y".value >= 100:
return "foxes will now attack u"
if !generated:
$"surface_size_x".editable = false
$"surface_size_y".editable = false
$"case_size".editable = false
$"Generate".text = "CANCEL"
$"record".disabled = true
if $"record".button_pressed:
generated = await generate_and_record(Vector2($"surface_size_x".value,$"surface_size_y".value),render_cells)
else:
var cells = await generate(Vector2($"surface_size_x".value,$"surface_size_y".value),$"case_size".value)
for x in range(render_cells.size()):
for y in range(render_cells[x].size()):
update_cell(x,y,cells[x][y])
generated = true
$"surface_size_x".editable = true
$"surface_size_y".editable = true
$"case_size".editable = true
$"Generate".text = "GENERATE"
$"record".disabled = false
if generated:
if !JS_animation.size():
$"Export/JS".disabled = true
$"Export/JS".text = "NO_JS"
else:
$"Export/JS".disabled = false
$"Export/JS".text = "EXPORT_JS"
$"Export".visible = true
func _ready():
$"Captions/Visualization box".size.x = min(137 + $"Captions/3-way intersection text".get_content_width() + 3,293)
$"Captions/Visualization text".position.x = $"Captions/Visualization box".position.x + $"Captions/Visualization box".size.x + 2
$"Captions/Visualization text".size.x = min($"Captions/Visualization text".get_content_width(),637)
rerender_cells($"surface_size_x".value,$"surface_size_y".value)
func _input(event):
if event is InputEventMouseMotion:
update_tooltip(event.position.x,event.position.y)
func _process(_delta):
if time_spent:
if Time.get_ticks_msec() > time_spent + 1*1000:
if Input.get_mouse_mode() == Input.MOUSE_MODE_VISIBLE:
Input.set_mouse_mode(Input.MOUSE_MODE_HIDDEN)
elif Input.get_mouse_mode() == Input.MOUSE_MODE_HIDDEN:
Input.set_mouse_mode(Input.MOUSE_MODE_VISIBLE)
elif Input.get_mouse_mode() == Input.MOUSE_MODE_HIDDEN:
Input.set_mouse_mode(Input.MOUSE_MODE_VISIBLE)
if Input.is_action_just_pressed("language"):
language = (language + 1) % TranslationServer.get_loaded_locales().size()
TranslationServer.set_locale(TranslationServer.get_loaded_locales()[language])
$"Captions/Visualization box".size.x = min(137 + $"Captions/3-way intersection text".get_content_width() + 3,293)
$"Captions/Visualization text".position.x = $"Captions/Visualization box".position.x + $"Captions/Visualization box".size.x + 2
$"Captions/Visualization text".size.x = min($"Captions/Visualization text".get_content_width(),637)
$"Progress/count".position.x = 1110 - $"Progress/text".get_content_width() - 3
update_tooltip(-1,-1)
# Input: Surface size, Case size.
# Output: Maze.
func generate(floor_surface,size):
size = 1 # Not now for a version 1 of the maze generator.
var floor_size = floor_surface/size
# Recursive backtracker algorithm using stack for low-performance computers
#
# From Wikipedia (06/29/2024):
# Randomized depth-first search
# This algorithm, also known as the "recursive backtracker" algorithm, is a randomized version of the depth-first search algorithm.
#
# Frequently implemented with a stack, this approach is one of the simplest ways to generate a maze using a computer. Consider the space for a
# maze being a large grid of cells (like a large chess board), each cell starting with four walls. Starting from a random cell, the computer then
# selects a random neighbouring cell that has not yet been visited. The computer removes the wall between the two cells and marks the new cell as
# visited, and adds it to the stack to facilitate backtracking. The computer continues this process, with a cell that has no unvisited neighbours
# being considered a dead-end. When at a dead-end it backtracks through the path until it reaches a cell with an unvisited neighbour, continuing
# the path generation by visiting this new, unvisited cell (creating a new junction). This process continues until every cell has been visited,
# causing the computer to backtrack all the way back to the beginning cell. We can be sure every cell is visited.
#
# As given above this algorithm involves deep recursion which may cause stack overflow issues on some computer architectures. The algorithm can be
# rearranged into a loop by storing backtracking information in the maze itself. This also provides a quick way to display a solution, by starting
# at any given point and backtracking to the beginning.
#
# Mazes generated with a depth-first search have a low branching factor and contain many long corridors, because the algorithm explores as far as
# possible along each branch before backtracking.
#
# Iterative implementation (with stack)
#
# A disadvantage of the first approach is a large depth of recursion – in the worst case,
# the routine may need to recur on every cell of the area being processed, which may exceed the maximum recursion stack depth in many environments.
# As a solution, the same backtracking method can be implemented with an explicit stack, which is usually allowed to grow much bigger with no harm.
#
# 1. Choose the initial cell, mark it as visited and push it to the stack
# 2. While the stack is not empty
# 1. Pop a cell from the stack and make it a current cell
# 2. If the current cell has any neighbours which have not been visited
# 1. Push the current cell to the stack
# 2. Choose one of the unvisited neighbours
# 1. Remove the wall between the current cell and the chosen cell
# 2. Mark the chosen cell as visited and push it to the stack
# 2D cells
var cells = []
# But first:
# Our game is going to have its own rules for making the maze. Recall there is a distance between walls.
# All algorithms will assume that the size of the walls around our cells doesn't matter at all. On the
# contrary, recall there is a size for the floor of the backrooms. If we didn't consider the size for
# the walls, we will find walls of a thickness of a paper and they will be out of touch for a backroom.
#
# Walls thickness must be considered: we do not need to make a new layer above the cells to mark the
# walls around the cells but we can reuse the existing cells to mark walls around them that is for
# each cell, there is exactly 8 cells of walls around it. It will make sense and won't cause a problem
# to any algorithm in existence as we can simply skip the wall cell.
# We will enclose the edges of the floor by walls.
# For each cell:
# - 0 means the cell is free
# - 1 means the cell is a wall
# - 2 means the cell was visited
for x in range(floor_size.x):
cells.append([])
cells[x].resize(floor_size.y)
cells[x].fill(0)
cells[x][0] = 1 # The first row will always be walls
for y in range(1,floor_size.y-1):
# Add walls on the edges of the floor
cells[0][y] = 1
cells[floor_size.x-1][y] = 1
for x in range(floor_size.x):
cells[x][floor_size.y-1] = 1 # We finish the last row with walls
# How many cells are really available? We need another calculation for that.
# Recall that each cell will have exactly 8 walls cells around it. Since there are 8 walls cells around a
# cell, that means a cell takes a cell above and under, left and right for walls.
#
# 2 more rules:
# 1. A cell is allowed to own the walls at the edges of the floor.
# 2. A new cell will share another cell's walls if there are existing walls created by this previous cell.
#
# As a result, the first cell will have 8 walls around it, the next ones 8-3 = 5 walls from by sharing the
# previous cell's walls, all the way up until the edge of the floor.
var free_x = int(1 + (floor_size.x - 3)/2) # First cell will take 3 cases for walls, the next ones 2.
var free_y = int(1 + (floor_size.y - 3)/2) # Ditto.
# Apply the instructions from Wikipedia:
var stack = []
# 1. Choose the initial cell, mark it as visited and push it to the stack
var cur = [2*(randi() % free_x) + 1,2*(randi() % free_y) + 1] # Start with the cells, add +1 to find the free cell
cells[cur[0]][cur[1]] = 2
stack.append(cur)
# 2. While the stack is not empty
while stack.size() != 0:
# 1. Pop a cell from the stack and make it a current cell
cur = stack.back()
stack.pop_back()
# 2. If the current cell has any neighbours which have not been visited
var sides = []
if cur[1]-2 > -1 and cells[cur[0]][cur[1]-2] == 0: # Up
sides.append([cur[0],cur[1]-2])
if cur[0]+2 < floor_size.x and cells[cur[0]+2][cur[1]] == 0: # Right
sides.append([cur[0]+2,cur[1]])
if cur[1]+2 < floor_size.y and cells[cur[0]][cur[1]+2] == 0: # Down
sides.append([cur[0],cur[1]+2])
if cur[0]-2 > -1 and cells[cur[0]-2][cur[1]] == 0: # Left
sides.append([cur[0]-2,cur[1]])
if sides.size():
# 1. Push the current cell to the stack
stack.append(cur)
# 2. Choose one of the unvisited neighbours
var next = sides[randi() % sides.size()]
# 1. Remove the wall between the current cell and the chosen cell
# 2. Mark the chosen cell as visited and push it to the stack
cells[ cur[0] + (next[0]-cur[0])/2 ][ cur[1] + (next[1]-cur[1])/2 ] = 2
cells[next[0]][next[1]] = 2
stack.append(next)
# When we are done with generating the maze, fill the remaining "free" cells with walls.
for x in range(cells.size()):
for y in range(cells[x].size()):
if cells[x][y] == 0:
cells[x][y] = 1
return cells
# Input: Surface size, Case size, Render cells.
func generate_and_record(floor_size,cells):
var progress_speed = (1/floor_size.x + 1/floor_size.y)
generating = true
for x in range(floor_size.x):
update_cell(x,0,1)
if !generating:
return false
await get_tree().create_timer(progress_speed).timeout
for y in range(1,floor_size.y-1):
for x in range(floor_size.x):
update_cell(x,y,0)
update_cell(0,y,1)
if !generating:
return false
await get_tree().create_timer(progress_speed).timeout
update_cell(floor_size.x-1,y,1)
if !generating:
return false
await get_tree().create_timer(progress_speed).timeout
for x in range(floor_size.x):
update_cell(x,floor_size.y-1,1)
var free_x = int(1 + (floor_size.x - 3)/2)
var free_y = int(1 + (floor_size.y - 3)/2)
var free_cells = free_x*free_y
var progress = 0
$"Progress".visible = true
update_progress(progress,free_cells)
var stack = []
# Mark available cells for visualization
for x in range(free_x):
for y in range(free_y):
update_cell(2*x+1,2*y+1,3)
if !generating:
return false
await get_tree().create_timer(progress_speed).timeout
# Mark walls cells for visualization
for x in range(1,cells.size()-1):
for y in range(1,cells[x].size()-1):
if y % 2 == 0:
update_cell(x,y,4)
elif 2*x < cells.size()-1 and y < cells[x].size()-1:
update_cell(2*x,y,4)
# Copy the untouched maze (preview) into JS animation
JS_animation = [floor_size.x,floor_size.y,[]]
for x in range(floor_size.x):
JS_animation[2].append([])
for y in range(floor_size.y):
JS_animation[2][x].append(get_cell_state(x,y))
var cur = [2*(randi() % free_x) + 1,2*(randi() % free_y) + 1]
update_cell(cur[0],cur[1],2)
progress += 1
update_progress(progress,free_cells)
JS_animation.append(cur[0])
JS_animation.append(cur[1])
JS_animation.append(2)
if !generating:
return false
await get_tree().create_timer(progress_speed).timeout
stack.append(cur)
while stack.size() != 0:
cur = stack.back()
stack.pop_back()
var unchecked = [ [cur[0],cur[1]-2] , [cur[0]+2,cur[1]] , [cur[0],cur[1]+2] , [cur[0]-2,cur[1]] ] # Up, Right, Down, Left
var sides = []
for pos in unchecked:
if get_cell_state(pos[0],pos[1]) == 0 or get_cell_state(pos[0],pos[1]) == 3 or get_cell_state(pos[0],pos[1]) == 4:
sides.append(pos)
unchecked = [ [cur[0],cur[1]-1] , [cur[0]+1,cur[1]] , [cur[0],cur[1]+1] , [cur[0]-1,cur[1]] ]
var connected = []
for pos in unchecked:
if get_cell_state(pos[0],pos[1]) == 2 or get_cell_state(pos[0],pos[1]) == 5:
connected.append(pos)
if sides.size():
stack.append(cur)
# We consider an intersection to be a cell with 3 sides connected to the cell
if connected.size() == 2: # It is 2 as the algorithm always resumes from a +1 connected cell (2+1 = 3)
update_cell(cur[0],cur[1],5) # Mark the cell as intersection for render only
JS_animation.append(cur[0])
JS_animation.append(cur[1])
JS_animation.append(5)
var next = sides[randi() % sides.size()]
update_cell(cur[0] + (next[0]-cur[0])/2, cur[1] + (next[1]-cur[1])/2, 2)
JS_animation.append(cur[0] + (next[0]-cur[0])/2)
JS_animation.append(cur[1] + (next[1]-cur[1])/2)
JS_animation.append(2)
if !generating:
return false
await get_tree().create_timer(progress_speed).timeout
update_cell(next[0],next[1],2)
progress += 1
update_progress(progress,free_cells)
JS_animation.append(next[0])
JS_animation.append(next[1])
JS_animation.append(2)
if !generating:
return false
await get_tree().create_timer(progress_speed).timeout
stack.append(next)
for x in range(cells.size()):
for y in range(cells[x].size()):
if get_cell_state(x,y) == 0 or get_cell_state(x,y) == 4:
update_cell(x,y,1)
JS_animation.append(-1)
JS_animation.append(-1)
JS_animation.append(-1)
generating = false
return true

579
maze.tscn Normal file
View File

@ -0,0 +1,579 @@
[gd_scene load_steps=3 format=3 uid="uid://cg42xw5vv3pen"]
[ext_resource type="Script" path="res://maze.gd" id="1_764be"]
[sub_resource type="StyleBoxFlat" id="StyleBoxFlat_013op"]
bg_color = Color(0, 0, 0, 0)
draw_center = false
border_width_left = 1
border_width_top = 1
border_width_right = 1
border_width_bottom = 1
border_color = Color(1, 0, 0, 1)
corner_radius_top_left = 2
corner_radius_top_right = 2
corner_radius_bottom_right = 2
corner_radius_bottom_left = 2
corner_detail = 1
[node name="Maze" type="Control"]
layout_mode = 3
anchors_preset = 15
anchor_right = 1.0
anchor_bottom = 1.0
grow_horizontal = 2
grow_vertical = 2
script = ExtResource("1_764be")
[node name="Title" type="RichTextLabel" parent="."]
layout_mode = 0
offset_right = 242.0
offset_bottom = 72.0
bbcode_enabled = true
text = "PROJECT_TITLE"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Surface" type="RichTextLabel" parent="."]
layout_mode = 0
offset_left = 300.0
offset_top = 4.0
offset_right = 395.0
offset_bottom = 28.0
bbcode_enabled = true
text = "SURFACE_SIZE"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="surface_size_x" type="SpinBox" parent="."]
layout_mode = 0
offset_left = 400.0
offset_top = 2.0
offset_right = 483.063
offset_bottom = 33.0
min_value = 1.0
max_value = 57.0
value = 1.0
alignment = 1
[node name="surface_size_y" type="SpinBox" parent="."]
layout_mode = 0
offset_left = 485.063
offset_top = 2.0
offset_right = 568.125
offset_bottom = 33.0
min_value = 1.0
max_value = 27.0
value = 1.0
alignment = 1
[node name="Surface order" type="RichTextLabel" parent="."]
layout_mode = 0
offset_left = 580.126
offset_top = 4.0
offset_right = 606.126
offset_bottom = 28.0
text = "X,Y"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Case" type="RichTextLabel" parent="."]
layout_mode = 0
offset_left = 300.0
offset_top = 36.0
offset_right = 395.0
offset_bottom = 60.0
bbcode_enabled = true
text = "CASE_SIZE"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="case_size" type="SpinBox" parent="."]
layout_mode = 0
offset_left = 400.0
offset_top = 35.0
offset_right = 483.063
offset_bottom = 66.0
min_value = 1.0
max_value = 9.0
value = 1.0
alignment = 1
[node name="Limitations" type="Control" parent="."]
anchors_preset = 0
offset_left = 610.0
offset_top = 1.0
offset_right = 804.0
offset_bottom = 94.0
[node name="text" type="RichTextLabel" parent="Limitations"]
layout_mode = 1
anchors_preset = 10
anchor_right = 1.0
offset_bottom = 24.0
grow_horizontal = 2
bbcode_enabled = true
text = "DEMO"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="x" type="RichTextLabel" parent="Limitations"]
layout_mode = 1
anchors_preset = 14
anchor_top = 0.5
anchor_right = 1.0
anchor_bottom = 0.5
offset_top = -22.5
offset_bottom = 1.5
grow_horizontal = 2
grow_vertical = 2
bbcode_enabled = true
text = "[center]1 ≤ X ≤ [/center]"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="max" type="RichTextLabel" parent="Limitations/x"]
layout_mode = 1
anchors_preset = 8
anchor_left = 0.5
anchor_top = 0.5
anchor_right = 0.5
anchor_bottom = 0.5
offset_left = 17.0
offset_top = -12.0
offset_right = 36.0
offset_bottom = 12.0
grow_horizontal = 2
grow_vertical = 2
text = "57"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="y" type="RichTextLabel" parent="Limitations"]
layout_mode = 1
anchors_preset = 14
anchor_top = 0.5
anchor_right = 1.0
anchor_bottom = 0.5
offset_top = -4.5
offset_bottom = 19.5
grow_horizontal = 2
grow_vertical = 2
bbcode_enabled = true
text = "[center]1 ≤ Y ≤ [/center]"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="max" type="RichTextLabel" parent="Limitations/y"]
layout_mode = 1
anchors_preset = 8
anchor_left = 0.5
anchor_top = 0.5
anchor_right = 0.5
anchor_bottom = 0.5
offset_left = 17.0
offset_top = -12.0
offset_right = 36.0
offset_bottom = 12.0
grow_horizontal = 2
grow_vertical = 2
text = "27"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="case" type="RichTextLabel" parent="Limitations"]
layout_mode = 1
anchors_preset = 14
anchor_top = 0.5
anchor_right = 1.0
anchor_bottom = 0.5
offset_top = 19.5
offset_bottom = 43.5
grow_horizontal = 2
grow_vertical = 2
bbcode_enabled = true
text = "DEMO_CASE"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Generate" type="Button" parent="."]
layout_mode = 1
anchors_preset = 1
anchor_left = 1.0
anchor_right = 1.0
offset_left = -222.0
offset_top = 2.0
offset_right = -2.0
offset_bottom = 65.0
grow_horizontal = 0
theme_override_font_sizes/font_size = 40
text = "GENERATE"
[node name="maze" type="ColorRect" parent="."]
layout_mode = 0
offset_left = 6.0
offset_top = 95.0
offset_right = 1146.0
offset_bottom = 635.0
color = Color(0, 0, 0, 1)
[node name="record" type="CheckBox" parent="."]
layout_mode = 0
offset_left = 930.0
offset_top = 65.0
offset_right = 1147.0
offset_bottom = 96.0
button_pressed = true
text = "RECORD"
[node name="Captions" type="Control" parent="."]
anchors_preset = 0
offset_left = 6.0
offset_top = 75.0
offset_right = 417.0
offset_bottom = 89.0
[node name="Free cell" type="ColorRect" parent="Captions"]
layout_mode = 2
offset_right = 14.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.2
color = Color(0.188235, 0.188235, 0.188235, 1)
[node name="Free cell text" type="RichTextLabel" parent="Captions"]
layout_mode = 2
offset_left = 15.0
offset_right = 47.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.3
bbcode_enabled = true
text = "FREE"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Unopenable wall" type="ColorRect" parent="Captions"]
layout_mode = 2
offset_left = 47.0
offset_right = 61.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.2
color = Color(1, 0, 0, 1)
[node name="Unopenable wall text" type="RichTextLabel" parent="Captions"]
layout_mode = 2
offset_left = 63.0
offset_right = 128.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 1.1
bbcode_enabled = true
text = "CLOSED_WALL"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Visited cell" type="ColorRect" parent="Captions"]
layout_mode = 2
offset_left = 128.0
offset_right = 142.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.2
color = Color(0, 1, 0, 1)
[node name="Visited cell text" type="RichTextLabel" parent="Captions"]
layout_mode = 2
offset_left = 144.0
offset_right = 187.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.7
bbcode_enabled = true
text = "VISITED"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Available cell" type="ColorRect" parent="Captions"]
layout_mode = 2
offset_left = 187.0
offset_right = 201.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.2
[node name="Available cell text" type="RichTextLabel" parent="Captions"]
layout_mode = 2
offset_left = 203.0
offset_right = 258.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.9
bbcode_enabled = true
text = "AVAILABLE"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Openable wall" type="ColorRect" parent="Captions"]
layout_mode = 2
offset_left = 258.0
offset_right = 272.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.2
color = Color(0.501961, 0, 0.501961, 1)
[node name="Openable wall text" type="RichTextLabel" parent="Captions"]
layout_mode = 2
offset_left = 274.0
offset_right = 305.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.4
bbcode_enabled = true
text = "WALL"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="3-way intersection" type="ColorRect" parent="Captions"]
layout_mode = 2
offset_left = 305.0
offset_right = 319.0
offset_bottom = 14.0
size_flags_horizontal = 3
size_flags_stretch_ratio = 0.2
color = Color(0, 0, 1, 1)
[node name="3-way intersection text" type="RichTextLabel" parent="Captions"]
layout_mode = 2
offset_left = 321.0
offset_right = 477.0
offset_bottom = 14.0
size_flags_horizontal = 3
bbcode_enabled = true
text = "INTERSECTION"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Visualization box" type="Panel" parent="Captions"]
visible = false
layout_mode = 0
offset_left = 184.0
offset_top = -3.0
offset_right = 413.0
offset_bottom = 17.0
theme_override_styles/panel = SubResource("StyleBoxFlat_013op")
[node name="Visualization text" type="RichTextLabel" parent="Captions"]
visible = false
layout_mode = 0
offset_left = 415.0
offset_top = -1.0
offset_right = 637.0
offset_bottom = 18.0
theme_override_colors/default_color = Color(1, 0, 0, 1)
theme_override_font_sizes/normal_font_size = 11
bbcode_enabled = true
text = "WARNING"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Tooltip" type="Control" parent="."]
visible = false
top_level = true
layout_mode = 1
anchors_preset = 0
offset_right = 86.0
offset_bottom = 43.0
[node name="Background" type="ColorRect" parent="Tooltip"]
layout_mode = 1
anchors_preset = 15
anchor_right = 1.0
anchor_bottom = 1.0
grow_horizontal = 2
grow_vertical = 2
color = Color(0, 0, 0, 1)
[node name="position" type="RichTextLabel" parent="Tooltip"]
layout_mode = 0
offset_left = 5.0
offset_right = 81.0
offset_bottom = 24.0
bbcode_enabled = true
text = "[color=yellow]X:[/color] [color=yellow]Y:[/color]"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="x" type="RichTextLabel" parent="Tooltip/position"]
layout_mode = 0
offset_left = 18.0
offset_right = 37.0
offset_bottom = 24.0
text = "0"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
text_direction = 2
[node name="y" type="RichTextLabel" parent="Tooltip/position"]
layout_mode = 0
offset_left = 57.0
offset_right = 76.0
offset_bottom = 24.0
text = "0"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
text_direction = 2
[node name="case_type" type="RichTextLabel" parent="Tooltip"]
clip_contents = false
layout_mode = 0
offset_left = 4.0
offset_top = 19.0
offset_right = 4.0
offset_bottom = 43.0
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="Progress" type="Control" parent="."]
visible = false
layout_mode = 1
anchors_preset = 12
anchor_top = 1.0
anchor_right = 1.0
anchor_bottom = 1.0
offset_top = -13.0
grow_horizontal = 2
grow_vertical = 0
[node name="bar" type="ColorRect" parent="Progress"]
layout_mode = 1
anchors_preset = 15
anchor_right = 1.0
anchor_bottom = 1.0
grow_horizontal = 2
grow_vertical = 2
color = Color(0, 1, 0, 1)
[node name="text" type="RichTextLabel" parent="Progress"]
clip_contents = false
layout_mode = 1
anchors_preset = 6
anchor_left = 1.0
anchor_top = 0.5
anchor_right = 1.0
anchor_bottom = 0.5
offset_top = -9.5
offset_bottom = 7.5
grow_horizontal = 0
grow_vertical = 2
theme_override_font_sizes/normal_font_size = 11
bbcode_enabled = true
text = "PROGRESS"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
text_direction = 2
[node name="count" type="RichTextLabel" parent="Progress"]
layout_mode = 1
anchors_preset = 6
anchor_left = 1.0
anchor_top = 0.5
anchor_right = 1.0
anchor_bottom = 0.5
offset_left = -42.0
offset_top = -9.5
offset_bottom = 7.5
grow_horizontal = 0
grow_vertical = 2
theme_override_font_sizes/normal_font_size = 11
text = "0/0"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
text_direction = 2
[node name="Export" type="Control" parent="."]
visible = false
anchors_preset = 0
offset_left = 809.0
offset_top = 4.0
offset_right = 923.0
offset_bottom = 87.0
[node name="Choices" type="RichTextLabel" parent="Export"]
layout_mode = 1
anchors_preset = 10
anchor_right = 1.0
offset_bottom = 28.0
grow_horizontal = 2
bbcode_enabled = true
text = "EXPORT"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[node name="CSV" type="Button" parent="Export"]
layout_mode = 0
offset_left = 1.0
offset_top = 28.0
offset_right = 113.0
offset_bottom = 56.0
theme_override_font_sizes/font_size = 12
text = "EXPORT_CSV"
[node name="JS" type="Button" parent="Export"]
layout_mode = 0
offset_left = 1.0
offset_top = 58.0
offset_right = 113.0
offset_bottom = 86.0
theme_override_font_sizes/font_size = 12
text = "EXPORT_JS"
[node name="Language hint" type="RichTextLabel" parent="."]
layout_mode = 1
anchors_preset = 12
anchor_top = 1.0
anchor_right = 1.0
anchor_bottom = 1.0
offset_top = -16.0
offset_bottom = 1.0
grow_horizontal = 2
grow_vertical = 0
theme_override_font_sizes/normal_font_size = 11
text = "LANGUAGE"
scroll_active = false
autowrap_mode = 0
shortcut_keys_enabled = false
[connection signal="value_changed" from="surface_size_x" to="." method="_on_surface_size_x_changed"]
[connection signal="value_changed" from="surface_size_y" to="." method="_on_surface_size_y_changed"]
[connection signal="value_changed" from="case_size" to="." method="_on_case_size_value_changed"]
[connection signal="pressed" from="Generate" to="." method="_on_generate_pressed"]
[connection signal="toggled" from="record" to="." method="_on_record_toggled"]
[connection signal="pressed" from="Export/CSV" to="." method="maze_to_CSV"]
[connection signal="pressed" from="Export/JS" to="." method="maze_to_JS"]

BIN
maze_languages.ods Normal file
View File

Binary file not shown.

47
project.godot Normal file
View File

@ -0,0 +1,47 @@
; Engine configuration file.
; It's best edited using the editor UI and not directly,
; since the parameters that go here are not all obvious.
;
; Format:
; [section] ; section goes between []
; param=value ; assign values to parameters
config_version=5
[application]
config/name="Maze generator"
config/description="Maze generator
By Foxarc, 2024.
https://foxarc.website"
config/version="1"
run/main_scene="res://maze.tscn"
config/features=PackedStringArray("4.2", "GL Compatibility")
config/icon="res://icon.svg"
[display]
window/size/resizable=false
[filesystem]
import/blender/enabled=false
import/fbx/enabled=false
[input]
language={
"deadzone": 0.5,
"events": [Object(InputEventKey,"resource_local_to_scene":false,"resource_name":"","device":-1,"window_id":0,"alt_pressed":false,"shift_pressed":false,"ctrl_pressed":false,"meta_pressed":false,"pressed":false,"keycode":0,"physical_keycode":76,"key_label":0,"unicode":108,"echo":false,"script":null)
]
}
[internationalization]
locale/translations=PackedStringArray("res://languages.en.translation", "res://languages.fr.translation", "res://languages.es.translation", "res://languages.de.translation", "res://languages.pl.translation")
[rendering]
renderer/rendering_method="gl_compatibility"
renderer/rendering_method.mobile="gl_compatibility"