├── LICENSE ├── README.md └── flappyBird ├── ConnectionGene.js ├── ConnectionHistory.js ├── GENOME.JS ├── Ground.js ├── Node.js ├── Pipe.js ├── PipePair.js ├── Population.js ├── Species.js ├── images ├── Untitled-3.psd ├── background.png ├── bird.png ├── christmasberd.png ├── fatBird.png ├── full pipe bottom.png ├── full pipe top.png ├── groundPiece.png ├── photoshoip thing 1.psd ├── pipeHead0000.png └── shaft0000.png ├── index.html ├── libraries ├── p5.dom.js ├── p5.js └── p5.sound.js ├── player.js └── sketch.js /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Flappy-Bird-AI -------------------------------------------------------------------------------- /flappyBird/ConnectionGene.js: -------------------------------------------------------------------------------- 1 | //a connection between 2 nodes 2 | class connectionGene { 3 | constructor(from, to, w, inno) { 4 | this.fromNode = from; 5 | this.toNode = to; 6 | this.weight = w; 7 | this.enabled = true; 8 | this.innovationNo = inno; //each connection is given a innovation number to compare genomes 9 | 10 | } 11 | 12 | //--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 13 | //changes the this.weight 14 | mutateWeight() { 15 | var rand2 = random(1); 16 | if (rand2 < 0.1) { //10% of the time completely change the this.weight 17 | this.weight = random(-1, 1); 18 | } else { //otherwise slightly change it 19 | this.weight += (randomGaussian() / 50); 20 | //keep this.weight between bounds 21 | if (this.weight > 1) { 22 | this.weight = 1; 23 | } 24 | if (this.weight < -1) { 25 | this.weight = -1; 26 | 27 | } 28 | } 29 | } 30 | 31 | //---------------------------------------------------------------------------------------------------------- 32 | //returns a copy of this connectionGene 33 | clone(from, to) { 34 | var clone = new connectionGene(from, to, this.weight, this.innovationNo); 35 | clone.enabled = this.enabled; 36 | 37 | return clone; 38 | } 39 | } 40 | -------------------------------------------------------------------------------- /flappyBird/ConnectionHistory.js: -------------------------------------------------------------------------------- 1 | class connectionHistory { 2 | constructor(from, to, inno, innovationNos) { 3 | this.fromNode = from; 4 | this.toNode = to; 5 | this.innovationNumber = inno; 6 | this.innovationNumbers = []; //the innovation Numbers from the connections of the genome which first had this mutation 7 | //this represents the genome and allows us to test if another genoeme is the same 8 | //this is before this connection was added 9 | arrayCopy(innovationNos, this.innovationNumbers); //copy (from, to) 10 | } 11 | 12 | //---------------------------------------------------------------------------------------------------------------- 13 | //returns whether the genome matches the original genome and the connection is between the same nodes 14 | matches(genome, from, to) { 15 | if (genome.genes.length === this.innovationNumbers.length) { //if the number of connections are different then the genoemes aren't the same 16 | if (from.number === this.fromNode && to.number === this.toNode) { 17 | //next check if all the innovation numbers match from the genome 18 | for (var i = 0; i < genome.genes.length; i++) { 19 | if (!this.innovationNumbers.includes(genome.genes[i].innovationNo)) { 20 | return false; 21 | } 22 | } 23 | //if reached this far then the innovationNumbers match the genes innovation numbers and the connection is between the same nodes 24 | //so it does match 25 | return true; 26 | } 27 | } 28 | return false; 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /flappyBird/GENOME.JS: -------------------------------------------------------------------------------- 1 | class Genome { 2 | constructor(inputs, outputs, crossover) { 3 | this.genes = []; //a list of connections between this.nodes which represent the NN 4 | this.nodes = []; 5 | this.inputs = inputs; 6 | this.outputs = outputs; 7 | this.layers = 2; 8 | this.nextNode = 0; 9 | // this.biasNode; 10 | this.network = []; //a list of the this.nodes in the order that they need to be considered in the NN 11 | //create input this.nodes 12 | 13 | if (crossover) { 14 | return; 15 | } 16 | 17 | for (var i = 0; i < this.inputs; i++) { 18 | this.nodes.push(new Node(i)); 19 | this.nextNode++; 20 | this.nodes[i].layer = 0; 21 | } 22 | 23 | //create output this.nodes 24 | for (var i = 0; i < this.outputs; i++) { 25 | this.nodes.push(new Node(i + this.inputs)); 26 | this.nodes[i + this.inputs].layer = 1; 27 | this.nextNode++; 28 | } 29 | 30 | this.nodes.push(new Node(this.nextNode)); //bias node 31 | this.biasNode = this.nextNode; 32 | this.nextNode++; 33 | this.nodes[this.biasNode].layer = 0; 34 | 35 | 36 | 37 | } 38 | 39 | 40 | fullyConnect(innovationHistory) { 41 | 42 | //this will be a new number if no identical genome has mutated in the same 43 | 44 | for (var i = 0; i < this.inputs; i++) { 45 | for (var j = 0; j < this.outputs; j++) { 46 | var connectionInnovationNumber = this.getInnovationNumber(innovationHistory, this.nodes[i], this.nodes[this.nodes.length - j - 2]); 47 | this.genes.push(new connectionGene(this.nodes[i], this.nodes[this.nodes.length - j - 2], random(-1, 1), connectionInnovationNumber)); 48 | } 49 | } 50 | 51 | var connectionInnovationNumber = this.getInnovationNumber(innovationHistory, this.nodes[this.biasNode], this.nodes[this.nodes.length - 2]); 52 | this.genes.push(new connectionGene(this.nodes[this.biasNode], this.nodes[this.nodes.length - 2], random(-1, 1), connectionInnovationNumber)); 53 | // 54 | // connectionInnovationNumber = this.getInnovationNumber(innovationHistory, this.nodes[this.biasNode], this.nodes[this.nodes.length - 3]); 55 | // this.genes.push(new connectionGene(this.nodes[this.biasNode], this.nodes[this.nodes.length - 3], random(-1, 1), connectionInnovationNumber)); 56 | // //add the connection with a random array 57 | 58 | 59 | //changed this so if error here 60 | this.connectNodes(); 61 | } 62 | 63 | 64 | 65 | //------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 66 | //returns the node with a matching number 67 | //sometimes the this.nodes will not be in order 68 | getNode(nodeNumber) { 69 | for (var i = 0; i < this.nodes.length; i++) { 70 | if (this.nodes[i].number == nodeNumber) { 71 | return this.nodes[i]; 72 | } 73 | } 74 | return null; 75 | } 76 | 77 | 78 | //--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 79 | //adds the conenctions going out of a node to that node so that it can acess the next node during feeding forward 80 | connectNodes() { 81 | 82 | for (var i = 0; i < this.nodes.length; i++) { //clear the connections 83 | this.nodes[i].outputConnections = []; 84 | } 85 | 86 | for (var i = 0; i < this.genes.length; i++) { //for each connectionGene 87 | this.genes[i].fromNode.outputConnections.push(this.genes[i]); //add it to node 88 | } 89 | } 90 | 91 | //--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 92 | //feeding in input values varo the NN and returning output array 93 | feedForward(inputValues) { 94 | //set the outputs of the input this.nodes 95 | for (var i = 0; i < this.inputs; i++) { 96 | this.nodes[i].outputValue = inputValues[i]; 97 | } 98 | this.nodes[this.biasNode].outputValue = 1; //output of bias is 1 99 | 100 | for (var i = 0; i < this.network.length; i++) { //for each node in the network engage it(see node class for what this does) 101 | this.network[i].engage(); 102 | } 103 | 104 | //the outputs are this.nodes[inputs] to this.nodes [inputs+outputs-1] 105 | var outs = []; 106 | for (var i = 0; i < this.outputs; i++) { 107 | outs[i] = this.nodes[this.inputs + i].outputValue; 108 | } 109 | 110 | for (var i = 0; i < this.nodes.length; i++) { //reset all the this.nodes for the next feed forward 111 | this.nodes[i].inputSum = 0; 112 | } 113 | 114 | return outs; 115 | } 116 | 117 | //---------------------------------------------------------------------------------------------------------------------------------------- 118 | //sets up the NN as a list of this.nodes in order to be engaged 119 | 120 | generateNetwork() { 121 | this.connectNodes(); 122 | this.network = []; 123 | //for each layer add the node in that layer, since layers cannot connect to themselves there is no need to order the this.nodes within a layer 124 | 125 | for (var l = 0; l < this.layers; l++) { //for each layer 126 | for (var i = 0; i < this.nodes.length; i++) { //for each node 127 | if (this.nodes[i].layer == l) { //if that node is in that layer 128 | this.network.push(this.nodes[i]); 129 | } 130 | } 131 | } 132 | } 133 | //----------------------------------------------------------------------------------------------------------------------------------------- 134 | //mutate the NN by adding a new node 135 | //it does this by picking a random connection and disabling it then 2 new connections are added 136 | //1 between the input node of the disabled connection and the new node 137 | //and the other between the new node and the output of the disabled connection 138 | addNode(innovationHistory) { 139 | //pick a random connection to create a node between 140 | if (this.genes.length == 0) { 141 | this.addConnection(innovationHistory); 142 | return; 143 | } 144 | var randomConnection = floor(random(this.genes.length)); 145 | 146 | while (this.genes[randomConnection].fromNode == this.nodes[this.biasNode] && this.genes.length != 1) { //dont disconnect bias 147 | randomConnection = floor(random(this.genes.length)); 148 | } 149 | 150 | this.genes[randomConnection].enabled = false; //disable it 151 | 152 | var newNodeNo = this.nextNode; 153 | this.nodes.push(new Node(newNodeNo)); 154 | this.nextNode++; 155 | //add a new connection to the new node with a weight of 1 156 | var connectionInnovationNumber = this.getInnovationNumber(innovationHistory, this.genes[randomConnection].fromNode, this.getNode(newNodeNo)); 157 | this.genes.push(new connectionGene(this.genes[randomConnection].fromNode, this.getNode(newNodeNo), 1, connectionInnovationNumber)); 158 | 159 | 160 | connectionInnovationNumber = this.getInnovationNumber(innovationHistory, this.getNode(newNodeNo), this.genes[randomConnection].toNode); 161 | //add a new connection from the new node with a weight the same as the disabled connection 162 | this.genes.push(new connectionGene(this.getNode(newNodeNo), this.genes[randomConnection].toNode, this.genes[randomConnection].weight, connectionInnovationNumber)); 163 | this.getNode(newNodeNo).layer = this.genes[randomConnection].fromNode.layer + 1; 164 | 165 | 166 | connectionInnovationNumber = this.getInnovationNumber(innovationHistory, this.nodes[this.biasNode], this.getNode(newNodeNo)); 167 | //connect the bias to the new node with a weight of 0 168 | this.genes.push(new connectionGene(this.nodes[this.biasNode], this.getNode(newNodeNo), 0, connectionInnovationNumber)); 169 | 170 | //if the layer of the new node is equal to the layer of the output node of the old connection then a new layer needs to be created 171 | //more accurately the layer numbers of all layers equal to or greater than this new node need to be incrimented 172 | if (this.getNode(newNodeNo).layer == this.genes[randomConnection].toNode.layer) { 173 | for (var i = 0; i < this.nodes.length - 1; i++) { //dont include this newest node 174 | if (this.nodes[i].layer >= this.getNode(newNodeNo).layer) { 175 | this.nodes[i].layer++; 176 | } 177 | } 178 | this.layers++; 179 | } 180 | this.connectNodes(); 181 | } 182 | 183 | //------------------------------------------------------------------------------------------------------------------ 184 | //adds a connection between 2 this.nodes which aren't currently connected 185 | addConnection(innovationHistory) { 186 | //cannot add a connection to a fully connected network 187 | if (this.fullyConnected()) { 188 | console.log("connection failed"); 189 | return; 190 | } 191 | 192 | 193 | //get random this.nodes 194 | var randomNode1 = floor(random(this.nodes.length)); 195 | var randomNode2 = floor(random(this.nodes.length)); 196 | while (this.randomConnectionNodesAreShit(randomNode1, randomNode2)) { //while the random this.nodes are no good 197 | //get new ones 198 | randomNode1 = floor(random(this.nodes.length)); 199 | randomNode2 = floor(random(this.nodes.length)); 200 | } 201 | var temp; 202 | if (this.nodes[randomNode1].layer > this.nodes[randomNode2].layer) { //if the first random node is after the second then switch 203 | temp = randomNode2; 204 | randomNode2 = randomNode1; 205 | randomNode1 = temp; 206 | } 207 | 208 | //get the innovation number of the connection 209 | //this will be a new number if no identical genome has mutated in the same way 210 | var connectionInnovationNumber = this.getInnovationNumber(innovationHistory, this.nodes[randomNode1], this.nodes[randomNode2]); 211 | //add the connection with a random array 212 | 213 | this.genes.push(new connectionGene(this.nodes[randomNode1], this.nodes[randomNode2], random(-1, 1), connectionInnovationNumber)); //changed this so if error here 214 | this.connectNodes(); 215 | } 216 | //------------------------------------------------------------------------------------------------------------------------------------------- 217 | randomConnectionNodesAreShit(r1, r2) { 218 | if (this.nodes[r1].layer == this.nodes[r2].layer) return true; // if the this.nodes are in the same layer 219 | if (this.nodes[r1].isConnectedTo(this.nodes[r2])) return true; //if the this.nodes are already connected 220 | 221 | 222 | 223 | return false; 224 | } 225 | 226 | //------------------------------------------------------------------------------------------------------------------------------------------- 227 | //returns the innovation number for the new mutation 228 | //if this mutation has never been seen before then it will be given a new unique innovation number 229 | //if this mutation matches a previous mutation then it will be given the same innovation number as the previous one 230 | getInnovationNumber(innovationHistory, from, to) { 231 | var isNew = true; 232 | var connectionInnovationNumber = nextConnectionNo; 233 | for (var i = 0; i < innovationHistory.length; i++) { //for each previous mutation 234 | if (innovationHistory[i].matches(this, from, to)) { //if match found 235 | isNew = false; //its not a new mutation 236 | connectionInnovationNumber = innovationHistory[i].innovationNumber; //set the innovation number as the innovation number of the match 237 | break; 238 | } 239 | } 240 | 241 | if (isNew) { //if the mutation is new then create an arrayList of varegers representing the current state of the genome 242 | var innoNumbers = []; 243 | for (var i = 0; i < this.genes.length; i++) { //set the innovation numbers 244 | innoNumbers.push(this.genes[i].innovationNo); 245 | } 246 | 247 | //then add this mutation to the innovationHistory 248 | innovationHistory.push(new connectionHistory(from.number, to.number, connectionInnovationNumber, innoNumbers)); 249 | nextConnectionNo++; 250 | } 251 | return connectionInnovationNumber; 252 | } 253 | //---------------------------------------------------------------------------------------------------------------------------------------- 254 | 255 | //returns whether the network is fully connected or not 256 | fullyConnected() { 257 | 258 | var maxConnections = 0; 259 | var nodesInLayers = []; //array which stored the amount of this.nodes in each layer 260 | for (var i = 0; i < this.layers; i++) { 261 | nodesInLayers[i] = 0; 262 | } 263 | //populate array 264 | for (var i = 0; i < this.nodes.length; i++) { 265 | nodesInLayers[this.nodes[i].layer] += 1; 266 | } 267 | //for each layer the maximum amount of connections is the number in this layer * the number of this.nodes infront of it 268 | //so lets add the max for each layer together and then we will get the maximum amount of connections in the network 269 | for (var i = 0; i < this.layers - 1; i++) { 270 | var nodesInFront = 0; 271 | for (var j = i + 1; j < this.layers; j++) { //for each layer infront of this layer 272 | nodesInFront += nodesInLayers[j]; //add up this.nodes 273 | } 274 | 275 | maxConnections += nodesInLayers[i] * nodesInFront; 276 | } 277 | if (maxConnections <= this.genes.length) { //if the number of connections is equal to the max number of connections possible then it is full 278 | return true; 279 | } 280 | 281 | return false; 282 | } 283 | 284 | 285 | //------------------------------------------------------------------------------------------------------------------------------- 286 | //mutates the genome 287 | mutate(innovationHistory) { 288 | if (this.genes.length == 0) { 289 | this.addConnection(innovationHistory); 290 | } 291 | 292 | 293 | var rand1 = random(1); 294 | if (rand1 < 0.8) { // 80% of the time mutate weights 295 | 296 | for (var i = 0; i < this.genes.length; i++) { 297 | this.genes[i].mutateWeight(); 298 | } 299 | } 300 | 301 | //5% of the time add a new connection 302 | var rand2 = random(1); 303 | if (rand2 < 0.05) { 304 | 305 | this.addConnection(innovationHistory); 306 | } 307 | 308 | //1% of the time add a node 309 | var rand3 = random(1); 310 | if (rand3 < 0.01) { 311 | 312 | this.addNode(innovationHistory); 313 | } 314 | } 315 | 316 | //--------------------------------------------------------------------------------------------------------------------------------- 317 | //called when this Genome is better that the other parent 318 | crossover(parent2) { 319 | var child = new Genome(this.inputs, this.outputs, true); 320 | child.genes = []; 321 | child.nodes = []; 322 | child.layers = this.layers; 323 | child.nextNode = this.nextNode; 324 | child.biasNode = this.biasNode; 325 | var childGenes = []; // new ArrayList();//list of genes to be inherrited form the parents 326 | var isEnabled = []; // new ArrayList(); 327 | //all inherited genes 328 | for (var i = 0; i < this.genes.length; i++) { 329 | var setEnabled = true; //is this node in the chlid going to be enabled 330 | 331 | var parent2gene = this.matchingGene(parent2, this.genes[i].innovationNo); 332 | if (parent2gene != -1) { //if the genes match 333 | if (!this.genes[i].enabled || !parent2.genes[parent2gene].enabled) { //if either of the matching genes are disabled 334 | 335 | if (random(1) < 0.75) { //75% of the time disabel the childs gene 336 | setEnabled = false; 337 | } 338 | } 339 | var rand = random(1); 340 | if (rand < 0.5) { 341 | childGenes.push(this.genes[i]); 342 | 343 | //get gene from this fucker 344 | } else { 345 | //get gene from parent2 346 | childGenes.push(parent2.genes[parent2gene]); 347 | } 348 | } else { //disjoint or excess gene 349 | childGenes.push(this.genes[i]); 350 | setEnabled = this.genes[i].enabled; 351 | } 352 | isEnabled.push(setEnabled); 353 | } 354 | 355 | 356 | //since all excess and disjovar genes are inherrited from the more fit parent (this Genome) the childs structure is no different from this parent | with exception of dormant connections being enabled but this wont effect this.nodes 357 | //so all the this.nodes can be inherrited from this parent 358 | for (var i = 0; i < this.nodes.length; i++) { 359 | child.nodes.push(this.nodes[i].clone()); 360 | } 361 | 362 | //clone all the connections so that they connect the childs new this.nodes 363 | 364 | for (var i = 0; i < childGenes.length; i++) { 365 | child.genes.push(childGenes[i].clone(child.getNode(childGenes[i].fromNode.number), child.getNode(childGenes[i].toNode.number))); 366 | child.genes[i].enabled = isEnabled[i]; 367 | } 368 | 369 | child.connectNodes(); 370 | return child; 371 | } 372 | 373 | //---------------------------------------------------------------------------------------------------------------------------------------- 374 | //returns whether or not there is a gene matching the input innovation number in the input genome 375 | matchingGene(parent2, innovationNumber) { 376 | for (var i = 0; i < parent2.genes.length; i++) { 377 | if (parent2.genes[i].innovationNo == innovationNumber) { 378 | return i; 379 | } 380 | } 381 | return -1; //no matching gene found 382 | } 383 | //---------------------------------------------------------------------------------------------------------------------------------------- 384 | //prints out info about the genome to the console 385 | printGenome() { 386 | console.log("Prvar genome layers:" + this.layers); 387 | console.log("bias node: " + this.biasNode); 388 | console.log("this.nodes"); 389 | for (var i = 0; i < this.nodes.length; i++) { 390 | console.log(this.nodes[i].number + ","); 391 | } 392 | console.log("Genes"); 393 | for (var i = 0; i < this.genes.length; i++) { //for each connectionGene 394 | console.log("gene " + this.genes[i].innovationNo + "From node " + this.genes[i].fromNode.number + "To node " + this.genes[i].toNode.number + 395 | "is enabled " + this.genes[i].enabled + "from layer " + this.genes[i].fromNode.layer + "to layer " + this.genes[i].toNode.layer + "weight: " + this.genes[i].weight); 396 | } 397 | 398 | console.log(); 399 | } 400 | 401 | //---------------------------------------------------------------------------------------------------------------------------------------- 402 | //returns a copy of this genome 403 | clone() { 404 | 405 | var clone = new Genome(this.inputs, this.outputs, true); 406 | 407 | for (var i = 0; i < this.nodes.length; i++) { //copy this.nodes 408 | clone.nodes.push(this.nodes[i].clone()); 409 | } 410 | 411 | //copy all the connections so that they connect the clone new this.nodes 412 | 413 | for (var i = 0; i < this.genes.length; i++) { //copy genes 414 | clone.genes.push(this.genes[i].clone(clone.getNode(this.genes[i].fromNode.number), clone.getNode(this.genes[i].toNode.number))); 415 | } 416 | 417 | clone.layers = this.layers; 418 | clone.nextNode = this.nextNode; 419 | clone.biasNode = this.biasNode; 420 | clone.connectNodes(); 421 | 422 | return clone; 423 | } 424 | //---------------------------------------------------------------------------------------------------------------------------------------- 425 | //draw the genome on the screen 426 | drawGenome(startX, startY, w, h) { 427 | //i know its ugly but it works (and is not that important) so I'm not going to mess with it 428 | var allNodes = []; //new ArrayList>(); 429 | var nodePoses = []; // new ArrayList(); 430 | var nodeNumbers = []; // new ArrayList(); 431 | 432 | //get the positions on the screen that each node is supposed to be in 433 | 434 | 435 | //split the this.nodes varo layers 436 | for (var i = 0; i < this.layers; i++) { 437 | var temp = []; // new ArrayList(); 438 | for (var j = 0; j < this.nodes.length; j++) { //for each node 439 | if (this.nodes[j].layer == i) { //check if it is in this layer 440 | temp.push(this.nodes[j]); //add it to this layer 441 | } 442 | } 443 | allNodes.push(temp); //add this layer to all this.nodes 444 | } 445 | 446 | //for each layer add the position of the node on the screen to the node posses arraylist 447 | for (var i = 0; i < this.layers; i++) { 448 | fill(255, 0, 0); 449 | var x = startX + float((i + 1.0) * w) / float(this.layers + 1.0); 450 | for (var j = 0; j < allNodes[i].length; j++) { //for the position in the layer 451 | var y = startY + float((j + 1.0) * h) / float(allNodes[i].length + 1.0); 452 | nodePoses.push(createVector(x, y)); 453 | nodeNumbers.push(allNodes[i][j].number); 454 | } 455 | } 456 | 457 | //draw connections 458 | stroke(0); 459 | strokeWeight(2); 460 | for (var i = 0; i < this.genes.length; i++) { 461 | if (this.genes[i].enabled) { 462 | stroke(0); 463 | } else { 464 | stroke(100); 465 | } 466 | var from; 467 | var to; 468 | from = nodePoses[nodeNumbers.indexOf(this.genes[i].fromNode.number)]; 469 | to = nodePoses[nodeNumbers.indexOf(this.genes[i].toNode.number)]; 470 | if (this.genes[i].weight > 0) { 471 | stroke(255, 0, 0); 472 | } else { 473 | stroke(0, 0, 255); 474 | } 475 | strokeWeight(map(abs(this.genes[i].weight), 0, 1, 0, 3)); 476 | line(from.x, from.y, to.x, to.y); 477 | } 478 | 479 | //draw this.nodes last so they appear ontop of the connection lines 480 | for (var i = 0; i < nodePoses.length; i++) { 481 | fill(255); 482 | stroke(0); 483 | strokeWeight(1); 484 | ellipse(nodePoses[i].x, nodePoses[i].y, 20, 20); 485 | textSize(10); 486 | fill(0); 487 | textAlign(CENTER, CENTER); 488 | text(nodeNumbers[i], nodePoses[i].x, nodePoses[i].y); 489 | 490 | } 491 | 492 | // print out neural network info text 493 | // textAlign(RIGHT); 494 | // fill(255); 495 | // textSize(15); 496 | // noStroke(); 497 | // text("car angle", nodePoses[0].x - 20, nodePoses[0].y); 498 | // text("touching ground", nodePoses[1].x - 20, nodePoses[1].y); 499 | // text("angular velocity", nodePoses[2].x - 20, nodePoses[2].y); 500 | // text("Distance to ground", nodePoses[3].x - 20, nodePoses[3].y); 501 | // text("gradient", nodePoses[4].x - 20, nodePoses[4].y); 502 | // text("bias", nodePoses[5].x - 20, nodePoses[5].y); 503 | // textAlign(LEFT); 504 | // text("gas", nodePoses[nodePoses.length - 2].x + 20, nodePoses[nodePoses.length - 2].y); 505 | // text("break", nodePoses[nodePoses.length - 1].x + 20, nodePoses[nodePoses.length - 1].y); 506 | 507 | 508 | 509 | } 510 | } 511 | -------------------------------------------------------------------------------- /flappyBird/Ground.js: -------------------------------------------------------------------------------- 1 | class Ground { 2 | 3 | constructor() { 4 | this.height = 30; 5 | this.topPixelCoord = canvas.height - this.height; 6 | this.pixelOffset = 0; 7 | 8 | } 9 | 10 | show() { 11 | fill(0); 12 | rect(0, this.topPixelCoord, canvas.width, this.height); 13 | for (var i = this.pixelOffset; i < canvas.width; i += groundSprite.width) { 14 | image(groundSprite, i, this.topPixelCoord); 15 | } 16 | } 17 | 18 | 19 | 20 | update() { 21 | this.pixelOffset -= panSpeed; 22 | if (this.pixelOffset <= -groundSprite.width) { 23 | this.pixelOffset += groundSprite.width; 24 | } 25 | 26 | 27 | } 28 | 29 | collided(p) { 30 | return p.y + p.size / 2 >= this.topPixelCoord; 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /flappyBird/Node.js: -------------------------------------------------------------------------------- 1 | class Node { 2 | 3 | constructor(no) { 4 | this.number = no; 5 | this.inputSum = 0; //current sum i.e. before activation 6 | this.outputValue = 0; //after activation function is applied 7 | this.outputConnections = []; //new ArrayList(); 8 | this.layer = 0; 9 | this.drawPos = createVector(); 10 | } 11 | 12 | //--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 13 | //the node sends its output to the inputs of the nodes its connected to 14 | engage() { 15 | if(this.layer != 0) { //no sigmoid for the inputs and bias 16 | this.outputValue = this.sigmoid(this.inputSum); 17 | } 18 | 19 | for(var i = 0; i < this.outputConnections.length; i++) { //for each connection 20 | if(this.outputConnections[i].enabled) { //dont do shit if not enabled 21 | this.outputConnections[i].toNode.inputSum += this.outputConnections[i].weight * this.outputValue; //add the weighted output to the sum of the inputs of whatever node this node is connected to 22 | } 23 | } 24 | } 25 | //---------------------------------------------------------------------------------------------------------------------------------------- 26 | //not used 27 | stepFunction(x) { 28 | if(x < 0) { 29 | return 0; 30 | } else { 31 | return 1; 32 | } 33 | } 34 | //--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 35 | //sigmoid activation function 36 | sigmoid(x) { 37 | return 1.0 / (1.0 + pow(Math.E, -4.9 * x)); //todo check pow 38 | } 39 | //---------------------------------------------------------------------------------------------------------------------------------------------------------- 40 | //returns whether this node connected to the parameter node 41 | //used when adding a new connection 42 | isConnectedTo(node) { 43 | if(node.layer == this.layer) { //nodes in the same this.layer cannot be connected 44 | return false; 45 | } 46 | 47 | //you get it 48 | if(node.layer < this.layer) { 49 | for(var i = 0; i < node.outputConnections.length; i++) { 50 | if(node.outputConnections[i].toNode == this) { 51 | return true; 52 | } 53 | } 54 | } else { 55 | for(var i = 0; i < this.outputConnections.length; i++) { 56 | if(this.outputConnections[i].toNode == node) { 57 | return true; 58 | } 59 | } 60 | } 61 | 62 | return false; 63 | } 64 | //--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 65 | //returns a copy of this node 66 | clone() { 67 | var clone = new Node(this.number); 68 | clone.layer = this.layer; 69 | return clone; 70 | } 71 | } 72 | -------------------------------------------------------------------------------- /flappyBird/Pipe.js: -------------------------------------------------------------------------------- 1 | class Pipe { 2 | constructor(isTop, height) { 3 | this.width = 100; 4 | this.height = height; 5 | this.x = canvas.width; 6 | this.isTop = isTop; 7 | this.randomMultiplier = random(5); 8 | if (isTop) { 9 | this.topY = 0; 10 | this.bottomY = this.height; 11 | } else { 12 | this.topY = canvas.height - this.height; 13 | this.bottomY = canvas.height; 14 | } 15 | } 16 | 17 | show() { 18 | // fill(0, 204, 0); 19 | // rect(this.x, this.topY, this.width, this.height); 20 | 21 | if (this.isTop) { 22 | image(topPipeSprite, this.x, this.topY + this.height - 800); 23 | } else { 24 | image(bottomPipeSprite, this.x, this.topY); 25 | } 26 | 27 | } 28 | 29 | update() { 30 | this.x -= panSpeed * this.randomMultiplier; 31 | } 32 | 33 | colided(p) { 34 | 35 | if (p.x + p.size / 2 >= this.x && p.x - p.size / 2 <= this.x + this.width) { 36 | if (!this.isTop && p.y + p.size / 2 >= this.topY) { 37 | return true; 38 | } 39 | if (this.isTop && p.y - p.size / 2 <= this.bottomY) { 40 | return true; 41 | } 42 | 43 | } 44 | return false; 45 | } 46 | 47 | } 48 | -------------------------------------------------------------------------------- /flappyBird/PipePair.js: -------------------------------------------------------------------------------- 1 | class PipePair { 2 | constructor(firstPipe, previousPipe, upToRandNo) { 3 | var minDistFromEdge = 50; 4 | this.gap = 160; 5 | this.maxPipeDifference = 300; 6 | this.passed = false; 7 | if (firstPipe) { 8 | this.topHeight = (canvas.height - 30) / 2 - this.gap / 2; 9 | } else { 10 | if (randomPipeHeights.length >= upToRandNo) { 11 | randomPipeHeights.push(floor(random(minDistFromEdge, canvas.height - minDistFromEdge - 30 - this.gap))); 12 | } 13 | this.topHeight = randomPipeHeights[upToRandNo]; //floor(random(minDistFromEdge, canvas.height - minDistFromEdge - 30 - this.gap)); 14 | if (previousPipe) { 15 | while (abs(this.topHeight - previousPipe.topHeight) > this.maxPipeDifference) { 16 | randomPipeHeights[upToRandNo] = floor(random(minDistFromEdge, canvas.height - minDistFromEdge - 30 - this.gap)); 17 | this.topHeight = randomPipeHeights[upToRandNo]; 18 | } 19 | } 20 | } 21 | this.bottomHeight = canvas.height - this.topHeight - this.gap; 22 | this.bottomPipe = new Pipe(false, this.bottomHeight); 23 | this.topPipe = new Pipe(true, this.topHeight); 24 | } 25 | 26 | 27 | 28 | show() { 29 | this.bottomPipe.show(); 30 | this.topPipe.show(); 31 | 32 | } 33 | 34 | update() { 35 | this.bottomPipe.update(); 36 | this.topPipe.update(); 37 | 38 | } 39 | 40 | 41 | offScreen() { 42 | if (this.bottomPipe.x + this.bottomPipe.width < 0) { 43 | return true; 44 | } 45 | return false; 46 | 47 | } 48 | 49 | playerPassed(playerX) { 50 | if (!this.passed && playerX > this.bottomPipe.x + this.bottomPipe.width) { 51 | this.passed = true; 52 | return true; 53 | } 54 | return false; 55 | 56 | } 57 | 58 | colided(p) { 59 | return this.bottomPipe.colided(p) || this.topPipe.colided(p); 60 | 61 | } 62 | 63 | setX(newX) { 64 | this.bottomPipe.x = newX; 65 | this.topPipe.x = newX; 66 | } 67 | } 68 | -------------------------------------------------------------------------------- /flappyBird/Population.js: -------------------------------------------------------------------------------- 1 | class Population { 2 | 3 | constructor(size) { 4 | this.players = []; //new ArrayList(); 5 | this.bestPlayer; //the best ever player 6 | this.bestScore = 0; //the score of the best ever player 7 | this.globalBestScore = 0; 8 | this.gen = 1; 9 | this.innovationHistory = []; // new ArrayList(); 10 | this.genPlayers = []; //new ArrayList(); 11 | this.species = []; //new ArrayList(); 12 | 13 | this.massExtinctionEvent = false; 14 | this.newStage = false; 15 | 16 | this.gensSinceNewWorld = 0; 17 | 18 | for (var i = 0; i < size; i++) { 19 | 20 | this.players.push(new Player()); 21 | // this.players[this.players.length - 1].brain.fullyConnect(this.innovationHistory); 22 | this.players[this.players.length - 1].brain.mutate(this.innovationHistory); //fullyConnect(this.innovationHistory); 23 | this.players[this.players.length - 1].brain.generateNetwork(); 24 | 25 | } 26 | 27 | } 28 | 29 | getCurrentBest() { 30 | 31 | for (var i = 0; i < this.players.length; i++) { 32 | if (!this.players[i].dead) { 33 | return this.players[i]; 34 | } 35 | } 36 | return this.players[0]; 37 | } 38 | updateAlive() { 39 | var firstShown = false; 40 | for (var i = 0; i < this.players.length; i++) { 41 | if (!this.players[i].dead) { 42 | for (var j = 0; j < superSpeed; j++) { 43 | this.players[i].look(); //get inputs for brain 44 | this.players[i].think(); //use outputs from neural network 45 | this.players[i].update(); //move the player according to the outputs from the neural network 46 | } 47 | if (!showNothing && (!showBest || !firstShown)) { 48 | this.players[i].show(); 49 | firstShown = true; 50 | } 51 | if (this.players[i].score > this.globalBestScore) { 52 | this.globalBestScore = this.players[i].score; 53 | } 54 | 55 | } 56 | } 57 | 58 | } 59 | //------------------------------------------------------------------------------------------------------------------------------------------ 60 | //returns true if all the players are dead sad 61 | done() { 62 | for (var i = 0; i < this.players.length; i++) { 63 | if (!this.players[i].dead) { 64 | return false; 65 | } 66 | } 67 | return true; 68 | } 69 | //------------------------------------------------------------------------------------------------------------------------------------------ 70 | //sets the best player globally and for thisthis.gen 71 | setBestPlayer() { 72 | var tempBest = this.species[0].players[0]; 73 | tempBest.gen = this.gen; 74 | 75 | 76 | //if best thisthis.gen is better than the global best score then set the global best as the best thisthis.gen 77 | 78 | if (tempBest.score >= this.bestScore) { 79 | this.genPlayers.push(tempBest.cloneForReplay()); 80 | console.log("old best: " + this.bestScore); 81 | console.log("new best: " + tempBest.score); 82 | this.bestScore = tempBest.score; 83 | this.bestPlayer = tempBest.cloneForReplay(); 84 | } 85 | } 86 | 87 | //------------------------------------------------------------------------------------------------------------------------------------------------ 88 | //this function is called when all the players in the this.players are dead and a newthis.generation needs to be made 89 | naturalSelection() { 90 | 91 | // this.batchNo = 0; 92 | var previousBest = this.players[0]; 93 | this.speciate(); //seperate the this.players varo this.species 94 | this.calculateFitness(); //calculate the fitness of each player 95 | this.sortSpecies(); //sort the this.species to be ranked in fitness order, best first 96 | if (this.massExtinctionEvent) { 97 | this.massExtinction(); 98 | this.massExtinctionEvent = false; 99 | } 100 | this.cullSpecies(); //kill off the bottom half of each this.species 101 | this.setBestPlayer(); //save the best player of thisthis.gen 102 | this.killStaleSpecies(); //remove this.species which haven't improved in the last 15(ish)this.generations 103 | this.killBadSpecies(); //kill this.species which are so bad that they cant reproduce 104 | 105 | console.log("generation " + this.gen + " Number of mutations " + this.innovationHistory.length + " species: " + this.species.length + " <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<"); 106 | 107 | var averageSum = this.getAvgFitnessSum(); 108 | var children = []; 109 | for (var j = 0; j < this.species.length; j++) { //for each this.species 110 | 111 | children.push(this.species[j].champ.clone()); //add champion without any mutation 112 | var NoOfChildren = floor(this.species[j].averageFitness / averageSum * this.players.length) - 1; //the number of children this this.species is allowed, note -1 is because the champ is already added 113 | 114 | 115 | for (var i = 0; i < NoOfChildren; i++) { //get the calculated amount of children from this this.species 116 | children.push(this.species[j].giveMeBaby(this.innovationHistory)); 117 | } 118 | } 119 | // setup(); 120 | // return; 121 | if (children.length < this.players.length) { 122 | children.push(previousBest.clone()); 123 | } 124 | while (children.length < this.players.length) { //if not enough babies (due to flooring the number of children to get a whole var) 125 | children.push(this.species[0].giveMeBaby(this.innovationHistory)); //get babies from the best this.species 126 | } 127 | 128 | 129 | 130 | this.players = []; 131 | arrayCopy(children, this.players); //set the children as the current this.playersulation 132 | this.gen += 1; 133 | for (var i = 0; i < this.players.length; i++) { //generate networks for each of the children 134 | this.players[i].brain.generateNetwork(); 135 | } 136 | } 137 | 138 | //------------------------------------------------------------------------------------------------------------------------------------------ 139 | //seperate this.players into this.species based on how similar they are to the leaders of each this.species in the previousthis.gen 140 | speciate() { 141 | for (var s of this.species) { //empty this.species 142 | s.players = []; 143 | } 144 | for (var i = 0; i < this.players.length; i++) { //for each player 145 | var speciesFound = false; 146 | for (var s of this.species) { //for each this.species 147 | if (s.sameSpecies(this.players[i].brain)) { //if the player is similar enough to be considered in the same this.species 148 | s.addToSpecies(this.players[i]); //add it to the this.species 149 | speciesFound = true; 150 | break; 151 | } 152 | } 153 | if (!speciesFound) { //if no this.species was similar enough then add a new this.species with this as its champion 154 | this.species.push(new Species(this.players[i])); 155 | } 156 | } 157 | } 158 | //------------------------------------------------------------------------------------------------------------------------------------------ 159 | //calculates the fitness of all of the players 160 | calculateFitness() { 161 | for (var i = 1; i < this.players.length; i++) { 162 | this.players[i].calculateFitness(); 163 | } 164 | } 165 | //------------------------------------------------------------------------------------------------------------------------------------------ 166 | //sorts the players within a this.species and the this.species by their fitnesses 167 | sortSpecies() { 168 | //sort the players within a this.species 169 | for (var s of this.species) { 170 | s.sortSpecies(); 171 | } 172 | 173 | //sort the this.species by the fitness of its best player 174 | //using selection sort like a loser 175 | var temp = []; //new ArrayList(); 176 | for (var i = 0; i < this.species.length; i++) { 177 | var max = 0; 178 | var maxIndex = 0; 179 | for (var j = 0; j < this.species.length; j++) { 180 | if (this.species[j].bestFitness > max) { 181 | max = this.species[j].bestFitness; 182 | maxIndex = j; 183 | } 184 | } 185 | temp.push(this.species[maxIndex]); 186 | this.species.splice(maxIndex, 1); 187 | // this.species.remove(maxIndex); 188 | i--; 189 | } 190 | this.species = []; 191 | arrayCopy(temp, this.species); 192 | 193 | } 194 | //------------------------------------------------------------------------------------------------------------------------------------------ 195 | //kills all this.species which haven't improved in 15this.generations 196 | killStaleSpecies() { 197 | for (var i = 2; i < this.species.length; i++) { 198 | if (this.species[i].staleness >= 15) { 199 | // .remove(i); 200 | // splice(this.species, i) 201 | this.species.splice(i, 1); 202 | i--; 203 | } 204 | } 205 | } 206 | //------------------------------------------------------------------------------------------------------------------------------------------ 207 | //if a this.species sucks so much that it wont even be allocated 1 child for the nextthis.generation then kill it now 208 | killBadSpecies() { 209 | var averageSum = this.getAvgFitnessSum(); 210 | 211 | for (var i = 1; i < this.species.length; i++) { 212 | if (this.species[i].averageFitness / averageSum * this.players.length < 1) { //if wont be given a single child 213 | // this.species.remove(i); //sad 214 | this.species.splice(i, 1); 215 | 216 | i--; 217 | } 218 | } 219 | } 220 | //------------------------------------------------------------------------------------------------------------------------------------------ 221 | //returns the sum of each this.species average fitness 222 | getAvgFitnessSum() { 223 | var averageSum = 0; 224 | for (var s of this.species) { 225 | averageSum += s.averageFitness; 226 | } 227 | return averageSum; 228 | } 229 | 230 | //------------------------------------------------------------------------------------------------------------------------------------------ 231 | //kill the bottom half of each this.species 232 | cullSpecies() { 233 | for (var s of this.species) { 234 | s.cull(); //kill bottom half 235 | s.fitnessSharing(); //also while we're at it lets do fitness sharing 236 | s.setAverage(); //reset averages because they will have changed 237 | } 238 | } 239 | 240 | 241 | massExtinction() { 242 | for (var i = 5; i < this.species.length; i++) { 243 | // this.species.remove(i); //sad 244 | this.species.splice(i, 1); 245 | 246 | i--; 247 | } 248 | } 249 | //------------------------------------------------------------------------------------------------------------------------------------------ 250 | // BATCH LEARNING 251 | //------------------------------------------------------------------------------------------------------------------------------------------ 252 | //update all the players which are alive 253 | updateAliveInBatches() { 254 | let aliveCount = 0; 255 | for (var i = 0; i < this.players.length; i++) { 256 | if (this.playerInBatch(this.players[i])) { 257 | 258 | if (!this.players[i].dead) { 259 | aliveCount++; 260 | this.players[i].look(); //get inputs for brain 261 | this.players[i].think(); //use outputs from neural network 262 | this.players[i].update(); //move the player according to the outputs from the neural network 263 | if (!showNothing && (!showBest || i == 0)) { 264 | this.players[i].show(); 265 | } 266 | if (this.players[i].score > this.globalBestScore) { 267 | this.globalBestScore = this.players[i].score; 268 | } 269 | } 270 | } 271 | } 272 | 273 | 274 | if (aliveCount == 0) { 275 | this.batchNo++; 276 | } 277 | } 278 | 279 | 280 | playerInBatch(player) { 281 | for (var i = this.batchNo * this.worldsPerBatch; i < min((this.batchNo + 1) * this.worldsPerBatch, worlds.length); i++) { 282 | if (player.world == worlds[i]) { 283 | return true; 284 | } 285 | } 286 | 287 | return false; 288 | 289 | 290 | } 291 | 292 | stepWorldsInBatch() { 293 | for (var i = this.batchNo * this.worldsPerBatch; i < min((this.batchNo + 1) * this.worldsPerBatch, worlds.length); i++) { 294 | worlds[i].Step(1 / 30, 10, 10); 295 | } 296 | } 297 | //------------------------------------------------------------------------------------------------------------------------------------------ 298 | //returns true if all the players in a batch are dead sad 299 | batchDead() { 300 | for (var i = this.batchNo * this.playersPerBatch; i < min((this.batchNo + 1) * this.playersPerBatch, this.players.length); i++) { 301 | if (!this.players[i].dead) { 302 | return false; 303 | } 304 | } 305 | return true; 306 | } 307 | 308 | } 309 | -------------------------------------------------------------------------------- /flappyBird/Species.js: -------------------------------------------------------------------------------- 1 | class Species { 2 | 3 | constructor(p) { 4 | this.players = []; 5 | this.bestFitness = 0; 6 | this.champ; 7 | this.averageFitness = 0; 8 | this.staleness = 0; //how many generations the species has gone without an improvement 9 | this.rep; 10 | 11 | //-------------------------------------------- 12 | //coefficients for testing compatibility 13 | this.excessCoeff = 1; 14 | this.weightDiffCoeff = 0.5; 15 | this.compatibilityThreshold = 3; 16 | if (p) { 17 | this.players.push(p); 18 | //since it is the only one in the species it is by default the best 19 | this.bestFitness = p.fitness; 20 | this.rep = p.brain.clone(); 21 | this.champ = p.cloneForReplay(); 22 | } 23 | } 24 | 25 | //------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 26 | //returns whether the parameter genome is in this species 27 | sameSpecies(g) { 28 | var compatibility; 29 | var excessAndDisjoint = this.getExcessDisjoint(g, this.rep); //get the number of excess and disjoint genes between this player and the current species this.rep 30 | var averageWeightDiff = this.averageWeightDiff(g, this.rep); //get the average weight difference between matching genes 31 | 32 | 33 | var largeGenomeNormaliser = g.genes.length - 20; 34 | if (largeGenomeNormaliser < 1) { 35 | largeGenomeNormaliser = 1; 36 | } 37 | 38 | compatibility = (this.excessCoeff * excessAndDisjoint / largeGenomeNormaliser) + (this.weightDiffCoeff * averageWeightDiff); //compatibility formula 39 | return (this.compatibilityThreshold > compatibility); 40 | } 41 | 42 | //------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 43 | //add a player to the species 44 | addToSpecies(p) { 45 | this.players.push(p); 46 | } 47 | 48 | //------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 49 | //returns the number of excess and disjoint genes between the 2 input genomes 50 | //i.e. returns the number of genes which dont match 51 | getExcessDisjoint(brain1, brain2) { 52 | var matching = 0.0; 53 | for (var i = 0; i < brain1.genes.length; i++) { 54 | for (var j = 0; j < brain2.genes.length; j++) { 55 | if (brain1.genes[i].innovationNo == brain2.genes[j].innovationNo) { 56 | matching++; 57 | break; 58 | } 59 | } 60 | } 61 | return (brain1.genes.length + brain2.genes.length - 2 * (matching)); //return no of excess and disjoint genes 62 | } 63 | //------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 64 | //returns the avereage weight difference between matching genes in the input genomes 65 | averageWeightDiff(brain1, brain2) { 66 | if (brain1.genes.length == 0 || brain2.genes.length == 0) { 67 | return 0; 68 | } 69 | 70 | 71 | var matching = 0; 72 | var totalDiff = 0; 73 | for (var i = 0; i < brain1.genes.length; i++) { 74 | for (var j = 0; j < brain2.genes.length; j++) { 75 | if (brain1.genes[i].innovationNo == brain2.genes[j].innovationNo) { 76 | matching++; 77 | totalDiff += abs(brain1.genes[i].weight - brain2.genes[j].weight); 78 | break; 79 | } 80 | } 81 | } 82 | if (matching == 0) { //divide by 0 error 83 | return 100; 84 | } 85 | return totalDiff / matching; 86 | } 87 | //------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 88 | //sorts the species by fitness 89 | sortSpecies() { 90 | 91 | var temp = []; // new ArrayList < Player > (); 92 | 93 | //selection short 94 | for (var i = 0; i < this.players.length; i++) { 95 | var max = 0; 96 | var maxIndex = 0; 97 | for (var j = 0; j < this.players.length; j++) { 98 | if (this.players[j].fitness > max) { 99 | max = this.players[j].fitness; 100 | maxIndex = j; 101 | } 102 | } 103 | temp.push(this.players[maxIndex]); 104 | 105 | this.players.splice(maxIndex, 1); 106 | // this.players.remove(maxIndex); 107 | i--; 108 | } 109 | 110 | // this.players = (ArrayList) temp.clone(); 111 | arrayCopy(temp, this.players); 112 | if (this.players.length == 0) { 113 | this.staleness = 200; 114 | return; 115 | } 116 | //if new best player 117 | if (this.players[0].fitness > this.bestFitness) { 118 | this.staleness = 0; 119 | this.bestFitness = this.players[0].fitness; 120 | this.rep = this.players[0].brain.clone(); 121 | this.champ = this.players[0].cloneForReplay(); 122 | } else { //if no new best player 123 | this.staleness++; 124 | } 125 | } 126 | 127 | //------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 128 | //simple stuff 129 | setAverage() { 130 | var sum = 0; 131 | for (var i = 0; i < this.players.length; i++) { 132 | sum += this.players[i].fitness; 133 | } 134 | this.averageFitness = sum / this.players.length; 135 | } 136 | //------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 137 | 138 | //gets baby from the this.players in this species 139 | giveMeBaby(innovationHistory) { 140 | var baby; 141 | if (random(1) < 0.25) { //25% of the time there is no crossover and the child is simply a clone of a random(ish) player 142 | 143 | baby = this.selectPlayer().clone(); 144 | 145 | } else { //75% of the time do crossover 146 | //get 2 random(ish) parents 147 | var parent1 = this.selectPlayer(); 148 | 149 | var parent2 = this.selectPlayer(); 150 | 151 | //the crossover function expects the highest fitness parent to be the object and the lowest as the argument 152 | if (parent1.fitness < parent2.fitness) { 153 | 154 | baby = parent2.crossover(parent1); 155 | } else { 156 | 157 | baby = parent1.crossover(parent2); 158 | } 159 | 160 | } 161 | baby.brain.mutate(innovationHistory); //mutate that baby brain 162 | 163 | return baby; 164 | } 165 | 166 | //------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 167 | //selects a player based on it fitness 168 | selectPlayer() { 169 | var fitnessSum = 0; 170 | for (var i = 0; i < this.players.length; i++) { 171 | fitnessSum += this.players[i].fitness; 172 | } 173 | var rand = random(fitnessSum); 174 | var runningSum = 0; 175 | 176 | for (var i = 0; i < this.players.length; i++) { 177 | runningSum += this.players[i].fitness; 178 | if (runningSum > rand) { 179 | return this.players[i]; 180 | } 181 | } 182 | //unreachable code to make the parser happy 183 | return this.players[0]; 184 | } 185 | //------------------------------------------------------------------------------------------------------------------------------------------ 186 | //kills off bottom half of the species 187 | cull() { 188 | if (this.players.length > 2) { 189 | for (var i = this.players.length / 2; i < this.players.length; i++) { 190 | // this.players.remove(i); 191 | this.players.splice(i, 1); 192 | i--; 193 | } 194 | } 195 | } 196 | //------------------------------------------------------------------------------------------------------------------------------------------ 197 | //in order to protect unique this.players, the fitnesses of each player is divided by the number of this.players in the species that that player belongs to 198 | fitnessSharing() { 199 | for (var i = 0; i < this.players.length; i++) { 200 | this.players[i].fitness /= this.players.length; 201 | } 202 | } 203 | } 204 | -------------------------------------------------------------------------------- /flappyBird/images/Untitled-3.psd: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/Untitled-3.psd -------------------------------------------------------------------------------- /flappyBird/images/background.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/background.png -------------------------------------------------------------------------------- /flappyBird/images/bird.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/bird.png -------------------------------------------------------------------------------- /flappyBird/images/christmasberd.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/christmasberd.png -------------------------------------------------------------------------------- /flappyBird/images/fatBird.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/fatBird.png -------------------------------------------------------------------------------- /flappyBird/images/full pipe bottom.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/full pipe bottom.png -------------------------------------------------------------------------------- /flappyBird/images/full pipe top.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/full pipe top.png -------------------------------------------------------------------------------- /flappyBird/images/groundPiece.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/groundPiece.png -------------------------------------------------------------------------------- /flappyBird/images/photoshoip thing 1.psd: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/photoshoip thing 1.psd -------------------------------------------------------------------------------- /flappyBird/images/pipeHead0000.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/pipeHead0000.png -------------------------------------------------------------------------------- /flappyBird/images/shaft0000.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Code-Bullet/Flappy-Bird-AI/dc24ba528c73b2907a7fbbdc52cb191aa663bfa6/flappyBird/images/shaft0000.png -------------------------------------------------------------------------------- /flappyBird/index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | -------------------------------------------------------------------------------- /flappyBird/libraries/p5.dom.js: -------------------------------------------------------------------------------- 1 | /*! p5.dom.js v0.3.2 March 25, 2017 */ 2 | /** 3 | *

The web is much more than just canvas and p5.dom makes it easy to interact 4 | * with other HTML5 objects, including text, hyperlink, image, input, video, 5 | * audio, and webcam.

6 | *

There is a set of creation methods, DOM manipulation methods, and 7 | * an extended p5.Element that supports a range of HTML elements. See the 8 | * 9 | * beyond the canvas tutorial for a full overview of how this addon works. 10 | * 11 | *

Methods and properties shown in black are part of the p5.js core, items in 12 | * blue are part of the p5.dom library. You will need to include an extra file 13 | * in order to access the blue functions. See the 14 | * using a library 15 | * section for information on how to include this library. p5.dom comes with 16 | * p5 complete or you can download the single file 17 | * 18 | * here.

19 | *

See tutorial: beyond the canvas 20 | * for more info on how to use this libary. 21 | * 22 | * @module p5.dom 23 | * @submodule p5.dom 24 | * @for p5.dom 25 | * @main 26 | */ 27 | 28 | (function (root, factory) { 29 | if (typeof define === 'function' && define.amd) 30 | define('p5.dom', ['p5'], function (p5) { (factory(p5));}); 31 | else if (typeof exports === 'object') 32 | factory(require('../p5')); 33 | else 34 | factory(root['p5']); 35 | }(this, function (p5) { 36 | 37 | // ============================================================================= 38 | // p5 additions 39 | // ============================================================================= 40 | 41 | /** 42 | * Searches the page for an element with the given ID, class, or tag name (using the '#' or '.' 43 | * prefixes to specify an ID or class respectively, and none for a tag) and returns it as 44 | * a p5.Element. If a class or tag name is given with more than 1 element, 45 | * only the first element will be returned. 46 | * The DOM node itself can be accessed with .elt. 47 | * Returns null if none found. You can also specify a container to search within. 48 | * 49 | * @method select 50 | * @param {String} name id, class, or tag name of element to search for 51 | * @param {String} [container] id, p5.Element, or HTML element to search within 52 | * @return {Object|p5.Element|Null} p5.Element containing node found 53 | * @example 54 | *

55 | * function setup() { 56 | * createCanvas(100,100); 57 | * //translates canvas 50px down 58 | * select('canvas').position(100, 100); 59 | * } 60 | *
61 | *
62 | * // these are all valid calls to select() 63 | * var a = select('#moo'); 64 | * var b = select('#blah', '#myContainer'); 65 | * var c = select('#foo', b); 66 | * var d = document.getElementById('beep'); 67 | * var e = select('p', d); 68 | *
69 | * 70 | */ 71 | p5.prototype.select = function (e, p) { 72 | var res = null; 73 | var container = getContainer(p); 74 | if (e[0] === '.'){ 75 | e = e.slice(1); 76 | res = container.getElementsByClassName(e); 77 | if (res.length) { 78 | res = res[0]; 79 | } else { 80 | res = null; 81 | } 82 | }else if (e[0] === '#'){ 83 | e = e.slice(1); 84 | res = container.getElementById(e); 85 | }else { 86 | res = container.getElementsByTagName(e); 87 | if (res.length) { 88 | res = res[0]; 89 | } else { 90 | res = null; 91 | } 92 | } 93 | if (res) { 94 | return wrapElement(res); 95 | } else { 96 | return null; 97 | } 98 | }; 99 | 100 | /** 101 | * Searches the page for elements with the given class or tag name (using the '.' prefix 102 | * to specify a class and no prefix for a tag) and returns them as p5.Elements 103 | * in an array. 104 | * The DOM node itself can be accessed with .elt. 105 | * Returns an empty array if none found. 106 | * You can also specify a container to search within. 107 | * 108 | * @method selectAll 109 | * @param {String} name class or tag name of elements to search for 110 | * @param {String} [container] id, p5.Element, or HTML element to search within 111 | * @return {Array} Array of p5.Elements containing nodes found 112 | * @example 113 | *
114 | * function setup() { 115 | * createButton('btn'); 116 | * createButton('2nd btn'); 117 | * createButton('3rd btn'); 118 | * var buttons = selectAll('button'); 119 | * 120 | * for (var i = 0; i < buttons.length; i++){ 121 | * buttons[i].size(100,100); 122 | * } 123 | * } 124 | *
125 | *
126 | * // these are all valid calls to selectAll() 127 | * var a = selectAll('.moo'); 128 | * var b = selectAll('div'); 129 | * var c = selectAll('button', '#myContainer'); 130 | * var d = select('#container'); 131 | * var e = selectAll('p', d); 132 | * var f = document.getElementById('beep'); 133 | * var g = select('.blah', f); 134 | *
135 | * 136 | */ 137 | p5.prototype.selectAll = function (e, p) { 138 | var arr = []; 139 | var res; 140 | var container = getContainer(p); 141 | if (e[0] === '.'){ 142 | e = e.slice(1); 143 | res = container.getElementsByClassName(e); 144 | } else { 145 | res = container.getElementsByTagName(e); 146 | } 147 | if (res) { 148 | for (var j = 0; j < res.length; j++) { 149 | var obj = wrapElement(res[j]); 150 | arr.push(obj); 151 | } 152 | } 153 | return arr; 154 | }; 155 | 156 | /** 157 | * Helper function for select and selectAll 158 | */ 159 | function getContainer(p) { 160 | var container = document; 161 | if (typeof p === 'string' && p[0] === '#'){ 162 | p = p.slice(1); 163 | container = document.getElementById(p) || document; 164 | } else if (p instanceof p5.Element){ 165 | container = p.elt; 166 | } else if (p instanceof HTMLElement){ 167 | container = p; 168 | } 169 | return container; 170 | } 171 | 172 | /** 173 | * Helper function for getElement and getElements. 174 | */ 175 | function wrapElement(elt) { 176 | if(elt.tagName === "INPUT" && elt.type === "checkbox") { 177 | var converted = new p5.Element(elt); 178 | converted.checked = function(){ 179 | if (arguments.length === 0){ 180 | return this.elt.checked; 181 | } else if(arguments[0]) { 182 | this.elt.checked = true; 183 | } else { 184 | this.elt.checked = false; 185 | } 186 | return this; 187 | }; 188 | return converted; 189 | } else if (elt.tagName === "VIDEO" || elt.tagName === "AUDIO") { 190 | return new p5.MediaElement(elt); 191 | } else { 192 | return new p5.Element(elt); 193 | } 194 | } 195 | 196 | /** 197 | * Removes all elements created by p5, except any canvas / graphics 198 | * elements created by createCanvas or createGraphics. 199 | * Event handlers are removed, and element is removed from the DOM. 200 | * @method removeElements 201 | * @example 202 | *
203 | * function setup() { 204 | * createCanvas(100, 100); 205 | * createDiv('this is some text'); 206 | * createP('this is a paragraph'); 207 | * } 208 | * function mousePressed() { 209 | * removeElements(); // this will remove the div and p, not canvas 210 | * } 211 | *
212 | * 213 | */ 214 | p5.prototype.removeElements = function (e) { 215 | for (var i=0; i 243 | * var myDiv; 244 | * function setup() { 245 | * myDiv = createDiv('this is some text'); 246 | * } 247 | * 248 | */ 249 | 250 | /** 251 | * Creates a <p></p> element in the DOM with given inner HTML. Used 252 | * for paragraph length text. 253 | * Appends to the container node if one is specified, otherwise 254 | * appends to body. 255 | * 256 | * @method createP 257 | * @param {String} html inner HTML for element created 258 | * @return {Object|p5.Element} pointer to p5.Element holding created node 259 | * @example 260 | *
261 | * var myP; 262 | * function setup() { 263 | * myP = createP('this is some text'); 264 | * } 265 | *
266 | */ 267 | 268 | /** 269 | * Creates a <span></span> element in the DOM with given inner HTML. 270 | * Appends to the container node if one is specified, otherwise 271 | * appends to body. 272 | * 273 | * @method createSpan 274 | * @param {String} html inner HTML for element created 275 | * @return {Object|p5.Element} pointer to p5.Element holding created node 276 | * @example 277 | *
278 | * var mySpan; 279 | * function setup() { 280 | * mySpan = createSpan('this is some text'); 281 | * } 282 | *
283 | */ 284 | var tags = ['div', 'p', 'span']; 285 | tags.forEach(function(tag) { 286 | var method = 'create' + tag.charAt(0).toUpperCase() + tag.slice(1); 287 | p5.prototype[method] = function(html) { 288 | var elt = document.createElement(tag); 289 | elt.innerHTML = typeof html === undefined ? "" : html; 290 | return addElement(elt, this); 291 | } 292 | }); 293 | 294 | /** 295 | * Creates an <img> element in the DOM with given src and 296 | * alternate text. 297 | * Appends to the container node if one is specified, otherwise 298 | * appends to body. 299 | * 300 | * @method createImg 301 | * @param {String} src src path or url for image 302 | * @param {String} [alt] alternate text to be used if image does not load 303 | * @param {Function} [successCallback] callback to be called once image data is loaded 304 | * @return {Object|p5.Element} pointer to p5.Element holding created node 305 | * @example 306 | *
307 | * var img; 308 | * function setup() { 309 | * img = createImg('http://p5js.org/img/asterisk-01.png'); 310 | * } 311 | *
312 | */ 313 | p5.prototype.createImg = function() { 314 | var elt = document.createElement('img'); 315 | var args = arguments; 316 | var self; 317 | var setAttrs = function(){ 318 | self.width = elt.offsetWidth || elt.width; 319 | self.height = elt.offsetHeight || elt.height; 320 | if (args.length > 1 && typeof args[1] === 'function'){ 321 | self.fn = args[1]; 322 | self.fn(); 323 | }else if (args.length > 1 && typeof args[2] === 'function'){ 324 | self.fn = args[2]; 325 | self.fn(); 326 | } 327 | }; 328 | elt.src = args[0]; 329 | if (args.length > 1 && typeof args[1] === 'string'){ 330 | elt.alt = args[1]; 331 | } 332 | elt.onload = function(){ 333 | setAttrs(); 334 | } 335 | self = addElement(elt, this); 336 | return self; 337 | }; 338 | 339 | /** 340 | * Creates an <a></a> element in the DOM for including a hyperlink. 341 | * Appends to the container node if one is specified, otherwise 342 | * appends to body. 343 | * 344 | * @method createA 345 | * @param {String} href url of page to link to 346 | * @param {String} html inner html of link element to display 347 | * @param {String} [target] target where new link should open, 348 | * could be _blank, _self, _parent, _top. 349 | * @return {Object|p5.Element} pointer to p5.Element holding created node 350 | * @example 351 | *
352 | * var myLink; 353 | * function setup() { 354 | * myLink = createA('http://p5js.org/', 'this is a link'); 355 | * } 356 | *
357 | */ 358 | p5.prototype.createA = function(href, html, target) { 359 | var elt = document.createElement('a'); 360 | elt.href = href; 361 | elt.innerHTML = html; 362 | if (target) elt.target = target; 363 | return addElement(elt, this); 364 | }; 365 | 366 | /** INPUT **/ 367 | 368 | 369 | /** 370 | * Creates a slider <input></input> element in the DOM. 371 | * Use .size() to set the display length of the slider. 372 | * Appends to the container node if one is specified, otherwise 373 | * appends to body. 374 | * 375 | * @method createSlider 376 | * @param {Number} min minimum value of the slider 377 | * @param {Number} max maximum value of the slider 378 | * @param {Number} [value] default value of the slider 379 | * @param {Number} [step] step size for each tick of the slider (if step is set to 0, the slider will move continuously from the minimum to the maximum value) 380 | * @return {Object|p5.Element} pointer to p5.Element holding created node 381 | * @example 382 | *
383 | * var slider; 384 | * function setup() { 385 | * slider = createSlider(0, 255, 100); 386 | * slider.position(10, 10); 387 | * slider.style('width', '80px'); 388 | * } 389 | * 390 | * function draw() { 391 | * var val = slider.value(); 392 | * background(val); 393 | * } 394 | *
395 | * 396 | *
397 | * var slider; 398 | * function setup() { 399 | * colorMode(HSB); 400 | * slider = createSlider(0, 360, 60, 40); 401 | * slider.position(10, 10); 402 | * slider.style('width', '80px'); 403 | * } 404 | * 405 | * function draw() { 406 | * var val = slider.value(); 407 | * background(val, 100, 100, 1); 408 | * } 409 | *
410 | */ 411 | p5.prototype.createSlider = function(min, max, value, step) { 412 | var elt = document.createElement('input'); 413 | elt.type = 'range'; 414 | elt.min = min; 415 | elt.max = max; 416 | if (step === 0) { 417 | elt.step = .000000000000000001; // smallest valid step 418 | } else if (step) { 419 | elt.step = step; 420 | } 421 | if (typeof(value) === "number") elt.value = value; 422 | return addElement(elt, this); 423 | }; 424 | 425 | /** 426 | * Creates a <button></button> element in the DOM. 427 | * Use .size() to set the display size of the button. 428 | * Use .mousePressed() to specify behavior on press. 429 | * Appends to the container node if one is specified, otherwise 430 | * appends to body. 431 | * 432 | * @method createButton 433 | * @param {String} label label displayed on the button 434 | * @param {String} [value] value of the button 435 | * @return {Object|p5.Element} pointer to p5.Element holding created node 436 | * @example 437 | *
438 | * var button; 439 | * function setup() { 440 | * createCanvas(100, 100); 441 | * background(0); 442 | * button = createButton('click me'); 443 | * button.position(19, 19); 444 | * button.mousePressed(changeBG); 445 | * } 446 | * 447 | * function changeBG() { 448 | * var val = random(255); 449 | * background(val); 450 | * } 451 | *
452 | */ 453 | p5.prototype.createButton = function(label, value) { 454 | var elt = document.createElement('button'); 455 | elt.innerHTML = label; 456 | elt.value = value; 457 | if (value) elt.value = value; 458 | return addElement(elt, this); 459 | }; 460 | 461 | /** 462 | * Creates a checkbox <input></input> element in the DOM. 463 | * Calling .checked() on a checkbox returns if it is checked or not 464 | * 465 | * @method createCheckbox 466 | * @param {String} [label] label displayed after checkbox 467 | * @param {boolean} [value] value of the checkbox; checked is true, unchecked is false.Unchecked if no value given 468 | * @return {Object|p5.Element} pointer to p5.Element holding created node 469 | * @example 470 | *
471 | * var checkbox; 472 | * 473 | * function setup() { 474 | * checkbox = createCheckbox('label', false); 475 | * checkbox.changed(myCheckedEvent); 476 | * } 477 | * 478 | * function myCheckedEvent() { 479 | * if (this.checked()) { 480 | * console.log("Checking!"); 481 | * } else { 482 | * console.log("Unchecking!"); 483 | * } 484 | * } 485 | *
486 | */ 487 | p5.prototype.createCheckbox = function() { 488 | var elt = document.createElement('div'); 489 | var checkbox = document.createElement('input'); 490 | checkbox.type = 'checkbox'; 491 | elt.appendChild(checkbox); 492 | //checkbox must be wrapped in p5.Element before label so that label appears after 493 | var self = addElement(elt, this); 494 | self.checked = function(){ 495 | var cb = self.elt.getElementsByTagName('input')[0]; 496 | if (cb) { 497 | if (arguments.length === 0){ 498 | return cb.checked; 499 | }else if(arguments[0]){ 500 | cb.checked = true; 501 | }else{ 502 | cb.checked = false; 503 | } 504 | } 505 | return self; 506 | }; 507 | this.value = function(val){ 508 | self.value = val; 509 | return this; 510 | }; 511 | if (arguments[0]){ 512 | var ran = Math.random().toString(36).slice(2); 513 | var label = document.createElement('label'); 514 | checkbox.setAttribute('id', ran); 515 | label.htmlFor = ran; 516 | self.value(arguments[0]); 517 | label.appendChild(document.createTextNode(arguments[0])); 518 | elt.appendChild(label); 519 | } 520 | if (arguments[1]){ 521 | checkbox.checked = true; 522 | } 523 | return self; 524 | }; 525 | 526 | /** 527 | * Creates a dropdown menu <select></select> element in the DOM. 528 | * @method createSelect 529 | * @param {boolean} [multiple] true if dropdown should support multiple selections 530 | * @return {Object|p5.Element} pointer to p5.Element holding created node 531 | * @example 532 | *
533 | * var sel; 534 | * 535 | * function setup() { 536 | * textAlign(CENTER); 537 | * background(200); 538 | * sel = createSelect(); 539 | * sel.position(10, 10); 540 | * sel.option('pear'); 541 | * sel.option('kiwi'); 542 | * sel.option('grape'); 543 | * sel.changed(mySelectEvent); 544 | * } 545 | * 546 | * function mySelectEvent() { 547 | * var item = sel.value(); 548 | * background(200); 549 | * text("it's a "+item+"!", 50, 50); 550 | * } 551 | *
552 | */ 553 | p5.prototype.createSelect = function(mult) { 554 | var elt = document.createElement('select'); 555 | if (mult){ 556 | elt.setAttribute('multiple', 'true'); 557 | } 558 | var self = addElement(elt, this); 559 | self.option = function(name, value){ 560 | var opt = document.createElement('option'); 561 | opt.innerHTML = name; 562 | if (arguments.length > 1) 563 | opt.value = value; 564 | else 565 | opt.value = name; 566 | elt.appendChild(opt); 567 | }; 568 | self.selected = function(value){ 569 | var arr = []; 570 | if (arguments.length > 0){ 571 | for (var i = 0; i < this.elt.length; i++){ 572 | if (value.toString() === this.elt[i].value){ 573 | this.elt.selectedIndex = i; 574 | } 575 | } 576 | return this; 577 | }else{ 578 | if (mult){ 579 | for (var i = 0; i < this.elt.selectedOptions.length; i++){ 580 | arr.push(this.elt.selectedOptions[i].value); 581 | } 582 | return arr; 583 | }else{ 584 | return this.elt.value; 585 | } 586 | } 587 | }; 588 | return self; 589 | }; 590 | 591 | /** 592 | * Creates a radio button <input></input> element in the DOM. 593 | * The .option() method can be used to set options for the radio after it is 594 | * created. The .value() method will return the currently selected option. 595 | * 596 | * @method createRadio 597 | * @param {String} [divId] the id and name of the created div and input field respectively 598 | * @return {Object|p5.Element} pointer to p5.Element holding created node 599 | * @example 600 | *
601 | * var radio; 602 | * 603 | * function setup() { 604 | * radio = createRadio(); 605 | * radio.option("black"); 606 | * radio.option("white"); 607 | * radio.option("gray"); 608 | * radio.style('width', '60px'); 609 | * textAlign(CENTER); 610 | * fill(255, 0, 0); 611 | * } 612 | * 613 | * function draw() { 614 | * var val = radio.value(); 615 | * background(val); 616 | * text(val, width/2, height/2); 617 | * } 618 | *
619 | *
620 | * var radio; 621 | * 622 | * function setup() { 623 | * radio = createRadio(); 624 | * radio.option('apple', 1); 625 | * radio.option('bread', 2); 626 | * radio.option('juice', 3); 627 | * radio.style('width', '60px'); 628 | * textAlign(CENTER); 629 | * } 630 | * 631 | * function draw() { 632 | * background(200); 633 | * var val = radio.value(); 634 | * if (val) { 635 | * text('item cost is $'+val, width/2, height/2); 636 | * } 637 | * } 638 | *
639 | */ 640 | p5.prototype.createRadio = function() { 641 | var radios = document.querySelectorAll("input[type=radio]"); 642 | var count = 0; 643 | if(radios.length > 1){ 644 | var length = radios.length; 645 | var prev=radios[0].name; 646 | var current = radios[1].name; 647 | count = 1; 648 | for(var i = 1; i < length; i++) { 649 | current = radios[i].name; 650 | if(prev != current){ 651 | count++; 652 | } 653 | prev = current; 654 | } 655 | } 656 | else if (radios.length == 1){ 657 | count = 1; 658 | } 659 | var elt = document.createElement('div'); 660 | var self = addElement(elt, this); 661 | var times = -1; 662 | self.option = function(name, value){ 663 | var opt = document.createElement('input'); 664 | opt.type = 'radio'; 665 | opt.innerHTML = name; 666 | if (arguments.length > 1) 667 | opt.value = value; 668 | else 669 | opt.value = name; 670 | opt.setAttribute('name',"defaultradio"+count); 671 | elt.appendChild(opt); 672 | if (name){ 673 | times++; 674 | var ran = Math.random().toString(36).slice(2); 675 | var label = document.createElement('label'); 676 | opt.setAttribute('id', "defaultradio"+count+"-"+times); 677 | label.htmlFor = "defaultradio"+count+"-"+times; 678 | label.appendChild(document.createTextNode(name)); 679 | elt.appendChild(label); 680 | } 681 | return opt; 682 | }; 683 | self.selected = function(){ 684 | var length = this.elt.childNodes.length; 685 | if(arguments.length == 1) { 686 | for (var i = 0; i < length; i+=2){ 687 | if(this.elt.childNodes[i].value == arguments[0]) 688 | this.elt.childNodes[i].checked = true; 689 | } 690 | return this; 691 | } else { 692 | for (var i = 0; i < length; i+=2){ 693 | if(this.elt.childNodes[i].checked == true) 694 | return this.elt.childNodes[i].value; 695 | } 696 | } 697 | }; 698 | self.value = function(){ 699 | var length = this.elt.childNodes.length; 700 | if(arguments.length == 1) { 701 | for (var i = 0; i < length; i+=2){ 702 | if(this.elt.childNodes[i].value == arguments[0]) 703 | this.elt.childNodes[i].checked = true; 704 | } 705 | return this; 706 | } else { 707 | for (var i = 0; i < length; i+=2){ 708 | if(this.elt.childNodes[i].checked == true) 709 | return this.elt.childNodes[i].value; 710 | } 711 | return ""; 712 | } 713 | }; 714 | return self 715 | }; 716 | 717 | /** 718 | * Creates an <input></input> element in the DOM for text input. 719 | * Use .size() to set the display length of the box. 720 | * Appends to the container node if one is specified, otherwise 721 | * appends to body. 722 | * 723 | * @method createInput 724 | * @param {Number} [value] default value of the input box 725 | * @param {String} [type] type of text, ie text, password etc. Defaults to text 726 | * @return {Object|p5.Element} pointer to p5.Element holding created node 727 | * @example 728 | *
729 | * function setup(){ 730 | * var inp = createInput(''); 731 | * inp.input(myInputEvent); 732 | * } 733 | * 734 | * function myInputEvent(){ 735 | * console.log('you are typing: ', this.value()); 736 | * } 737 | * 738 | *
739 | */ 740 | p5.prototype.createInput = function(value, type) { 741 | var elt = document.createElement('input'); 742 | elt.type = type ? type : 'text'; 743 | if (value) elt.value = value; 744 | return addElement(elt, this); 745 | }; 746 | 747 | /** 748 | * Creates an <input></input> element in the DOM of type 'file'. 749 | * This allows users to select local files for use in a sketch. 750 | * 751 | * @method createFileInput 752 | * @param {Function} [callback] callback function for when a file loaded 753 | * @param {String} [multiple] optional to allow multiple files selected 754 | * @return {Object|p5.Element} pointer to p5.Element holding created DOM element 755 | * @example 756 | * var input; 757 | * var img; 758 | * 759 | * function setup() { 760 | * input = createFileInput(handleFile); 761 | * input.position(0, 0); 762 | * } 763 | * 764 | * function draw() { 765 | * if (img) { 766 | * image(img, 0, 0, width, height); 767 | * } 768 | * } 769 | * 770 | * function handleFile(file) { 771 | * print(file); 772 | * if (file.type === 'image') { 773 | * img = createImg(file.data); 774 | * img.hide(); 775 | * } 776 | * } 777 | */ 778 | p5.prototype.createFileInput = function(callback, multiple) { 779 | 780 | // Is the file stuff supported? 781 | if (window.File && window.FileReader && window.FileList && window.Blob) { 782 | // Yup, we're ok and make an input file selector 783 | var elt = document.createElement('input'); 784 | elt.type = 'file'; 785 | 786 | // If we get a second argument that evaluates to true 787 | // then we are looking for multiple files 788 | if (multiple) { 789 | // Anything gets the job done 790 | elt.multiple = 'multiple'; 791 | } 792 | 793 | // Function to handle when a file is selected 794 | // We're simplifying life and assuming that we always 795 | // want to load every selected file 796 | function handleFileSelect(evt) { 797 | // These are the files 798 | var files = evt.target.files; 799 | // Load each one and trigger a callback 800 | for (var i = 0; i < files.length; i++) { 801 | var f = files[i]; 802 | var reader = new FileReader(); 803 | function makeLoader(theFile) { 804 | // Making a p5.File object 805 | var p5file = new p5.File(theFile); 806 | return function(e) { 807 | p5file.data = e.target.result; 808 | callback(p5file); 809 | }; 810 | }; 811 | reader.onload = makeLoader(f); 812 | 813 | // Text or data? 814 | // This should likely be improved 815 | if (f.type.indexOf('text') > -1) { 816 | reader.readAsText(f); 817 | } else { 818 | reader.readAsDataURL(f); 819 | } 820 | } 821 | } 822 | 823 | // Now let's handle when a file was selected 824 | elt.addEventListener('change', handleFileSelect, false); 825 | return addElement(elt, this); 826 | } else { 827 | console.log('The File APIs are not fully supported in this browser. Cannot create element.'); 828 | } 829 | }; 830 | 831 | 832 | /** VIDEO STUFF **/ 833 | 834 | function createMedia(pInst, type, src, callback) { 835 | var elt = document.createElement(type); 836 | 837 | // allow src to be empty 838 | var src = src || ''; 839 | if (typeof src === 'string') { 840 | src = [src]; 841 | } 842 | for (var i=0; i