I am trying to write a game with three puzzle games, similar to the "call of Atlantis." The most important algorithm is to find out all the possible match options. Are there any open source projects that can be referenced? Or any keywords for the algorithm? I am trying to find a faster algorithm to calculate all the possibilities. Thank.
To match 3 objects using a single swap, you already need 2 objects that are lined up correctly. First identify these pairs. Then there are only a few possibilities from which you can change the third object. Try coding these patterns.
( , ).
, .
Source: https://habr.com/ru/post/1759046/More articles:How can a program know if it is ClickOnce or not? - .netHow to use Elastic MapReduce to run XSLT conversion to millions of small S3 xml files? - xmlΠΠ°ΡΠΊΠΎΠ»ΡΠΊΠΎ Ρ ΠΌΠΎΠ³Ρ ΠΏΡΠ°Π²ΠΈΠ»ΡΠ½ΠΎ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°ΡΡ GUID? - securityGet route information from Zend_Controller_Request - phpHow to disable validation in a Silverlight 4 application? - validationGoogle Guava and an error that I cannot understand - javahow to specify at least one in the xsd sequence: - xmlreplacing linebreaks with use in UIWebView - sqliteΠ‘ΠΎΠ²ΠΌΠ΅ΡΡΠ½ΠΎΠ΅ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ Π΄Π°Π½Π½ΡΡ Ρ Π΄ΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠΈ Π·Π°Π³ΡΡΠΆΠ°Π΅ΠΌΠΎΠΉ Π±ΠΈΠ±Π»ΠΈΠΎΡΠ΅ΠΊΠΎΠΉ (dlopen, dlsym) - c++After a new installation, the previous version of SQLite3 (OS X) is retained - ruby ββ| fooobar.comAll Articles