diff --git a/.gitignore b/.gitignore
index e63abc7..228ca6b 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1 +1,2 @@
 build-fx/*
+assets-fx/__pycache__/*
\ No newline at end of file
diff --git a/CMakeLists.txt b/CMakeLists.txt
index b6f3adf..3e8e66f 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -13,6 +13,9 @@ set(SOURCES
   src/main.c
   src/core.c
   src/display_engine.c
+  src/mutation_engine.c
+  src/data.c
+  src/epidemic_engine.c
   # ...
 )
 # Shared assets, fx-9860G-only assets and fx-CG-50-only assets
@@ -24,8 +27,10 @@ set(ASSETS_fx
   assets-fx/planes.png
   assets-fx/bground.png
   assets-fx/mutations.png
-  assets-fx/piece.png
+  assets-fx/cursor.png
   assets-fx/title.png
+  assets-fx/dna.png
+  assets-fx/explosion.png
   assets-fx/mutations_table/abilities_1.txt
   assets-fx/mutations_table/abilities_2.txt
   assets-fx/mutations_table/abilities_3.txt
diff --git a/LICENSE.md b/LICENSE.md
new file mode 100644
index 0000000..f288702
--- /dev/null
+++ b/LICENSE.md
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<https://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<https://www.gnu.org/licenses/why-not-lgpl.html>.
diff --git a/Old assets/Plague Logo.png b/Old assets/Plague Logo.png
new file mode 100644
index 0000000..f207bed
Binary files /dev/null and b/Old assets/Plague Logo.png differ
diff --git a/Old assets/bground.png b/Old assets/bground.png
new file mode 100644
index 0000000..174080c
Binary files /dev/null and b/Old assets/bground.png differ
diff --git a/Old assets/convert_world.py b/Old assets/convert_world.py
new file mode 100644
index 0000000..094f5d1
--- /dev/null
+++ b/Old assets/convert_world.py	
@@ -0,0 +1,39 @@
+from PIL import Image
+import numpy as np
+
+
+def analyse(index, pxl):
+    if pxl[0] == 255: return 0
+    else:
+        if index < 18 or index > 52: return 1
+        if 24 < index < 40: return 3
+        else: return 2
+
+
+def show():
+    img = Image.open("world.png")
+    data = np.array(img)
+
+    rslt = ""
+    for index, line in enumerate(data):
+        for pxl in line:
+            rslt += f"{analyse(index, pxl)}"
+        rslt += "\n"
+    print(rslt)
+
+
+def get_tabular():
+    img = Image.open("world.png")
+    data = np.array(img)
+
+    rslt = "const unsigned int world[64][128] =\n{"
+    for index, line in enumerate(data):
+        rslt += "\n    {"
+        for pxl in line:
+            rslt += f"{analyse(index, pxl)}, "
+        rslt = rslt[:-2] + "},"
+    rslt += "\n};"
+    print(rslt)
+
+
+get_tabular()
diff --git a/Old assets/title.png b/Old assets/title.png
new file mode 100644
index 0000000..f0beb69
Binary files /dev/null and b/Old assets/title.png differ
diff --git a/Old assets/world.png b/Old assets/world.png
new file mode 100644
index 0000000..359c314
Binary files /dev/null and b/Old assets/world.png differ
diff --git a/Plague.g1a b/Plague.g1a
index 42200be..4f80122 100644
Binary files a/Plague.g1a and b/Plague.g1a differ
diff --git a/README.md b/README.md
index c3a1686..fddbdf3 100644
--- a/README.md
+++ b/README.md
@@ -2,18 +2,22 @@
 
 ## Présentation
 
-De l'Anglais 'Plague' virus, ou peste et 'inc' diminutif de 'incorporated' peut être traduit par coopérative ou entreprise. Vous voila donc plongé dans 'L'Entreprise du Virus' un nom digne de 1984 : 'Le Ministère des Virus et de la Régulation Démographique' Ça nous fait un superbe acronyme : MVRD. J'aurais pu rajouter 'Et de la Santé Publique' on tape dans du très haut niveau là : MVRDESP aussi… Les Humains sont tellement fragiles, protégeons-les ! La plus grande menace pour l'Homme étant l'Homme, faites une bonne action : jouez à ce jeu !
+### Description du jeu
 
-Plague inc est donc un jeu de stratégie où le but est de réduire l'humanité à néant… Simple ? Non ! Il vous faudra manipuler avec dextérité et prudence un virus pour anéantir des humains qui ne sont pas super collaboratifs… Pire, ces petits rigolos veulent sauver leurs peaux et recherchent activement un remède à ce mystérieux virus inconnu…
+Plague inc est un jeu de stratégie où le but est de réduire l'humanité à néant… Simple ? Non ! Il vous faudra manipuler avec dextérité et prudence un virus pour anéantir des humains qui ne sont pas super collaboratifs… Pire, ces petits rigolos veulent sauver leurs peaux et recherchent activement un remède à ce mystérieux virus inconnu !
+
+### Licence
+
+La totalité du projet est soumise à la licence GNU General Public Licence v3.0.
 
 ## Contrôles
 
-Lancez le jeu,  et pressez n'importe quelle touche pour passer l'écran principal. Une fois sur l'écran représentant la Terre, plusieurs choix s'offrent à vous : 
+Lancez le jeu, et pressez n'importe quelle touche pour passer l'écran principal. Une fois sur l'écran représentant la Terre, plusieurs choix s'offrent à vous : 
   - [OPTN] permet d'afficher / cacher la barre en dessous du monde qui vous affiche vos points ADN et la barre de recherche des humains.
   - [VARS] permet de passer au gros du jeu : les mutations. Ce menu vous affiche vos points ADN, mais aussi les mutations sélectionnées ainsi que vos point de contagion, de sévérité, et de létalité. Dans ce menu, vous pouvez modifier tout cela.
-  - [x^2] permet d'accéder  au menu statistique qui vous affiche les stats sur les humains. La barre symbolise la popuation totale : donc la somme de toute les barre doit donné une seule barre entière.
+  - [x^2] permet d'accéder  au menu statistique qui vous affiche les stats sur les humains. La barre symbolise le pourcentage de la popuation totale : donc la somme de toute les barre doit donné une seule barre entière.
 
-De manière générale, si vous êtes perdu, [EXIT] vous ramènera toujours sur la mappemonde.
+De manière générale, si vous êtes perdu, [EXIT] vous ramènera toujours sur la mappemonde, ou au menu précédent.
 
 Dans le menu des mutations, vous pouvez modifier vos caractéristiques via les touches F1 à F6 comme suit : 
  - [F1] sert à changer les symptômes de votre maladie
@@ -23,66 +27,24 @@ Dans le menu des mutations, vous pouvez modifier vos caractéristiques via les t
 
 ## Mutations
 
-Dans ce jeu, vous aurez  le choix entre plusieurs mutations pour faire le plus de dégât possible parmis les humains ! Comme dans le jeu d'origine, celles-ci sont divisées en 3 catégories : Symptômes, Capacités, et Transmissions.
+Dans ce jeu, vous aurez le choix entre plusieurs mutations pour faire le plus de dégât possible parmis les humains ! Comme dans le jeu d'origine, celles-ci sont divisées en 3 catégories : Symptômes, Capacités, et Transmissions.
 
 Toutes les mutations ont plusieurs spécificités :
  - Contagion qui détermine la proportion de personnes infectées
- - Sévérité touche la recherche, on peut la comprendre de la manière suivante : si la sévérité est élevée, la maladie est grave, elle entraine par conséquent une recherche active de la part des Humains. Néanmoins, votre compteur de points ADN, augmente plus vite…
+ - Sévérité touche la recherche, on peut la comprendre de la manière suivante : si la sévérité est élevée, la maladie est grave, elle entraine par conséquent une recherche active de la part des Humains.
  - Létalité détermine le taux de mortalité parmi les infectés… Une létalité élevée fera de votre maladie une veritable machine à tuer, mais cela vous dévoile au grand jour et accèlere la recherche !
- - ADN, du nom de la molècule qui compose le code génétique. Ici, rien à voir, les points ADN vous permettent d'acheter des mutations.
- - Changement : certaines mutations par leur nature ralentissent la recherche, c'est ce ralentissement qui est symbolysé par changement. Concrétement, plus une maladie a de *changement* plus elle ralentit la recherche…
+ - le coût en points ADN.
 
-### Symptômes
+Dans le menu de mutation vous avez les statistiques de la mutation sélectionnée. Et entre parenthèses vous avez les modifications effectives. Le nombre entre parenthèses vous indique donc le nombre de points de contagion, sévérité, létalité, vous allez gagner (ou perdre si le nombre est négatif) si vous faites muter votre maladie.
 
-Comme son nom l'indique, votre maladie aussi puissante soit-elle n'est pas invisible : elle présente certains symptômes qui ont leurs spécificités. Bien entendu, les symptômes présentés dans ce jeu font partie du jeu d'origines et leurs spécificités sont proches.
+### Symptômes de la maladie
 
-|Nom|Coût ADN|Pt de contagion|Pt de sévérité|Pt de létalité|Changement|
-|:---:|:---:|:---:|:---:|:---:|:---:|
-|nausée|2|1|1|0|0,5
-|vomissement|4|3|2|0|0,5
-|tumeurs|15|4|2|5|1
-|pneumonie|4|2|2|0|0,5
-|toux|3|2|1|0|0,5
-|arrêt total des organes|30|0|20|25|2
-|folie|20|6|15|0|2
-|paranoïa|5|0|4|0|1
-|lésions|10|5|4|0|0,5
-|hémorragie|20|5|15|15|0,5
-|plaies|3|2|1|0|0,5
-|infections|17|6|7|6|0,5
-|immunodéficience|12|2|6|4|1
-|inflammation|5|2|2|2|0,5
+Comme son nom l'indique, votre maladie aussi puissante soit-elle n'est pas invisible : elle présente certains symptômes qui ont leurs spécificités. Bien entendu, les symptômes présentés dans ce jeu font partie du jeu d'origine et leurs spécificités en sont proches.
 
-### Capacités
+### Capacités spéciales
 
 En mutant, votre maladie peut acquérir des capacités. Ces capacités lui permettent de mieux apréhender un milieu ou une situation, ainsi la capacité *Résistance au froid* donne un suplément de vigueur à votre virus dans les pays froid. Cela se traduit par une augmentation plus ou moins forte de la contagion dans ces régions du monde…
 
-|Nom|Pt de contagion|Pt de sévérité|Pt de létalité|Coût ADN|
-|:---:|:---:|:---:|:---:|:---:|
-|résistance au froid|+4|||10
-|résistance au chand|+7|||15
-|résistance à l'environnement|+10|||30
-|résistance aux médicaments||+2|+0,5|15
-|résistance génétique||+5|+1|25
-|mutation accélérée||+8|+2|30
-
 ### Moyens de transmissions
 
-Votre maladie aura tout le loisir de changer ses moyens de transmission ! Plus ou moins efficaces ceux-ci permettent à votre maladie d'accéder à des caractérestiques intéressantes qui lui permettront de coloniser le monde entier ! ;)
-
-|Nom|Pt de contagion|Coût ADN|
-|:---:|:---:|:---:|
-|air Nv 1|+2|9
-|air Nv 2|+5|15
-|air Nv 3|+8|20
-|air et eau|+10|30
-|eau Nv 1|+2|9
-|eau Nv 2|+3|12
-|eau Nv 3|+9|25
-|oiseau Nv 1|+3|12
-|oiseau Nv 2|+5|18
-|animaux Nv 1|+2|10
-|animaux Nv 2|+6|16
-|sang Nv 1|+1|8
-|sang Nv 2|+4|14
-|sang Nv 3|+9|20
+Votre maladie aura tout le loisir de changer ses moyens de transmission ! Plus ou moins efficaces ceux-ci permettent à votre maladie d'accéder à des caractérestiques intéressantes qui lui permettront de coloniser le monde entier !
\ No newline at end of file
diff --git a/assets-fx/bground.png b/assets-fx/bground.png
index a50e413..16eac62 100644
Binary files a/assets-fx/bground.png and b/assets-fx/bground.png differ
diff --git a/assets-fx/converters.py b/assets-fx/converters.py
index 91227c7..b31c588 100644
--- a/assets-fx/converters.py
+++ b/assets-fx/converters.py
@@ -3,7 +3,10 @@ import fxconv
 
 def convert(input_name, output, params, target):
     if params["custom-type"] == "mutation-table":
-        convert_mt(map, input_name, output, params, target)
+        convert_mt(input_name, output, params, target)
+        return 0
+    elif params["custom-type"] == "mutation":
+        convert_md(input_name, output, params, target)
         return 0
     else:
         return 1
@@ -17,8 +20,9 @@ def convert_mt(input_name, output, params, target):
         
         # Encode information into bytes
         data = bytes()
-        for i in enumerate(mutation_matrix):
-            for j in enumerate(i):
-                mutation += fxconv.u32(int(j))
+        for i in mutation_matrix:
+            for j in i:
+                data += fxconv.u32(int(j))
 
     fxconv.elf(data, output, "_" + params["name"], **target)
+
diff --git a/assets-fx/cursor.png b/assets-fx/cursor.png
new file mode 100644
index 0000000..c16cb9b
Binary files /dev/null and b/assets-fx/cursor.png differ
diff --git a/assets-fx/dna.png b/assets-fx/dna.png
new file mode 100644
index 0000000..07127be
Binary files /dev/null and b/assets-fx/dna.png differ
diff --git a/assets-fx/explosion.png b/assets-fx/explosion.png
new file mode 100644
index 0000000..cd70249
Binary files /dev/null and b/assets-fx/explosion.png differ
diff --git a/assets-fx/mutations.png b/assets-fx/mutations.png
index 6970d18..8ebacb6 100644
Binary files a/assets-fx/mutations.png and b/assets-fx/mutations.png differ
diff --git a/assets-fx/mutations_table/abilities_1.txt b/assets-fx/mutations_table/abilities_1.txt
index 216307f..7757355 100644
--- a/assets-fx/mutations_table/abilities_1.txt
+++ b/assets-fx/mutations_table/abilities_1.txt
@@ -1,4 +1,4 @@
-1 | 0 | 0 | 0 | 6 | 0 | 0 | 0
-7 | 7 | 0 | 7 | 0 | 0 | 0 | 0
-0 | 0 | 0 | 0 | 7 | 0 | 0 | 0
-0 | 0 | 0 | 0 | 0 | 0 | 0 | 0
+ 1 |  0 | 0 |  0 |  6 | 0 | 0 | 0
+15 | 15 | 0 | 15 |  0 | 0 | 0 | 0
+ 0 |  0 | 0 |  0 | 15 | 0 | 0 | 0
+ 0 |  0 | 0 |  0 |  0 | 0 | 0 | 0
\ No newline at end of file
diff --git a/assets-fx/mutations_table/abilities_2.txt b/assets-fx/mutations_table/abilities_2.txt
index d2f497b..b54ad81 100644
--- a/assets-fx/mutations_table/abilities_2.txt
+++ b/assets-fx/mutations_table/abilities_2.txt
@@ -1,4 +1,4 @@
-1 | 0 | 0 | 0 | 6 | 0 | 0 | 0
-2 | 7 | 0 | 3 | 0 | 0 | 0 | 0
-0 | 0 | 0 | 0 | 7 | 0 | 0 | 0
-0 | 0 | 0 | 0 | 0 | 0 | 0 | 0
\ No newline at end of file
+1 |  0 | 0 | 0 |  6 | 0 | 0 | 0
+2 | 15 | 0 | 3 |  0 | 0 | 0 | 0
+0 |  0 | 0 | 0 | 15 | 0 | 0 | 0
+0 |  0 | 0 | 0 |  0 | 0 | 0 | 0
\ No newline at end of file
diff --git a/assets-fx/mutations_table/transmissions_1.txt b/assets-fx/mutations_table/transmissions_1.txt
index 0fde8a8..2e0695b 100644
--- a/assets-fx/mutations_table/transmissions_1.txt
+++ b/assets-fx/mutations_table/transmissions_1.txt
@@ -1,4 +1,4 @@
-1 |  14 | 14 |  0 | 14 | 5 | 0 |  0
-0 |   0 |  0 | 14 |  0 | 0 | 0 | 11
-9 |  14 |  0 |  0 |  0 | 0 | 0 | 14
-0 |   0 |  0 |  7 | 14 | 0 | 0 | 14
\ No newline at end of file
+1 |  15 | 15 |  0 | 15 | 5 | 0 |  0
+0 |   0 |  0 | 15 |  0 | 0 | 0 | 11
+9 |  15 |  0 |  0 |  0 | 0 | 0 | 15
+0 |   0 |  0 |  7 | 15 | 0 | 0 | 15
\ No newline at end of file
diff --git a/assets-fx/mutations_table/transmissions_2.txt b/assets-fx/mutations_table/transmissions_2.txt
index ed42e81..91b216a 100644
--- a/assets-fx/mutations_table/transmissions_2.txt
+++ b/assets-fx/mutations_table/transmissions_2.txt
@@ -1,4 +1,4 @@
-1 |  2 | 14 |  0 | 6 | 5 | 0 |  0
-0 |  0 |  0 | 14 | 0 | 0 | 0 | 11
+1 |  2 | 15 |  0 | 6 | 5 | 0 |  0
+0 |  0 |  0 | 15 | 0 | 0 | 0 | 11
 9 | 10 |  0 |  0 | 0 | 0 | 0 | 12
-0 |  0 |  0 |  7 | 8 | 0 | 0 | 14
\ No newline at end of file
+0 |  0 |  0 |  7 | 8 | 0 | 0 | 15
\ No newline at end of file
diff --git a/assets-fx/piece.png b/assets-fx/piece.png
deleted file mode 100644
index d0c2a63..0000000
Binary files a/assets-fx/piece.png and /dev/null differ
diff --git a/assets-fx/pieces.png b/assets-fx/pieces.png
deleted file mode 100644
index 985aedf..0000000
Binary files a/assets-fx/pieces.png and /dev/null differ
diff --git a/assets-fx/plague.png b/assets-fx/plague.png
index 6c25191..2c3b91d 100644
Binary files a/assets-fx/plague.png and b/assets-fx/plague.png differ
diff --git a/assets-fx/planes.png b/assets-fx/planes.png
index fae3c21..5995dc0 100644
Binary files a/assets-fx/planes.png and b/assets-fx/planes.png differ
diff --git a/assets-fx/title.png b/assets-fx/title.png
index f0beb69..dcc8c29 100644
Binary files a/assets-fx/title.png and b/assets-fx/title.png differ
diff --git a/old assets/Plague Logo.png b/old assets/Plague Logo.png
new file mode 100644
index 0000000..f207bed
Binary files /dev/null and b/old assets/Plague Logo.png differ
diff --git a/old assets/bground.png b/old assets/bground.png
new file mode 100644
index 0000000..174080c
Binary files /dev/null and b/old assets/bground.png differ
diff --git a/old assets/convert_world.py b/old assets/convert_world.py
new file mode 100644
index 0000000..094f5d1
--- /dev/null
+++ b/old assets/convert_world.py	
@@ -0,0 +1,39 @@
+from PIL import Image
+import numpy as np
+
+
+def analyse(index, pxl):
+    if pxl[0] == 255: return 0
+    else:
+        if index < 18 or index > 52: return 1
+        if 24 < index < 40: return 3
+        else: return 2
+
+
+def show():
+    img = Image.open("world.png")
+    data = np.array(img)
+
+    rslt = ""
+    for index, line in enumerate(data):
+        for pxl in line:
+            rslt += f"{analyse(index, pxl)}"
+        rslt += "\n"
+    print(rslt)
+
+
+def get_tabular():
+    img = Image.open("world.png")
+    data = np.array(img)
+
+    rslt = "const unsigned int world[64][128] =\n{"
+    for index, line in enumerate(data):
+        rslt += "\n    {"
+        for pxl in line:
+            rslt += f"{analyse(index, pxl)}, "
+        rslt = rslt[:-2] + "},"
+    rslt += "\n};"
+    print(rslt)
+
+
+get_tabular()
diff --git a/old assets/title.png b/old assets/title.png
new file mode 100644
index 0000000..f0beb69
Binary files /dev/null and b/old assets/title.png differ
diff --git a/old assets/world.png b/old assets/world.png
new file mode 100644
index 0000000..359c314
Binary files /dev/null and b/old assets/world.png differ
diff --git a/src/core.c b/src/core.c
index e66e00b..8777724 100644
--- a/src/core.c
+++ b/src/core.c
@@ -1,6 +1,10 @@
+#include <gint/timer.h>
+#include <gint/clock.h>
 #include <gint/keyboard.h>
 
 #include "core.h"
+#include "mutation_engine.h"
+#include "epidemic_engine.h"
 #include "display_engine.h"
 
 
@@ -40,18 +44,26 @@ void next_frame(struct game *current_game)
         }
     }
     current_game->time += ENGINE_TICK;
+    if (current_game->time > LIMIT_TICK)
+    {
+        current_game->time = 0;
+        if (current_game->dna <= 100) current_game->dna += 1;
+
+        current_game->research += current_game->priority;
+        if (current_game->research > current_game->limit)
+        {
+            const char *msg[5] = {"Vous avez", "perdu.", "", "", ""};
+            message(msg);
+            current_game->research = 0;
+        }
+        epidemic_simulation(current_game);
+    }
 }
 
 
 int get_inputs(const int background, int *mutation_menu)
 {
-    int opt = GETKEY_DEFAULT & ~GETKEY_REP_ARROWS;
-    int timeout = 1;
-
-    key_event_t ev = getkey_opt(opt, &timeout);
-    if(ev.type == KEYEV_NONE) return background;
-
-    int key = ev.key;
+    int key = rtc_key();
 
     if (key == KEY_OPTN && (background == 1 || background == 2)) return (background % 2) + 1;
     if (key == KEY_VARS) return 3;
@@ -61,7 +73,7 @@ int get_inputs(const int background, int *mutation_menu)
     {
         if (background == 5) return 3;
         if (background != 1 && background != 2) return 1;
-        if (background == 1) return -1;
+        if (background == 1 || background == 2) return -1;
     }
 
     if (background == 3)
@@ -98,15 +110,46 @@ int get_inputs(const int background, int *mutation_menu)
 }
 
 
-void manage_mutation(struct game *current_game, const int mutation_menu)
+int rtc_key(void)
 {
-    int key = 0, end = 0;
-    int cursor_x = 1, cursor_y = 1;
-    while (!end)
-    {
-        display_mutation(current_game, mutation_menu, cursor_x, cursor_y);
-        key = getkey().key;
-
-        if (key == KEY_EXIT) end = 1;
-    }
+    int opt = GETKEY_DEFAULT & ~GETKEY_REP_ARROWS;
+    int timeout = 1;
+        
+    key_event_t ev = getkey_opt(opt, &timeout);
+    if(ev.type == KEYEV_NONE) return 0;
+        
+    return ev.key;
 }
+
+
+int callback_tick(volatile int *tick)
+{
+    *tick = 1;
+    return TIMER_CONTINUE;
+}
+
+
+void message(const char *msg[5])
+{
+    display_message(msg);
+
+    int key = 0, frame = 1;
+
+    static volatile int tick = 1;
+    int t = timer_configure(TIMER_ANY, DNA_ANIMATION_TICK*1000, GINT_CALL(callback_tick, &tick));
+    if (t >= 0) timer_start(t);
+
+    while (!key)
+    {
+        while(!tick) sleep();
+        tick = 0;
+
+        key = rtc_key();
+        display_dna_animation(frame);
+
+        frame = (frame + 1) % 24;
+        if (!frame) frame = 24;
+    }
+
+    if (t >= 0) timer_stop(t);
+}
\ No newline at end of file
diff --git a/src/core.h b/src/core.h
index 5e09a34..66956ed 100644
--- a/src/core.h
+++ b/src/core.h
@@ -1,16 +1,27 @@
 #ifndef _PLAGUE_CORE_H
 #define _PLAGUE_CORE_H
 
+#include <gint/defs/types.h>
 
-// Duration for internal clock
+// Duration for internal clock (ms)
 #define ENGINE_TICK 50
+#define CURSOR_TICK 150
+#define DNA_ANIMATION_TICK 150
+
+// Duration for DNA points and infectious model (ms)
+#define LIMIT_TICK 10000
 
 // Number of planes on screen
 #define NB_PLANES 5
 
-// Number of humans
-#define TOTAL_POP 10000000000
+struct grid
+{    
+    // 64, 128
+    int height, width;
 
+    // Use grid.data[i + j * grid.width] instead of grid.data[i][j]
+    uint8_t *data;
+};
 
 // game : all statistics of the current game
 struct game
@@ -21,23 +32,26 @@ struct game
     // DNA points
     int dna;
 
-    // Mutations counts and sprite selected
-    int abilities, symptoms, transmissions;
-    int abilities_sel, symptoms_sel, transmissions_sel;
+    // Mutations counts, mutations selected, mutations bought (symptoms; abilities; transmissions)
+    int mutations_count[3];
+    int mutations_selected[3];
+    int mutations_bought[3][14];
 
     // Research data
-    int research, limit;
+    int research, limit, priority;
 
-    // Infectious pattern parameters
-    long long int healthy, infected, dead, cured;
+    // Humans stats : healthy, infected, dead, healed
+    int humans[4];
 
     // Time
     int time;
 
     // Planes
     struct plane *planes[NB_PLANES + 1];
-};
 
+    // Grid for epidemologic model
+    struct grid grid;
+};
 
 // plane : information about planes
 struct plane
@@ -51,29 +65,34 @@ struct plane
     // Coordinates of the plane's destination
     int dest_x, dest_y;
 
-    //Coordinates of the plane's departure
+    // Coordinates of the plane's departure
     int depa_x, depa_y;
 
 };
 
-
-// mutation : contain the map of the mutation available
-struct mutation_table
+//cursor : cursor information for mutations selection
+struct cursor
 {
-    // Data of the map
-    int data[4][8];
-};
+    // Cursor's coordinates
+    int x, y;
 
+    // If the cursor should be displayed
+    int display;
+};
 
 // get_inputs : detect and manage inputs
 int get_inputs(const int background, int *mutation_menu);
 
-
 // next_frame : compute the plane's positions
 void next_frame(struct game *current_game);
 
+// rtc_key : get the key with RTC system
+int rtc_key(void);
 
-// manage_mutation : an independant sub-programm which allow to select, buy and see the mutations.
-void manage_mutation(struct game *current_game, const int mutation_menu);
+// callback_timer : basic timer
+int callback_tick(volatile int *tick);
 
-#endif /* _PLAGUE_CORE_H */
\ No newline at end of file
+// message : display a message
+void message(const char *msg[5]);
+
+#endif /* _PLAGUE_CORE_H */
diff --git a/src/data.c b/src/data.c
new file mode 100644
index 0000000..24466b1
--- /dev/null
+++ b/src/data.c
@@ -0,0 +1,127 @@
+#include "mutation_engine.h"
+
+
+const struct mutation symptoms_data[14] =
+{
+    {1,  1,  0,  2, 0, "NAUSEE"},
+    {3,  2,  0,  4, 0, "VOMISSEMENT"},
+    {2,  1,  0,  3, 0, "TOUX"},
+    {2,  2,  0,  4, 0, "PNEUMONIE"},
+    {4,  2,  5, 15, 25, "TUMEUR"},
+    {2,  1,  0,  3, 0, "PLAIES"},
+    {5,  4,  0, 10, 0, "LESIONS"},
+    {5, 15, 15, 20, 30, "HEMORRAGIE"},
+    {6,  7,  6, 17, 0, "INFECTION"},
+    {2,  2,  2,  5, 0, "INFLAMMATION"},
+    {2,  6,  4, 12, 0, "IMMUNITE"},
+    {0,  4,  0,  5, 120, "PARANOIA"},
+    {6, 15,  0, 20, 100, "FOLIE"},
+    {0, 20, 25, 30, 250, "ARRET TOTAL"},
+};
+
+
+const struct mutation abilities_data[6] =
+{
+    {4,  0, 0, 10, 0, "FROID"},
+    {7,  0, 0, 15, 0, "CHAUD"},
+    {0,  5, 4, 25, 20, "GENETIQUE"},
+    {0,  8, 8, 30, 50, "MUTATION+"},
+    {10, 0, 0, 30, 0, "ENVIRON"},
+    {0,  2, 2, 15, 50, "MEDICAMENT"},
+};
+
+
+const struct mutation transmissions_data[13] =
+{
+    { 2, 0, 0,  9, 0, "AIR 1"},
+    { 5, 0, 0, 15, 0, "AIR 2"},
+    { 8, 0, 0, 20, 0, "AIR 3"},
+    {10, 0, 0, 30, 0, "AEROSOL"},
+    { 2, 0, 0,  9, 0, "EAU 1"},
+    { 4, 0, 0, 12, 0, "EAU 2"},
+    { 2, 0, 0, 10, 0, "ANIMAL 1"},
+    { 6, 0, 0, 16, 0, "ANIMAL 2"},
+    { 3, 0, 0, 12, 0, "OISEAU 1"},
+    { 6, 0, 0, 16, 0, "OISEAU 2"},
+    { 1, 0, 0,  8, 0, "SANG 1"},
+    { 4, 0, 0, 14, 0, "SANG 2"},
+    { 9, 1, 1, 20, 0, "SANG 3"},
+};
+
+
+const struct mutation default_value = {0, 0, 0, 0, 0, "NONE"};
+
+
+/* Encoded data for the world
+    0: water
+    1: low temperature
+    2: temperate
+    3: hot
+*/
+const uint8_t world[64][128] =
+{
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0},
+    {0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0},
+    {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0},
+    {0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
+    {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0},
+    {0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0},
+    {0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0},
+    {1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 0, 0, 3, 3, 3, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 0, 0, 0, 0, 0, 3, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 3, 3, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 3, 3, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 3, 0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 3, 3, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 0, 3, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 3, 3, 3, 3, 3, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 0, 0, 0, 3, 0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 0, 0, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 0, 3, 3, 0, 0, 0, 3, 0, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 0, 0, 0, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 3, 3, 3, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 3, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3, 0, 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 2, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2, 2, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 2, 2, 0, 0, 2, 2, 2, 2, 2, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+};
diff --git a/src/display_engine.c b/src/display_engine.c
index 4d4ac48..7bb4f05 100644
--- a/src/display_engine.c
+++ b/src/display_engine.c
@@ -1,6 +1,7 @@
 #include <gint/display.h>
+#include <math.h>
 
-#include "core.h"
+#include "mutation_engine.h"
 #include "display_engine.h"
 
 
@@ -15,22 +16,48 @@ void display_foreground(const int background, const struct game *current_game)
 {
     extern const bopti_image_t img_mutations;
     extern const bopti_image_t img_planes;
+    extern const uint8_t world[64][128];
+
     GUNUSED int length;
 
     switch (background)
     {
         case 1:
+
+            // Disease propagation
+            for (int i = 0; i < current_game->grid.width; i ++)
+            {
+                for (int j = 0; j < current_game->grid.height; j ++)
+                {
+                    if (current_game->grid.data[i + j * current_game->grid.width] == 1 && world[j][i] != 0) dpixel(i, j, C_BLACK);
+                }
+            }
+
+            // Planes animations
             for (int i = 0; current_game->planes[i]; i++)
             {
                 dsubimage(current_game->planes[i]->x - 4, current_game->planes[i]->y - 4, &img_planes, 0, 8 * (current_game->planes[i]->direction - 1), 8, 8, DIMAGE_NONE);
             }
             break;
+
         case 2:
-            for (int i = 0; current_game->planes[i]; i++)
+
+            // Disease propagation
+            for (int i = 0; i < current_game->grid.width; i ++)
             {
-                if (current_game->planes[i]->y + 8 < 53) dsubimage(current_game->planes[i]->x - 4, current_game->planes[i]->y - 4, &img_planes, 0, 8 * (current_game->planes[i]->direction - 1), 8, 8, DIMAGE_NONE);
+                for (int j = 0; j < 48; j ++)
+                {
+                    if (current_game->grid.data[i + j * current_game->grid.width] == 1 && world[j][i] != 0) dpixel(i, j, C_BLACK);
+                }
             }
 
+            // Planes animations
+            for (int i = 0; current_game->planes[i]; i++)
+            {
+                if (current_game->planes[i]->y + 8 < 57) dsubimage(current_game->planes[i]->x - 4, current_game->planes[i]->y - 4, &img_planes, 0, 8 * (current_game->planes[i]->direction - 1), 8, 8, DIMAGE_NONE);
+            }
+
+            // Status bottom bar 
             int length = 74 * current_game->research / current_game->limit;
             dprint(9, 58, C_BLACK, "%d", current_game->dna);
 
@@ -41,107 +68,95 @@ void display_foreground(const int background, const struct game *current_game)
         case 3:
             dprint(102, 37, C_BLACK, "%d", current_game->dna);
             
-            length = 67 * current_game->contagion / 26;
+            length = 67 * current_game->contagion / 100;
             dline(57, 48, 57 + length, 48, C_BLACK);
             dline(57, 49, 57 + length, 49, C_BLACK);
             
-            length = 67 * current_game->severity / 20;
+            length = 67 * current_game->severity / 100;
             dline(57, 54, 57 + length, 54, C_BLACK);
             dline(57, 55, 57 + length, 55, C_BLACK);
             
-            length = 67 * current_game->lethality / 33;
+            length = 67 * current_game->lethality / 100;
             dline(57, 60, 57 + length, 60, C_BLACK);
             dline(57, 61, 57 + length, 61, C_BLACK);
 
-            if (current_game->symptoms_sel) dsubimage(5, 15, &img_mutations, 0, 16 * (current_game->symptoms_sel - 1), 15, 15, 0);
-            if (current_game->abilities_sel) dsubimage(35, 15, &img_mutations, 16, 16 * (current_game->abilities_sel - 1), 15, 15, 0);
-            if (current_game->transmissions_sel) dsubimage(65, 15, &img_mutations, 32, 16 * (current_game->transmissions_sel - 1), 15, 15, 0);
+            if (current_game->mutations_selected[0]) dsubimage(5, 15, &img_mutations, 0, 16 * (current_game->mutations_selected[0] - 1), 15, 15, 0);
+            if (current_game->mutations_selected[1]) dsubimage(35, 15, &img_mutations, 16, 16 * (current_game->mutations_selected[1] - 1), 15, 15, 0);
+            if (current_game->mutations_selected[2]) dsubimage(65, 15, &img_mutations, 32, 16 * (current_game->mutations_selected[2] - 1), 15, 15, 0);
             break;
 
         case 6:
-            length = 63 *  current_game->healthy/ TOTAL_POP;
-            dline(61, 31, 61 + length, 31, C_BLACK);
-            dline(61, 32, 61 + length, 32, C_BLACK);
-            
-            length = 63 * current_game->infected / TOTAL_POP;
-            dline(61, 39, 61 + length, 39, C_BLACK);
-            dline(61, 40, 61 + length, 40, C_BLACK);
-            
-            length = 63 * current_game->dead / TOTAL_POP;
-            dline(61, 47, 61 + length, 47, C_BLACK);
-            dline(61, 48, 61 + length, 48, C_BLACK);
-            
-            length = 63 * current_game->cured / TOTAL_POP;
-            dline(61, 55, 61 + length, 55, C_BLACK);
-            dline(61, 56, 61 + length, 56, C_BLACK);
+            for (int i = 0; i < 4; i ++)
+            {
+                length = 63 * current_game->humans[i] / (current_game->grid.width * current_game->grid.height);
+                dline(61, i*8 + 31, 61 + length, i*8 + 31, C_BLACK);
+                dline(61, i*8 + 32, 61 + length, i*8 + 32, C_BLACK);
+            }
             break;
     }
 }
 
 
-void display_mutation(const struct game *current_game, const int mutation_menu, const int cursor_x, const int cursor_y)
+void display_mutation(const int table[4][8], const struct cursor c, const int mutation_menu)
 {
     extern const bopti_image_t img_mutations;
-    extern bopti_image_t img_piece;
-
-    // Load symptoms
-    extern struct mutation_table mt_symptoms_1;
-    extern struct mutation_table mt_symptoms_2;
-    extern struct mutation_table mt_symptoms_3;
-
-    // Load abilities
-    extern struct mutation_table mt_abilities_1;
-    extern struct mutation_table mt_abilities_2;
-    extern struct mutation_table mt_abilities_3;
-
-    // Load transmissions
-    extern struct mutation_table mt_transmissions_1;
-    extern struct mutation_table mt_transmissions_2;
-    extern struct mutation_table mt_transmissions_3;
-
-    int table[4][8];
-    if (mutation_menu == 1)
-    {   
-        if (current_game->symptoms < 4) init_mat(8, 4, table, mt_symptoms_1.data);
-        else if (current_game->symptoms < 8) init_mat(8, 4, table, mt_symptoms_2.data);
-        else init_mat(8, 4, table, mt_symptoms_3.data);
-    }
-
-    if (mutation_menu == 2)
-    {
-        if (current_game->abilities < 2) init_mat(8, 4, table, mt_abilities_1.data);
-        else if (current_game->abilities < 4) init_mat(8, 4, table, mt_abilities_2.data);
-        else init_mat(8, 4, table, mt_abilities_3.data);
-    }
-
-    if (mutation_menu == 3)
-    {
-        if (current_game->transmissions < 5) init_mat(8, 4, table, mt_transmissions_1.data);
-        else if (current_game->transmissions < 10) init_mat(8, 4, table, mt_transmissions_2.data);
-        else init_mat(8, 4, table, mt_transmissions_3.data);   
-    }
+    extern bopti_image_t img_cursor;
 
     dclear(C_WHITE);
+    display_background(5);
     for (int i = 0 ; i < 4 ; i++)
     {
         for (int j = 0 ; j < 8; j++)
         {
-            if (table[i][j]) dsubimage(i*16, j*16, &img_mutations, 16 * (mutation_menu - 1), 0, 16 * (table[i][j] - 1), 15, 15);
+            if (table[i][j]) dsubimage(j*16, i*16, &img_mutations, 16 * (mutation_menu - 1), 16 * (table[i][j] - 1), 15, 15, DIMAGE_NONE);
         }
     }
-    dimage(16 * (cursor_x - 1), 16 * (cursor_y - 1), &img_piece);
+    dsubimage((16 * c.x) - 1, (16 * c.y) - 1, &img_cursor, 0, 17 * (c.display), 17, 17, DIMAGE_NONE);
     dupdate();
 
 }
 
 
-void init_mat(int x, int y, int dest[][x], int src[][x])
+void display_mutation_buy(const struct cursor c, const int mutation_menu, const int table[4][8], const int button_selected, const struct game *current_game)
 {
-    for (int i = 0 ; i < x ; i++)
-    {
-        for (int j = 0 ; j < y ; j++)
-        {
-            dest[j][i] = src[j][i];
-        }
-    }
+    extern const bopti_image_t img_mutations;
+    const int id = table[c.y][c.x];
+
+    struct mutation *mutation_data = get_mutation_data(mutation_menu, id);
+    struct mutation *mutation_sel = get_mutation_data(mutation_menu, current_game->mutations_selected[mutation_menu - 1]);
+
+    dclear(C_WHITE);
+    
+    display_background(4);
+    dsubimage(3, 21, &img_mutations, 16 * (mutation_menu - 1), 16 * (id - 1), 15, 15, DIMAGE_NONE);
+
+    dprint(47, 25, C_BLACK, mutation_data->name);
+    dprint(81, 33, C_BLACK, "%d", mutation_data->dna);
+    dprint(81, 41, C_BLACK, "%d (%d)", mutation_data->contagion, mutation_data->contagion - mutation_sel->contagion);
+    dprint(81, 49, C_BLACK, "%d (%d)", mutation_data->severity, mutation_data->severity - mutation_sel->severity);
+    dprint(81, 57, C_BLACK, "%d (%d)", mutation_data->lethality, mutation_data->lethality - mutation_sel->lethality);
+
+    if (button_selected) drect(81, 2, 123, 8, C_INVERT);
+    else drect(81, 12, 123, 18, C_INVERT);
+
+    dupdate();
 }
+
+
+void display_message(const char *msg[5])
+{
+    dclear(C_WHITE);
+    display_background(7);
+    for (int i = 0; i < 5; i ++) dprint(54, 6 * i + 4, C_BLACK, msg[i]);
+    dupdate();
+}
+
+void display_dna_animation(const int frame)
+{
+    extern bopti_image_t img_dna;
+
+    dsubimage(114, 29, &img_dna, 11 * (frame - 1), 0, 11, 32, DIMAGE_NONE);
+    dupdate();
+}
+
+
diff --git a/src/display_engine.h b/src/display_engine.h
index 6ab6315..916e4f8 100644
--- a/src/display_engine.h
+++ b/src/display_engine.h
@@ -1,6 +1,8 @@
 #ifndef _PLAGUE_DISPLAY_ENGINE_H
 #define _PLAGUE_DISPLAY_ENGINE_H
 
+#include "core.h"
+
 // display_background : display the background
 void display_background(const int background);
 
@@ -8,9 +10,15 @@ void display_background(const int background);
 void display_foreground(const int background, const struct game *current_game);
 
 // display_mutation : display the mutation selection screen
-void display_mutation(const struct game *current_game, const int mutation_menu, const int cursor_x, const int cursor_y);
+void display_mutation(const int table[4][8], const struct cursor c, const int mutation_menu);
 
-// init_mat : copy src into dest
-void init_mat(int x, int y, int dest[][x], int src[][x]);
+// mutation_selected : display the mutation's informations screen
+void display_mutation_buy(const struct cursor c, const int mutation_menu, const int table[4][8], const int button_selected, const struct game *current_game);
+
+// output_error : display text and message background
+void display_message(const char *msg[5]);
+
+// display_dna_animation : display the DNA according to the frame number
+void display_dna_animation(const int frame);
 
 #endif /* _PLAGUE_DISPLAY_ENGINE_H */
\ No newline at end of file
diff --git a/src/epidemic_engine.c b/src/epidemic_engine.c
new file mode 100644
index 0000000..51ca43a
--- /dev/null
+++ b/src/epidemic_engine.c
@@ -0,0 +1,96 @@
+#include <gint/std/stdlib.h>
+
+#include "epidemic_engine.h"
+
+
+int grid_get(const struct grid epidemic_grid, const int i, const int j)
+{
+    if (i < 0 || j < 0 || i >= epidemic_grid.width || j >= epidemic_grid.height) return 0;
+    else return epidemic_grid.data[i + j * epidemic_grid.width];
+}
+
+
+bool can_become_infected(const struct grid epidemic_grid, const int mutations_selected[3], const int i, const int j)
+{
+    extern const uint8_t world[64][128];
+
+    // In case of water, low or high temperature
+    if (world[j][i] == 0 && mutations_selected[2] != 3) return false;
+    if (world[j][i] == 1 && mutations_selected[1] != 0 && mutations_selected[1] != 4) return false;
+    if (world[j][i] == 3 && mutations_selected[1] != 1 && mutations_selected[1] != 4) return false;
+    
+    // Test cases around
+    return grid_get(epidemic_grid, i - 1, j) == 1 || grid_get(epidemic_grid, i + 1, j) == 1 || grid_get(epidemic_grid, i, j - 1) == 1 || grid_get(epidemic_grid, i, j + 1) == 1;
+}
+
+
+bool bernoulli(const int p)
+{
+    return (rand() % 101) < p;
+}
+
+
+void epidemic_simulation(struct game *current_game)
+{
+    srand(15510);
+
+    // Create a copy of the epidemic grid
+    uint8_t *current_grid = calloc(current_game->grid.width * current_game->grid.height, sizeof(uint8_t));
+    init_tab(current_game->grid.width * current_game->grid.height, current_grid, current_game->grid.data);
+
+    int healed_rate =  100 * (current_game->research / current_game->limit);
+
+    // Make the epidemic grid evolove
+    for (int i = 0; i < current_game->grid.width; i ++)
+    {
+        for (int j = 0; j < current_game->grid.height; j ++)
+        {
+            switch (current_game->grid.data[i + j * current_game->grid.width])
+            {
+                // Healthy
+                case 0:
+
+                    // Become infected
+                    if (can_become_infected(current_game->grid, current_game->mutations_selected, i, j) && bernoulli(current_game->contagion))
+                    {
+                        current_grid[i + j * current_game->grid.width] = 1;
+                        current_game->humans[0] --;
+                        current_game->humans[1] ++;
+                    }
+                    break;
+
+                // Infected
+                case 1:
+
+                    // Become healed
+                    if (bernoulli(healed_rate))
+                    {
+                        current_grid[i + j * current_game->grid.width] = 2;
+                        current_game->humans[1] --;
+                        current_game->humans[2] ++;
+                    }
+
+                    // Become dead
+                    else if (bernoulli(current_game->lethality))
+                    {
+                        current_grid[i + j * current_game->grid.width] = 3;
+                        current_game->humans[1] --;
+                        current_game->humans[3] ++;
+                    }
+                    break;
+            }
+
+        }
+    }
+    init_tab(current_game->grid.width * current_game->grid.height, current_game->grid.data, current_grid);
+    free(current_grid);
+}
+
+
+void init_tab(int x, uint8_t dest[x], uint8_t src[x])
+{
+    for (int i = 0; i < x; i++)
+    {
+        dest[i] = src[i];
+    }
+}
\ No newline at end of file
diff --git a/src/epidemic_engine.h b/src/epidemic_engine.h
new file mode 100644
index 0000000..6ad86d3
--- /dev/null
+++ b/src/epidemic_engine.h
@@ -0,0 +1,21 @@
+#ifndef _EPIDEMIC_ENGINE_H
+#define _EPIDEMIC_ENGINE_H
+
+#include "core.h"
+
+// humans per case of the epidemic grid
+#define HUMANS_PER_CASE 1000000
+
+// can_become_infected : return 0 if the case (i, j) isn't infectable, 1 else
+bool can_become_infected(const struct grid epidemic_grid, const int mutations_selected[3], const int i, const int j);
+
+// bernoulli : simulate a random event
+bool bernoulli(const int p);
+
+// epidemic_simulation : simulate the propagation of the virus
+void epidemic_simulation(struct game *current_game);
+
+// init_tab : copy src into dest (for int)
+void init_tab(int x, uint8_t dest[x], uint8_t src[x]);
+
+#endif /* _EPIDEMIC_ENGINE_H */
\ No newline at end of file
diff --git a/src/main.c b/src/main.c
index abb3ba2..bbc5f77 100644
--- a/src/main.c
+++ b/src/main.c
@@ -1,16 +1,22 @@
 /*
-  Name : Plague
-  Version : - dev -
-  Last modification : 24 May 2021
+  Project name ......: Plague
+  Version ...........: - dev -
+  Last modification .: 29 May 2021
+
+  code and assets provided with licence :
+  GNU General Public Licence v3.0
 */
 
 #include <gint/display.h>
 #include <gint/keyboard.h>
 #include <gint/timer.h>
 #include <gint/clock.h>
+#include <gint/defs/types.h>
+#include <gint/std/stdlib.h>
 
 #include "core.h"
 #include "display_engine.h"
+#include "mutation_engine.h"
 
 
 // title_screen : display the title screen
@@ -19,9 +25,6 @@ static void title_screen(void);
 // main_loop : display background, foreground and manage inputs
 void main_loop(struct game *current_game);
 
-// callback_timer : basic timer
-int callback_tick(volatile int *tick);
-
 
 int main(void)
 {
@@ -30,13 +33,14 @@ int main(void)
 
     title_screen();
 
+    // Game statistics
     struct plane plane_1 = {22, 20, 2, 84, 20, 22, 20};
     struct plane plane_2 = {34, 20, 3, 34, 44, 34, 20};
     struct plane plane_3 = {68, 44, 1, 68, 20, 68, 44};
     struct plane plane_4 = {104, 20, 3, 104, 50, 104, 20};
     struct plane plane_5 = {68, 44, 4, 34, 44, 68, 44};
 
-    GUNUSED struct game current_game =
+    struct game current_game =
     {
         .contagion = 0,
         .severity = 0,
@@ -44,24 +48,39 @@ int main(void)
 
         .dna = 0,
 
-        .abilities = 1, .abilities_sel = 0,
-        .symptoms = 1, .symptoms_sel = 0,
-        .transmissions = 1, .transmissions_sel = 0,
+        .mutations_count = {0, 0, 0},
+        .mutations_selected = {0, 0, 0},
+        .mutations_bought = {{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}},
 
         .research = 0,
-        .limit = 100,
-
-        .healthy = TOTAL_POP - 1,
-        .infected = 1,
-        .dead = 0,
+        .limit = RESEARCH_LIMIT,
+        .priority = 0,
+        .humans = {0, 1, 0, 0},
 
         .time = 0,
 
-        .planes = {&plane_1, &plane_2, &plane_3, &plane_4, &plane_5, NULL}
+        .planes = {&plane_1, &plane_2, &plane_3, &plane_4, &plane_5, NULL},
+
+        .grid = {64, 128, NULL},
     };
 
+    /* allocate memory */
+    current_game.grid.data = calloc(current_game.grid.width * current_game.grid.height, sizeof(uint8_t));
+
+    if (current_game.grid.data == NULL)
+    {
+        const char *msg[5] = {"CALLOC", "FAILED", "", "", ""};
+        message(msg);
+    }
+
+    current_game.grid.data[95 + 20 * current_game.grid.width] = 1;
+    current_game.humans[0] = (current_game.grid.width * current_game.grid.height) - 1;
+
     main_loop(&current_game);
 
+    /* free memory */
+    free(current_game.grid.data);
+
     return 1;
 }
 
@@ -69,12 +88,63 @@ int main(void)
 static void title_screen(void)
 {
     extern bopti_image_t img_title;
+    extern bopti_image_t img_explosion;
 
-    dclear(C_WHITE);
-    dimage(0, 0, &img_title);
-    
+    static volatile int tick_5 = 1;
+    static volatile int tick_1 = 1;
+    int t_1 = timer_configure(TIMER_ANY, 500000, GINT_CALL(callback_tick, &tick_5));
+    int t_2 = timer_configure(TIMER_ANY, 100000, GINT_CALL(callback_tick, &tick_1));
+
+    if (t_1 >= 0) timer_start(t_1);
+    if (t_2 >= 0) timer_start(t_2);
+
+    dclear(C_BLACK);
     dupdate();
+    while (!tick_5) sleep();
+    tick_5 = 0;
+
+    dsubimage(0, 0, &img_title, 0, 0, 128, 64, DIMAGE_NONE);    
+    dupdate();
+    while (!tick_5) sleep();
+    tick_5 = 0;
+
+    for (int frame = 0; frame < 5; frame ++)
+    {
+        dclear(C_BLACK);
+        dsubimage(0, 0, &img_title, 0, 0, 128, 64, DIMAGE_NONE);
+        dsubimage(76, 9, &img_explosion, 41 * frame, 0, 40, 40, DIMAGE_NONE);
+        dupdate();
+        while (!tick_1) sleep();
+        tick_1 = 0;
+    }
+
+    dclear(C_BLACK);
+    dsubimage(0, 0, &img_title, 0, 65, 128, 64, DIMAGE_NONE);
+    dupdate();
+
+    for (int i = 0; i < 2; i ++)
+    {
+        while (!tick_5) sleep();
+        tick_5 = 0;
+    }
+
+    for (int i = 0; i < 5; i ++)
+    {
+        dclear(C_BLACK);
+        dsubimage(0, 0, &img_title, 0, ((i % 2) + 1) * 65, 128, 64, DIMAGE_NONE);
+        dupdate();
+        while (!tick_5) sleep();
+        tick_5 = 0;
+    }
+
+    dclear(C_BLACK);
+    dsubimage(0, 0, &img_title, 0, 130, 128, 64, DIMAGE_NONE);
+    dupdate();
+
     getkey();
+
+    if (t_1 >= 0) timer_stop(t_1);
+    if (t_2 >= 0) timer_stop(t_2);
 }
 
 
@@ -99,7 +169,7 @@ void main_loop(struct game *current_game)
         display_foreground(background, current_game);
         dupdate();
 
-        // Compute the motion of planes
+        // Compute the motion of planes, DNA points and infectious model
         next_frame(current_game);
         
         // Get inputs from the keyboard and manage it
@@ -109,7 +179,7 @@ void main_loop(struct game *current_game)
         if (background == -1) end = 1;
         if (background == 5)
         {
-            manage_mutation(current_game, mutation_menu);
+            mutation_select(current_game, mutation_menu);
             background = 3;
         }
     }
@@ -117,9 +187,3 @@ void main_loop(struct game *current_game)
     if (t >= 0) timer_stop(t);
 }
 
-
-int callback_tick(volatile int *tick)
-{
-    *tick = 1;
-    return TIMER_CONTINUE;
-}
diff --git a/src/mutation_engine.c b/src/mutation_engine.c
new file mode 100644
index 0000000..a3a2b60
--- /dev/null
+++ b/src/mutation_engine.c
@@ -0,0 +1,201 @@
+#include <gint/keyboard.h>
+#include <gint/timer.h>
+#include <gint/clock.h>
+#include <math.h>
+
+#include "mutation_engine.h"
+
+
+void get_mutation(const struct game *current_game, const int mutation_menu, int table[4][8])
+{
+    // Load symptoms
+    extern struct mutation_table mt_symptoms_1;
+    extern struct mutation_table mt_symptoms_2;
+    extern struct mutation_table mt_symptoms_3;
+
+    // Load abilities
+    extern struct mutation_table mt_abilities_1;
+    extern struct mutation_table mt_abilities_2;
+    extern struct mutation_table mt_abilities_3;
+
+    // Load transmissions
+    extern struct mutation_table mt_transmissions_1;
+    extern struct mutation_table mt_transmissions_2;
+    extern struct mutation_table mt_transmissions_3;
+
+    if (mutation_menu == 1)
+    {   
+        if (current_game->mutations_count[0] < 4) init_mat(8, 4, table, mt_symptoms_1.data);
+        else if (current_game->mutations_count[0] < 8) init_mat(8, 4, table, mt_symptoms_2.data);
+        else init_mat(8, 4, table, mt_symptoms_3.data);
+    }
+
+    if (mutation_menu == 2)
+    {
+        if (current_game->mutations_count[1] < 2) init_mat(8, 4, table, mt_abilities_1.data);
+        else if (current_game->mutations_count[1] < 4) init_mat(8, 4, table, mt_abilities_2.data);
+        else init_mat(8, 4, table, mt_abilities_3.data);
+    }
+
+    if (mutation_menu == 3)
+    {
+        if (current_game->mutations_count[2] < 5) init_mat(8, 4, table, mt_transmissions_1.data);
+        else if (current_game->mutations_count[2] < 10) init_mat(8, 4, table, mt_transmissions_2.data);
+        else init_mat(8, 4, table, mt_transmissions_3.data);   
+    }
+}
+
+
+void mutation_select(struct game *current_game, const int mutation_menu)
+{
+    int key = 0, end = 0;
+    struct cursor c = {0, 0, 0};
+
+    static volatile int tick = 1;
+    int t = timer_configure(TIMER_ANY, CURSOR_TICK*1000, GINT_CALL(callback_tick, &tick));
+    if (t >= 0) timer_start(t);
+
+
+    while (!end)
+    {   
+        // Cursor blinking gestion
+        while (!tick) sleep();
+        tick = 0;
+        c.display = (c.display + 1) % 2;
+
+        // Get and display the mutation menu
+        int table[4][8];
+        get_mutation(current_game, mutation_menu, table);
+        display_mutation(table, c, mutation_menu);
+        
+        // Get the key
+        key = rtc_key();
+        
+        // Manage input
+        if (key == KEY_EXIT) end = 1;
+        if (key == KEY_EXE && table[c.y][c.x] != 15 && table[c.y][c.x] != 0)
+        {
+            end = mutation_buy(current_game, c, mutation_menu, table);
+        }
+                    
+        if (key == KEY_LEFT && c.x > 0) c.x --;
+        if (key == KEY_RIGHT && c.x < 7) c.x ++;
+        if (key == KEY_UP && c.y > 0) c.y --;
+        if (key == KEY_DOWN && c.y < 3) c.y ++;
+    }
+    if (t >= 0) timer_stop(t);
+}
+
+
+int mutation_buy(struct game *current_game, const struct cursor c, const int mutation_menu, const int table[4][8])
+{
+    int button_selected = 1;
+    int key = 0, id = table[c.y][c.x];
+
+    struct mutation *mutation_data = get_mutation_data(mutation_menu, table[c.y][c.x]);
+
+    while (1)
+    {
+        display_mutation_buy(c, mutation_menu, table, button_selected, current_game);
+        key = getkey().key;
+
+        if (key == KEY_DOWN || key == KEY_UP) button_selected = (button_selected + 1) % 2;
+        if (key == KEY_EXIT) return 1;
+        if (key == KEY_EXE)
+        {
+            if (!button_selected) return 0;
+            else
+            {
+                // if the player has'nt bought this mutation yet
+                if (!current_game->mutations_bought[mutation_menu - 1][id - 1])
+                {
+                    // if the player has enought DNA points
+                    if (current_game->dna >= mutation_data->dna)
+                    {
+                        // Take DNA points and save the purchase
+                        current_game->dna = current_game->dna - mutation_data->dna;
+                        current_game->mutations_bought[mutation_menu - 1][id - 1] = 1;
+                        current_game->mutations_count[mutation_menu - 1] ++;
+                        current_game->mutations_selected[mutation_menu - 1] = id;
+
+                        // Update
+                        update_disease(current_game);
+                        const char *msg[5] = {"mutation", "achetee", "", "", ""};
+                        message(msg);
+                    }
+                    else {const char *msg[5] = {"achat", "impossible", "", "", ""}; message(msg);}
+                }
+
+                // if the player has already bought this mutation
+                else
+                {
+                    current_game->mutations_selected[mutation_menu - 1] = id;
+                    update_disease(current_game);
+                    const char *msg[5] = {"mutation", "selectionnee", "", "", ""};
+                    message(msg);
+                }
+                
+            }
+            return 1;
+        }
+    }
+    return 0;
+}
+
+
+void update_disease(struct game *current_game)
+{
+    struct mutation *symptom = get_mutation_data(1, current_game->mutations_selected[0]);
+    struct mutation *ability = get_mutation_data(2, current_game->mutations_selected[1]);
+    struct mutation *transmission = get_mutation_data(3, current_game->mutations_selected[2]);
+
+    // disease parameters
+    current_game->contagion = symptom->contagion + ability->contagion + transmission->contagion;
+    current_game->severity = symptom->severity + ability->severity + transmission->severity;
+    current_game->lethality = symptom->lethality + ability->lethality + transmission->lethality;
+    
+    // research parameters
+    current_game->limit = RESEARCH_LIMIT + symptom->changement + ability->changement + transmission->changement;
+    current_game->priority = floor((current_game->severity + current_game->lethality) / 2);
+}
+
+
+struct mutation *get_mutation_data(const int mutation_menu, const int id)
+{
+    extern struct mutation symptoms_data[14];
+    extern struct mutation abilities_data[6];
+    extern struct mutation transmissions_data[13];
+    extern struct mutation default_value;
+
+    if (!id) return &default_value;
+
+    struct mutation *mutation_data = &default_value;
+
+    switch (mutation_menu)
+    {
+        case 1:
+            mutation_data = &symptoms_data[id - 1];
+            break;
+
+        case 2:
+            mutation_data = &abilities_data[id - 1];
+            break;
+
+        case 3:
+            mutation_data = &transmissions_data[id - 1];
+            break;
+    }
+    return mutation_data;
+}
+
+
+void init_mat(int x, int y, int dest[][x], int src[][x])
+{
+    for (int i = 0; i < x; i++)
+    {
+        for (int j = 0; j < y; j++)
+        {
+            dest[j][i] = src[j][i];
+        }
+    }
+}
\ No newline at end of file
diff --git a/src/mutation_engine.h b/src/mutation_engine.h
new file mode 100644
index 0000000..b8d22d1
--- /dev/null
+++ b/src/mutation_engine.h
@@ -0,0 +1,45 @@
+#ifndef _MUTATION_ENGINE_H
+#define _MUTATION_ENGINE_H
+
+#include "core.h"
+#include "display_engine.h"
+
+// Basic limit research
+#define RESEARCH_LIMIT 100
+
+// mutation_table : contain the map of the mutation available
+struct mutation_table
+{
+    // Data of the map
+    int data[4][8];
+};
+
+// mutation : data about a mutation
+struct mutation
+{
+    // Data of the mutation : contagion, lethality, severity, DNA cost
+    int contagion, severity, lethality, dna, changement;
+
+    // Name of the mutation
+    char *name;
+};
+
+// get_mutation : return the mutation table to display
+void get_mutation(const struct game *current_game, const int mutation_menu, int table[4][8]);
+
+// manage_mutation : an independant sub-programm which allow to select and see the mutations.
+void mutation_select(struct game *current_game, const int mutation_menu);
+
+// mutation_buy : UI interface to buy mutations and see informations on them
+int mutation_buy(struct game *current_game, const struct cursor c, const int mutation_menu, const int table[4][8]);
+
+// update_disease : update the disease parameters
+void update_disease(struct game *current_game);
+
+// get_mutation_data : get the information from a mutation
+struct mutation * get_mutation_data(const int mutation_menu, const int id);
+
+// init_mat : copy src into dest (for int)
+void init_mat(int x, int y, int dest[][x], int src[][x]);
+
+#endif /* _MUTATION_ENGINE_H */
\ No newline at end of file