Path: ...!eternal-september.org!reader01.eternal-september.org!aioe.org!wWi+bf82x/J4IG13ZEtRgw.user.46.165.242.75.POSTED!not-for-mail From: Samuel DEVULDER Newsgroups: fr.sci.maths Subject: =?UTF-8?Q?Re=3a_=5bJeux=5d_Trouver_le_calcul_cach=c3=a9?= Date: Mon, 4 Jul 2022 01:31:57 +0200 Organization: Aioe.org NNTP Server Message-ID: References: <62bea5f3$0$22083$426a74cc@news.free.fr> <62c138f4$0$8536$426a74cc@news.free.fr> <62c1fd2d$0$3015$426a34cc@news.free.fr> Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Info: gioia.aioe.org; logging-data="406"; posting-host="wWi+bf82x/J4IG13ZEtRgw.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org"; User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Thunderbird/91.11.0 Content-Language: fr X-Notice: Filtered by postfilter v. 0.9.2 X-Antivirus-Status: Clean X-Antivirus: Avast (VPS 220703-4, 3/7/2022), Outbound message Bytes: 6861 Lines: 230 Le 04/07/2022 à 00:19, Samuel DEVULDER a écrit : > > Bref solution en 3 coups. C'est mieux que l'autre algorithme. Je ne sais > pas si ce sera toujours ainsi. On verra demain lequel des deux marche le > mieux. Bon j'ai testé les deux algos (voir après les spoiler). La stratégie (#1) qui hier résolvait en 3 coups le fait en 6, avec une chance sur 2 d'échouer à la fin. :( killer mathler 153 6/6 ⬜⬜⬜⬜⬜🟩 ⬜⬜⬜⬜⬜🟩 ⬜⬜🟩⬜🟩🟩 \ ⬜⬜🟩⬜🟩🟩 > ici il n'avance pas trop dans les découvertes ! ⬜⬜🟩⬜🟩🟩 / 🟩🟩🟩🟩🟩🟩 <== coup de bol, il y avait une autre équation tout autant possible Celle du "moins-pire" (#2), en 6 aussi, mais sans coup de bol: killer mathler 153 6/6 ⬜⬜⬜⬜🟩⬜ ⬜⬜⬜⬜🟩⬜ ⬜⬜🟩⬜🟩⬜ ⬜⬜🟩⬜🟩⬜ ⬜⬜🟩⬜🟩🟩 <== ici plus que 2 solutions, mais mauvaise pioche, on prends pas la bonne. 🟩🟩🟩🟩🟩🟩 <== donc plus de choix ici autre que la vraie solution. Donc bahhhh.. Ca marche, mais ca ne semble pas génial. Les deux stratégies oscillent autour de la vraie solution, sans y converger rapidement. Y a t-il une meilleure stratégie ? (genre se concentrer sur les opérateurs). Il faut voir comment tu va résoudre celui d'aujourd'hui Jacques. .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... .... spoiler ... Stratégie #1 (max de symboles communs): ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Helper for https://killer.mathler.com/ by Samuel Devulder ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Num? 108 Finding equations for 108...done (639 found) 4 threads will be used. Finding equation woth most common symbols...done Try: 1*99+9 Ans: -----+ Finding equation woth most common symbols...done Try: 9+0+99 Ans: -----+ Finding equation woth most common symbols...done Try: 36/3*9 Ans: --+-++ Les opérateurs sont trouvés à partir d'ici (3 étapes). Le hic c'est qu'il reste pas mal d'équations avec ces opérateurs: ========== REMAINDER OF ARTICLE TRUNCATED ==========