multi-puzzle-solver 1.1.8__py3-none-any.whl

multi_puzzle_solver-1.1.8.dist-info/RECORD

@@ -0,0 +1,106 @@
+puzzle_solver/__init__.py,sha256=NYPVckpg9PKDgPK80Nr-zqhFeR83MS_TX9yCOUp9hlU,8307
+puzzle_solver/core/utils.py,sha256=SQJIugj5EGoV8YNprGSXCZdE24Moo56UWd38BCQ2-2g,10990
+puzzle_solver/core/utils_ortools.py,sha256=p0Gco5tUWMKw5xIA7YLLoyGYW591lV6EUEpf4cQAZAs,15111
+puzzle_solver/core/utils_visualizer.py,sha256=IdNI9UB1Y_E300ksOIYUEprRywkTvavOMYetbg4FIoo,23662
+puzzle_solver/puzzles/abc_view/abc_view.py,sha256=Qr0rZKmKQ2teStHjQ5VPQ4k-XptsjJAlZ1WXWk5Aax4,4570
+puzzle_solver/puzzles/aquarium/aquarium.py,sha256=dGqYEWMoh4di5DN4sd-GtYb6QeTpVYFQJHBkrrmrudQ,5649
+puzzle_solver/puzzles/area_51/area_51.py,sha256=noiDSdDTVQFHR6ztVzyxmVbEFACsaWn-vRZlLSRLVlc,9967
+puzzle_solver/puzzles/battleships/battleships.py,sha256=U4xJ_NJC2baHvfaAfJ01YEBjixq9gD0h8GP9L1V-_oM,7223
+puzzle_solver/puzzles/binairo/binairo.py,sha256=EBpXYD9Mxuig4uJl3xkcQ6_tbnoG13mVV7RZpQEXm38,5790
+puzzle_solver/puzzles/binairo/binairo_plus.py,sha256=TvLG3olwANtft3LuCF-y4OofpU9PNa4IXDqgZqsD-g0,267
+puzzle_solver/puzzles/black_box/black_box.py,sha256=7CxCdkP_JC3_9mrObkg7lrYGLBMok_DdBd3Nx0xCSkA,12560
+puzzle_solver/puzzles/branches/branches.py,sha256=BKrzZNU-y80uNiwahEr-eUM7X7baEVPzAdc18--XOlE,3691
+puzzle_solver/puzzles/bridges/bridges.py,sha256=HSoYBlht92TMknhe8IaC0B3ilNaSh5xMorB_Gs1Jatg,5395
+puzzle_solver/puzzles/chess_range/chess_melee.py,sha256=D-_Oi8OyxsVe1j3dIKYwRlxgeb3NWLmDWGcv-oclY0c,195
+puzzle_solver/puzzles/chess_range/chess_range.py,sha256=St8Fk-HOhInvIJy02zbW1Pa1t2qjpli-Fes07tjgBRU,21472
+puzzle_solver/puzzles/chess_range/chess_solo.py,sha256=ByDfcRsk5FVmFicpU_DpLoLTJ99Kr___vX4y8ln8_EQ,400
+puzzle_solver/puzzles/chess_sequence/chess_sequence.py,sha256=6ap3Wouf2PxHV4P56B9ol1QT98Ym6VHaxorQZWl6LnY,13692
+puzzle_solver/puzzles/circle_9/circle_9.py,sha256=Y94GM2eVYZc0YRu0XJ_ynMbBJZALKUZqbZA6Fe1ZwVQ,2401
+puzzle_solver/puzzles/clouds/clouds.py,sha256=NAPDq_62Unfa9oYGqMt0hbA9TVw1tYQzYvEuoZC84i8,4100
+puzzle_solver/puzzles/connect_the_dots/connect_the_dots.py,sha256=lxLUk7KjiTLND0CJ4f9IY_DS23rOYE-q0g1FKcRPaeo,3158
+puzzle_solver/puzzles/cow_and_cactus/cow_and_cactus.py,sha256=tsVZZMNUtmJ5mj2thw3z7_n6zW0l8IAC9gtnFyfKcrk,3648
+puzzle_solver/puzzles/dominosa/dominosa.py,sha256=YezNDc7RHUmOe3Ip6G2aHY0PadYGyo7CDacxplE2-9E,3362
+puzzle_solver/puzzles/filling/filling.py,sha256=ILgGJqVI7yd6HPvWeKEsr620qorxLtAQYKTq65PqarY,4952
+puzzle_solver/puzzles/flip/flip.py,sha256=cei6irTfntqctaLS3-rdYu8M2tw7ibzlHHvTIHW18yo,3518
+puzzle_solver/puzzles/flood_it/flood_it.py,sha256=jnCtH1sZIt6K4hbQDSsiM1Cd8FjQNP7cfw2ObUW5fEQ,7948
+puzzle_solver/puzzles/flood_it/parse_map/parse_map.py,sha256=m7gcpvN3THZdYLowdR_Jwx3HyttaV4K2DqrX_U7uFqU,8209
+puzzle_solver/puzzles/galaxies/galaxies.py,sha256=IiKPU3fz5Aokhj5OjeT5jd_vdNuWnLzjZylGOTepsNU,5600
+puzzle_solver/puzzles/galaxies/parse_map/parse_map.py,sha256=XmFqVN_oRfq9AZFWy5ViUJ2Szjgx-srrRkFPJXEEyFo,9358
+puzzle_solver/puzzles/guess/guess.py,sha256=MpyrF6YVu0S1fzX-BllwxGKRGacWJpeLbNn5GetuEyo,10792
+puzzle_solver/puzzles/heyawake/heyawake.py,sha256=HwCg1MQr6K742S-L5PjrkM1YYZWEFGV5gurTgT7q-6Q,9086
+puzzle_solver/puzzles/hidden_stars/hidden_stars.py,sha256=LkzcDJNBZmuQJHyuEQz3YJJIZ8AHOj0FEwsl_uXvoxM,3154
+puzzle_solver/puzzles/hidoku/hidoku.py,sha256=9Bj4ObmdgL6MCAYkPUTPj9fv0nr5XkJ92uNxSPgqqEA,3414
+puzzle_solver/puzzles/inertia/inertia.py,sha256=-Y5fr7aK20zwmGHsZql7pYCq1kyMZglvkVZ6uIDf1HA,5658
+puzzle_solver/puzzles/inertia/tsp.py,sha256=mAhlSjCWespASeN8uLZ0JkYDw-ZqFEpal6NM-ubpCXw,15313
+puzzle_solver/puzzles/inertia/parse_map/parse_map.py,sha256=x0d64gTBd0HC2lO5uOpX2VKWfwj8rRiz0mQM_lqNmWs,8457
+puzzle_solver/puzzles/kakurasu/kakurasu.py,sha256=ts4oPrFNeakNGi1rgAd6CIVQgeWSgnBGtA3qev_6ffY,1894
+puzzle_solver/puzzles/kakuro/kakuro.py,sha256=9Sk-Q3EQsflyaJo5zywV-OpJn4WnNbbNAfiMFzN00F4,4440
+puzzle_solver/puzzles/kakuro/krypto_kakuro.py,sha256=pppZk_gnl249Wta_2Um-tMDB-HLb7itkOgecCozfak4,5598
+puzzle_solver/puzzles/keen/keen.py,sha256=0sxLE-fN5LpebT4EnDFe4WR2D4LG98A-My4OfJGTRuQ,4197
+puzzle_solver/puzzles/kropki/kropki.py,sha256=fmmmACrRVqbsYSAcMT0aF3puijEND9URXMrZeywr_gQ,5821
+puzzle_solver/puzzles/light_up/light_up.py,sha256=a6TLaGnCfzhB2GMf9qmNx2xK_oCPRA1SSrmGYWjasIw,2898
+puzzle_solver/puzzles/linesweeper/linesweeper.py,sha256=LOj86CygiN00RUyG9IgZK5MQIsqyhcvVrivmzhHlf-w,4027
+puzzle_solver/puzzles/link_a_pix/link_a_pix.py,sha256=1xh8c9V7FdtWrARWkya-8Z5fWP2o6BFj7PKf-ybSsbs,4752
+puzzle_solver/puzzles/lits/lits.py,sha256=QeXFiCnWNI9jzUj3QLgU20mXxE2DD9o4BJsUb0TswKk,7231
+puzzle_solver/puzzles/magnets/magnets.py,sha256=APg41g7_xSVUqHbSUxcWicnlmSKzkpnG2yXgQ0qMZmE,5437
+puzzle_solver/puzzles/map/map.py,sha256=sxc57tapB8Tsgam-yoDitln1o-EB_SbIYvO6WEYy3us,2582
+puzzle_solver/puzzles/mathema_grids/mathema_grids.py,sha256=wXj3pfXUMh3deFA6XXndZXod6ZNyCVt9vX1akt9zz20,6380
+puzzle_solver/puzzles/mathrax/mathrax.py,sha256=qMO7h7pb3pRDw1hjJTqU8ALvARrajfTT8yuKzbTYRIM,4854
+puzzle_solver/puzzles/minesweeper/minesweeper.py,sha256=vRckTvI5LeaWJ8PMG0applOQtiZWg430Sa3Sdf2RaW8,5865
+puzzle_solver/puzzles/mosaic/mosaic.py,sha256=T89tkyTbob3LT20vwY3hkkEtNi8bxp2_CLaVi1gzhBc,1974
+puzzle_solver/puzzles/n_queens/n_queens.py,sha256=ii1w0Pi0lcQz_XT1gkpNYlkWgwW_Jtvm0HL8OAg9fRY,4161
+puzzle_solver/puzzles/nonograms/nonograms.py,sha256=Q-VHI0IPR2igccnE617HPThj5tnBgt27MiLWIZPtYcI,5587
+puzzle_solver/puzzles/nonograms/nonograms_colored.py,sha256=XpxzpJw0GA-tE7PiltlA-dfypaTvqNIDLnKl1LxIjD4,10500
+puzzle_solver/puzzles/norinori/norinori.py,sha256=ZEDWrD7zvEuqXOdXGOrELh1n_mWzhzZa3chs6Zqd3Pc,4570
+puzzle_solver/puzzles/number_path/number_path.py,sha256=3m-3rdcZCXHSRspAWYlDq9GIUGmvO6SgDtRn4jsVsSc,4468
+puzzle_solver/puzzles/numbermaze/numbermaze.py,sha256=xcr-fB7tjFVgWnZI4e0IBRmKLOdbf8XAOH_s7h-baY0,6095
+puzzle_solver/puzzles/nurikabe/nurikabe.py,sha256=hX0VcjPwO8PfY2kiIpQV45FWIvKRosFebk588tp5wzk,6603
+puzzle_solver/puzzles/palisade/palisade.py,sha256=rUYI39DOxKu_XSJ-Y_mdQGpGM-YLgKw_kjDWes97ncQ,4701
+puzzle_solver/puzzles/pearl/pearl.py,sha256=slPVCzPObQLNk4EYqe55YR4JeRCUs07Mjdks1fWKZSY,6696
+puzzle_solver/puzzles/pipes/pipes.py,sha256=2HDHCWhD-fLYTRoJsx15gOrsgt_SbjlGF2QDS5UX6m8,4680
+puzzle_solver/puzzles/range/range.py,sha256=4qxueHR2A1tbtx1lgIzHBW7v-vtmydxr6k1KhX9VtB8,3060
+puzzle_solver/puzzles/rectangles/rectangles.py,sha256=6MuJHyw7woIljlqxt76zfhw8F2_2biKMFM7oiXdXZsg,7010
+puzzle_solver/puzzles/ripple_effect/ripple_effect.py,sha256=a-Va-nAoS81j6DMozg4vBtwrkyRVX7ybqK_ZYgbfU0U,4433
+puzzle_solver/puzzles/rooms/rooms.py,sha256=VDOo-uqSW_y0ErpKPXSv-gcoftt30MF71D_e0YPCIaE,4297
+puzzle_solver/puzzles/schurs_numbers/schurs_numbers.py,sha256=EXaHpRZVlUh8xCjRFAy38V1c-4dc3dLltwemBiNgtoQ,2836
+puzzle_solver/puzzles/shakashaka/shakashaka.py,sha256=SyyNVmSAkoZ0Ca-dupl2r7zcsGgnwiCK0vRrmlTncaM,9572
+puzzle_solver/puzzles/shingoki/shingoki.py,sha256=rhKRRUz1sCdIb3yflUAkmwXfCONYOB0AOmWKXs-NNn4,6893
+puzzle_solver/puzzles/signpost/signpost.py,sha256=38LlMvP5Fx4qrTXmw4aNCt3yUbG3fhdSk6-YXmhAHFg,3861
+puzzle_solver/puzzles/singles/singles.py,sha256=X9NygVPZG8WT03HzijlbbTwVsvcsk5H8tZHBjxRt5aU,2910
+puzzle_solver/puzzles/slant/slant.py,sha256=l4q9g0BfqQsA6zsySiemJC5iFsqsO6LoqTUqcTEqYEk,5897
+puzzle_solver/puzzles/slant/parse_map/parse_map.py,sha256=8thQxWbq0qjehKb2VzgUP22PGj-9n9djwbt3LGMVLJw,4811
+puzzle_solver/puzzles/slitherlink/slitherlink.py,sha256=cDAM-aLHschlWVfzx6TDt_TGklRvsCazBlhn5ZrCRb8,7119
+puzzle_solver/puzzles/snail/snail.py,sha256=KZq9gsGDhWwn8CsY1-kMjgc4lvycUEB4BLFe0qbVThs,4315
+puzzle_solver/puzzles/split_ends/split_ends.py,sha256=SkWFmQSSKEYItpI1dpgPGKVoMLRJifQ3dMKMLDNQBc4,5667
+puzzle_solver/puzzles/star_battle/star_battle.py,sha256=K0_iekluZlQs34jLb-KOYmL6ZsyVKjd5NInCwUXcXgs,3843
+puzzle_solver/puzzles/star_battle/star_battle_shapeless.py,sha256=lj05V0Y3A3NjMo1boMkPIwBhMtm6SWydjgAMeCf5EIo,225
+puzzle_solver/puzzles/stitches/stitches.py,sha256=wj9z9979FaVtp2hcVu3YDTGlxtwljoQNBgMMM5U3icc,6109
+puzzle_solver/puzzles/stitches/parse_map/parse_map.py,sha256=6BWrW2U2jnBeremQP2zEZA3V2Gu4K3TeTha8cBCylXs,11655
+puzzle_solver/puzzles/sudoku/sudoku.py,sha256=-vYpcoEuTcvvCyP9-yQTMmqVpljBTeu5mkHAXED9cRk,13272
+puzzle_solver/puzzles/suguru/suguru.py,sha256=pK7_ogW6SaqimMiZcZ-V0JgITbEvPnaTE_KUKiPoP_o,3077
+puzzle_solver/puzzles/suko/suko.py,sha256=22q0h5DO44tRjvy1HFbu_-msMf6D_JuxPtReZJjRQBY,3176
+puzzle_solver/puzzles/tapa/tapa.py,sha256=UkOFhVoBn_Z3ssbdjpoTbTiEuKjrEJAROqd8CMQ9_-M,5319
+puzzle_solver/puzzles/tatami/tatami.py,sha256=9AiIj3-8Hb6rlSdXyBTaQ9U5FvwN3NRLt3Z683Yb9HQ,3993
+puzzle_solver/puzzles/tents/tents.py,sha256=RRNJ9uafrGyI_SYtNpw9CfbNlKeYfMA5K472w8mujf8,4941
+puzzle_solver/puzzles/thermometers/thermometers.py,sha256=bGcVmpPeqL5AJtj8jkK8gYThzv9aGCd_QrWEiYBCA2s,4011
+puzzle_solver/puzzles/towers/towers.py,sha256=t019GNQooeMC_XvuxRqZjoZUrPhHZP7WIEQTAl9NjwY,4733
+puzzle_solver/puzzles/tracks/tracks.py,sha256=oJuMaF1oeh5moXl_TABFxpKBsDdwcGI9BvG3dm5J0NY,4903
+puzzle_solver/puzzles/trees_logic/trees_logic.py,sha256=bHLH1OPncGmOTQzsRgk6lQFQgaTBrzrIA1AkKECPN24,2787
+puzzle_solver/puzzles/troix/dumplings.py,sha256=75GuHf2QS50u9Y2MAvjxt_5_xoS0jkN0XvFslNOM7uc,189
+puzzle_solver/puzzles/troix/troix.py,sha256=TdWSm4YOSaBY9ehp5mgxkO54HMlSfCQLV-FvBDIbaWA,4240
+puzzle_solver/puzzles/twiddle/twiddle.py,sha256=3gPoeD0DoiiZbIhtptdXFldO_t1QShL6IxkDqJMzjkk,5446
+puzzle_solver/puzzles/undead/undead.py,sha256=Gv6oPs2j2BLMN58FL96_V50ImWLmR_VPwF3owlPJEsY,5748
+puzzle_solver/puzzles/unequal/unequal.py,sha256=ExY2XDCrqROCDpRLfHo8uVr1zuli1QvbCdNCiDhlCac,6978
+puzzle_solver/puzzles/unruly/unruly.py,sha256=_C6FhYm9rqwhlQa6TMTxYr3rWcP_QS-E93xo86CZQjg,2846
+puzzle_solver/puzzles/vectors/vectors.py,sha256=kq0dB7JbtJaisFYu2WEkzwNiT-n6luP-fdVC8w0bCZY,4825
+puzzle_solver/puzzles/vermicelli/vermicelli.py,sha256=C95Fklf9UAuELXmlMUfeVxS13rUUxVAkrmtqsBpm-6M,3904
+puzzle_solver/puzzles/walls/walls.py,sha256=JPV8uQg4zq6UsDzB0MhdB9SqP8kb5ANaiytkEMBGi1Q,3044
+puzzle_solver/puzzles/yajilin/yajilin.py,sha256=2_0nZzrWAvmuYVZ9KRH7T-XTdZU7iuwQggp2M8MIHuA,5226
+puzzle_solver/puzzles/yin_yang/yin_yang.py,sha256=D0JacUdK5yPrfScmGqX-p8144VbwxfDgIaqF8hwLXlM,5039
+puzzle_solver/puzzles/yin_yang/parse_map/parse_map.py,sha256=drjfoHqmFf6U-ZQUwrBbfGINRxDQpgbvy4U3D9QyMhM,6617
+puzzle_solver/utils/visualizer.py,sha256=T2g5We9J3tkhyXWoN2OrIDIJDjt6w5sDd2ksOub0ZI8,6819
+puzzle_solver/utils/etc/parser/board_color_digit.py,sha256=EnF1Cs72DiNPYbTrLyNkE8OiiijGF59yC7vrai5Biho,15627
+multi_puzzle_solver-1.1.8.dist-info/METADATA,sha256=0D7be2kfV2f1160j3WFWhjgzRcTCbv48bhjK2NvAog8,326933
+multi_puzzle_solver-1.1.8.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+multi_puzzle_solver-1.1.8.dist-info/top_level.txt,sha256=exwVUQa-anK9vYrpKzBPvH8bX43iElWI4VeNiAyBGJY,14
+multi_puzzle_solver-1.1.8.dist-info/RECORD,,

multi_puzzle_solver-1.1.8.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (80.9.0)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

multi_puzzle_solver-1.1.8.dist-info/top_level.txt

@@ -0,0 +1 @@
+puzzle_solver

puzzle_solver/__init__.py

@@ -0,0 +1,184 @@
+from puzzle_solver.puzzles.abc_view import abc_view as abc_view_solver
+from puzzle_solver.puzzles.aquarium import aquarium as aquarium_solver
+from puzzle_solver.puzzles.area_51 import area_51 as area_51_solver
+from puzzle_solver.puzzles.battleships import battleships as battleships_solver
+from puzzle_solver.puzzles.binairo import binairo as binairo_solver
+from puzzle_solver.puzzles.binairo import binairo_plus as binairo_plus_solver
+from puzzle_solver.puzzles.black_box import black_box as black_box_solver
+from puzzle_solver.puzzles.branches import branches as branches_solver
+from puzzle_solver.puzzles.bridges import bridges as bridges_solver
+from puzzle_solver.puzzles.chess_range import chess_range as chess_range_solver
+from puzzle_solver.puzzles.chess_range import chess_solo as chess_solo_solver
+from puzzle_solver.puzzles.chess_range import chess_melee as chess_melee_solver
+from puzzle_solver.puzzles.circle_9 import circle_9 as circle_9_solver
+from puzzle_solver.puzzles.clouds import clouds as clouds_solver
+from puzzle_solver.puzzles.connect_the_dots import connect_the_dots as connect_the_dots_solver
+from puzzle_solver.puzzles.cow_and_cactus import cow_and_cactus as cow_and_cactus_solver
+from puzzle_solver.puzzles.dominosa import dominosa as dominosa_solver
+from puzzle_solver.puzzles.troix import dumplings as dumplings_solver
+from puzzle_solver.puzzles.filling import filling as filling_solver
+from puzzle_solver.puzzles.flood_it import flood_it as flood_it_solver
+from puzzle_solver.puzzles.flip import flip as flip_solver
+from puzzle_solver.puzzles.galaxies import galaxies as galaxies_solver
+from puzzle_solver.puzzles.guess import guess as guess_solver
+from puzzle_solver.puzzles.heyawake import heyawake as heyawake_solver
+from puzzle_solver.puzzles.hidden_stars import hidden_stars as hidden_stars_solver
+from puzzle_solver.puzzles.hidoku import hidoku as hidoku_solver
+from puzzle_solver.puzzles.inertia import inertia as inertia_solver
+from puzzle_solver.puzzles.kakurasu import kakurasu as kakurasu_solver
+from puzzle_solver.puzzles.kakuro import kakuro as kakuro_solver
+from puzzle_solver.puzzles.keen import keen as keen_solver
+from puzzle_solver.puzzles.kropki import kropki as kropki_solver
+from puzzle_solver.puzzles.kakuro import krypto_kakuro as krypto_kakuro_solver
+from puzzle_solver.puzzles.light_up import light_up as light_up_solver
+from puzzle_solver.puzzles.linesweeper import linesweeper as linesweeper_solver
+from puzzle_solver.puzzles.link_a_pix import link_a_pix as link_a_pix_solver
+from puzzle_solver.puzzles.magnets import magnets as magnets_solver
+from puzzle_solver.puzzles.map import map as map_solver
+from puzzle_solver.puzzles.mathema_grids import mathema_grids as mathema_grids_solver
+from puzzle_solver.puzzles.mathrax import mathrax as mathrax_solver
+from puzzle_solver.puzzles.minesweeper import minesweeper as minesweeper_solver
+from puzzle_solver.puzzles.mosaic import mosaic as mosaic_solver
+from puzzle_solver.puzzles.n_queens import n_queens as n_queens_solver
+from puzzle_solver.puzzles.nonograms import nonograms as nonograms_solver
+from puzzle_solver.puzzles.nonograms import nonograms_colored as nonograms_colored_solver
+from puzzle_solver.puzzles.norinori import norinori as norinori_solver
+from puzzle_solver.puzzles.number_path import number_path as number_path_solver
+from puzzle_solver.puzzles.numbermaze import numbermaze as numbermaze_solver
+from puzzle_solver.puzzles.nurikabe import nurikabe as nurikabe_solver
+from puzzle_solver.puzzles.palisade import palisade as palisade_solver
+from puzzle_solver.puzzles.lits import lits as lits_solver
+from puzzle_solver.puzzles.pearl import pearl as pearl_solver
+from puzzle_solver.puzzles.pipes import pipes as pipes_solver
+from puzzle_solver.puzzles.range import range as range_solver
+from puzzle_solver.puzzles.rectangles import rectangles as rectangles_solver
+from puzzle_solver.puzzles.ripple_effect import ripple_effect as ripple_effect_solver
+from puzzle_solver.puzzles.rooms import rooms as rooms_solver
+from puzzle_solver.puzzles.schurs_numbers import schurs_numbers as schurs_numbers_solver
+from puzzle_solver.puzzles.shakashaka import shakashaka as shakashaka_solver
+from puzzle_solver.puzzles.shingoki import shingoki as shingoki_solver
+from puzzle_solver.puzzles.signpost import signpost as signpost_solver
+from puzzle_solver.puzzles.singles import singles as singles_solver
+from puzzle_solver.puzzles.slant import slant as slant_solver
+from puzzle_solver.puzzles.slitherlink import slitherlink as slitherlink_solver
+from puzzle_solver.puzzles.snail import snail as snail_solver
+from puzzle_solver.puzzles.split_ends import split_ends as split_ends_solver
+from puzzle_solver.puzzles.star_battle import star_battle as star_battle_solver
+from puzzle_solver.puzzles.star_battle import star_battle_shapeless as star_battle_shapeless_solver
+from puzzle_solver.puzzles.stitches import stitches as stitches_solver
+from puzzle_solver.puzzles.sudoku import sudoku as sudoku_solver
+from puzzle_solver.puzzles.suguru import suguru as suguru_solver
+from puzzle_solver.puzzles.suko import suko as suko_solver
+from puzzle_solver.puzzles.tapa import tapa as tapa_solver
+from puzzle_solver.puzzles.tatami import tatami as tatami_solver
+from puzzle_solver.puzzles.tents import tents as tents_solver
+from puzzle_solver.puzzles.thermometers import thermometers as thermometers_solver
+from puzzle_solver.puzzles.towers import towers as towers_solver
+from puzzle_solver.puzzles.tracks import tracks as tracks_solver
+from puzzle_solver.puzzles.trees_logic import trees_logic as trees_logic_solver
+from puzzle_solver.puzzles.troix import troix as troix_solver
+from puzzle_solver.puzzles.twiddle import twiddle as twiddle_solver
+from puzzle_solver.puzzles.undead import undead as undead_solver
+from puzzle_solver.puzzles.unequal import unequal as unequal_solver
+from puzzle_solver.puzzles.unruly import unruly as unruly_solver
+from puzzle_solver.puzzles.vectors import vectors as vectors_solver
+from puzzle_solver.puzzles.vermicelli import vermicelli as vermicelli_solver
+from puzzle_solver.puzzles.walls import walls as walls_solver
+from puzzle_solver.puzzles.yajilin import yajilin as yajilin_solver
+from puzzle_solver.puzzles.yin_yang import yin_yang as yin_yang_solver
+
+from puzzle_solver.puzzles.inertia.parse_map.parse_map import main as inertia_image_parser
+
+__all__ = [
+    abc_view_solver,
+    aquarium_solver,
+    area_51_solver,
+    battleships_solver,
+    binairo_solver,
+    binairo_plus_solver,
+    black_box_solver,
+    branches_solver,
+    bridges_solver,
+    chess_range_solver,
+    chess_solo_solver,
+    chess_melee_solver,
+    circle_9_solver,
+    clouds_solver,
+    connect_the_dots_solver,
+    cow_and_cactus_solver,
+    dominosa_solver,
+    dumplings_solver,
+    filling_solver,
+    flood_it_solver,
+    flip_solver,
+    galaxies_solver,
+    guess_solver,
+    heyawake_solver,
+    hidden_stars_solver,
+    hidoku_solver,
+    inertia_solver,
+    kakurasu_solver,
+    kakuro_solver,
+    keen_solver,
+    kropki_solver,
+    krypto_kakuro_solver,
+    light_up_solver,
+    linesweeper_solver,
+    link_a_pix_solver,
+    magnets_solver,
+    map_solver,
+    mathema_grids_solver,
+    mathrax_solver,
+    minesweeper_solver,
+    mosaic_solver,
+    n_queens_solver,
+    nonograms_solver,
+    norinori_solver,
+    number_path_solver,
+    numbermaze_solver,
+    nonograms_colored_solver,
+    nurikabe_solver,
+    palisade_solver,
+    lits_solver,
+    pearl_solver,
+    pipes_solver,
+    range_solver,
+    rectangles_solver,
+    ripple_effect_solver,
+    rooms_solver,
+    schurs_numbers_solver,
+    shakashaka_solver,
+    shingoki_solver,
+    signpost_solver,
+    singles_solver,
+    slant_solver,
+    slitherlink_solver,
+    snail_solver,
+    split_ends_solver,
+    star_battle_solver,
+    star_battle_shapeless_solver,
+    stitches_solver,
+    sudoku_solver,
+    suguru_solver,
+    suko_solver,
+    tapa_solver,
+    tatami_solver,
+    tents_solver,
+    thermometers_solver,
+    towers_solver,
+    tracks_solver,
+    trees_logic_solver,
+    troix_solver,
+    twiddle_solver,
+    undead_solver,
+    unequal_solver,
+    unruly_solver,
+    vectors_solver,
+    vermicelli_solver,
+    walls_solver,
+    yajilin_solver,
+    yin_yang_solver,
+    inertia_image_parser,
+]
+
+__version__ = '1.1.8'

puzzle_solver/core/utils.py

@@ -0,0 +1,298 @@
+from dataclasses import dataclass
+from typing import Tuple, Iterable, Union
+from enum import Enum
+
+import numpy as np
+
+
+class Direction(Enum):
+    UP = 1
+    DOWN = 2
+    LEFT = 3
+    RIGHT = 4
+
+class Direction8(Enum):
+    UP = 1
+    DOWN = 2
+    LEFT = 3
+    RIGHT = 4
+    UP_LEFT = 5
+    UP_RIGHT = 6
+    DOWN_LEFT = 7
+    DOWN_RIGHT = 8
+
+@dataclass(frozen=True, order=True)
+class Pos:
+    x: int
+    y: int
+
+    def __add__(self, other: 'Pos') -> 'Pos':
+        return get_pos(self.x + other.x, self.y + other.y)
+
+
+Shape = frozenset[Pos]  # a shape on the 2d board is just a set of positions
+
+
+def get_pos(x: int, y: int) -> Pos:
+    return Pos(x=x, y=y)
+
+
+def get_next_pos(cur_pos: Pos, direction: Union[Direction, Direction8]) -> Pos:
+    delta_x, delta_y = get_deltas(direction)
+    return get_pos(cur_pos.x+delta_x, cur_pos.y+delta_y)
+
+
+def get_ray(pos: Pos, direction: Union[Direction, Direction8], V: int, H: int, include_self: bool = False) -> list[Pos]:
+    out = []
+    if include_self:
+        out.append(pos)
+    while True:
+        pos = get_next_pos(pos, direction)
+        if not in_bounds(pos, V, H):
+            break
+        out.append(pos)
+    return out
+
+
+def get_neighbors4(pos: Pos, V: int, H: int, include_self: bool = False) -> Iterable[Pos]:
+    if include_self:
+        yield pos
+    for dx, dy in ((1,0),(-1,0),(0,1),(0,-1)):
+        p2 = get_pos(x=pos.x+dx, y=pos.y+dy)
+        if in_bounds(p2, V, H):
+            yield p2
+
+
+def get_neighbors8(pos: Pos, V: int, H: int, include_self: bool = False) -> Iterable[Pos]:
+    for dx in [-1, 0, 1]:
+        for dy in [-1, 0, 1]:
+            if not include_self and (dx, dy) == (0, 0):
+                continue
+            d_pos = get_pos(x=pos.x+dx, y=pos.y+dy)
+            if in_bounds(d_pos, V, H):
+                yield d_pos
+
+
+def get_row_pos(row_idx: int, H: int) -> Iterable[Pos]:
+    for x in range(H):
+        yield get_pos(x=x, y=row_idx)
+
+
+def get_col_pos(col_idx: int, V: int) -> Iterable[Pos]:
+    for y in range(V):
+        yield get_pos(x=col_idx, y=y)
+
+
+def get_all_pos(V: int, H: int) -> Iterable[Pos]:
+    for y in range(V):
+        for x in range(H):
+            yield get_pos(x=x, y=y)
+
+
+def get_all_pos_to_idx_dict(V: int, H: int) -> dict[Pos, int]:
+    return {get_pos(x=x, y=y): y*H+x for y in range(V) for x in range(H)}
+
+
+def get_char(board: np.array, pos: Pos) -> str:
+    return board[pos.y][pos.x]
+
+
+def set_char(board: np.array, pos: Pos, char: str):
+    board[pos.y][pos.x] = char
+
+
+def in_bounds(pos: Pos, V: int, H: int) -> bool:
+    return 0 <= pos.y < V and 0 <= pos.x < H
+
+
+def get_opposite_direction(direction: Union[Direction, Direction8]) -> Union[Direction, Direction8]:
+    if direction == Direction.RIGHT:
+        return Direction.LEFT
+    elif direction == Direction.LEFT:
+        return Direction.RIGHT
+    elif direction == Direction.DOWN:
+        return Direction.UP
+    elif direction == Direction.UP:
+        return Direction.DOWN
+    elif direction == Direction8.RIGHT:
+        return Direction8.LEFT
+    elif direction == Direction8.LEFT:
+        return Direction8.RIGHT
+    elif direction == Direction8.DOWN:
+        return Direction8.UP
+    elif direction == Direction8.UP:
+        return Direction8.DOWN
+    elif direction == Direction8.UP_LEFT:
+        return Direction8.DOWN_RIGHT
+    elif direction == Direction8.UP_RIGHT:
+        return Direction8.DOWN_LEFT
+    elif direction == Direction8.DOWN_LEFT:
+        return Direction8.UP_RIGHT
+    elif direction == Direction8.DOWN_RIGHT:
+        return Direction8.UP_LEFT
+    else:
+        raise ValueError(f'invalid direction: {direction}')
+
+
+def get_deltas(direction: Union[Direction, Direction8]) -> Tuple[int, int]:
+    if direction == Direction.RIGHT or direction == Direction8.RIGHT:
+        return +1, 0
+    elif direction == Direction.LEFT or direction == Direction8.LEFT:
+        return -1, 0
+    elif direction == Direction.DOWN or direction == Direction8.DOWN:
+        return 0, +1
+    elif direction == Direction.UP or direction == Direction8.UP:
+        return 0, -1
+    elif direction == Direction8.UP_LEFT:
+        return -1, -1
+    elif direction == Direction8.UP_RIGHT:
+        return +1, -1
+    elif direction == Direction8.DOWN_LEFT:
+        return -1, +1
+    elif direction == Direction8.DOWN_RIGHT:
+        return +1, +1
+    else:
+        raise ValueError(f'invalid direction: {direction}')
+
+
+def polyominoes(N) -> set[Shape]:
+    """Generate all polyominoes of size N. Every rotation and reflection is considered different and included in the result.
+    Translation is not considered different and is removed from the result (otherwise the result would be infinite).
+
+    Below is the number of unique polyominoes of size N (not including rotations and reflections) and the lenth of the returned result (which includes all rotations and reflections)
+    N	name		#shapes		#results
+    1	monomino	1			1
+    2	domino		1			2
+    3	tromino		2			6
+    4	tetromino	5			19
+    5	pentomino	12			63
+    6	hexomino	35			216
+    7	heptomino	108			760
+    8	octomino	369			2,725
+    9	nonomino	1,285		9,910
+    10	decomino	4,655		36,446
+    11	undecomino	17,073		135,268
+    12	dodecomino	63,600		505,861
+    Source: https://en.wikipedia.org/wiki/Polyomino
+
+    Args:
+        N (int): The size of the polyominoes to generate.
+
+    Returns:
+        set[(frozenset[Pos], int)]: A set of all polyominoes of size N (rotated and reflected up to D4 symmetry).
+    """
+    assert N >= 1, 'N cannot be less than 1'
+    # need a frozenset because regular sets are not hashable
+    FastShape = frozenset[Tuple[int, int]]
+    shapes: set[FastShape] = {frozenset({(0, 0)})}
+    for i in range(1, N):
+        next_shapes: set[FastShape] = set()
+        directions = ((1,0),(-1,0),(0,1),(0,-1)) if i > 1 else (((1,0),(0,1)))  # cannot take left on first step, if confused read: https://louridas.github.io/rwa/assignments/polyominoes/
+        for s in shapes:
+            # frontier of a single shape: all 4-neighbors of existing cells not already in the shape
+            frontier = set()
+            for x, y in s:
+                # only need to consider 3 directions and neighbors condition is (n.y > 0 or (n.y == 0 and n.x >= 0)) it's obvious if you plot it
+                # if confused read: https://louridas.github.io/rwa/assignments/polyominoes/
+                for dx, dy in directions:
+                    n = (x + dx, y + dy)
+                    if n not in s and (n[1] > 0 or (n[1] == 0 and n[0] >= 0)):
+                        frontier.add(n)
+            for cell in frontier:
+                t = s | {cell}
+                # normalize by translation only: shift so min x,y is (0,0). This removes translational symmetries.
+                minx = min(x for x, y in t)
+                miny = min(y for x, y in t)
+                t0 = frozenset((x - minx, y - miny) for x, y in t)
+                next_shapes.add(t0)
+        shapes = next_shapes
+    # shapes is now complete, now classify up to D4 symmetry (rotations/reflections), translations ignored
+    shapes = {frozenset(Pos(x, y) for x, y in s) for s in shapes}  # regular class, not the dirty-fast one
+    return shapes
+
+
+def polyominoes_with_shape_id(N):
+    """Refer to polyominoes() for more details. This function returns a set of all polyominoes of size N (rotated and reflected up to D4 symmetry) along with a unique ID for each polyomino that is unique up to D4 symmetry.
+    Args:
+        N (int): The size of the polyominoes to generate.
+
+    Returns:
+        set[(frozenset[Pos], int)]: A set of all polyominoes of size N (rotated and reflected up to D4 symmetry) along with a unique ID for each polyomino that is unique up to D4 symmetry.
+    """
+    FastPos = Tuple[int, int]
+    FastShape = frozenset[Tuple[int, int]]
+    shapes = polyominoes(N)
+    shapes = {frozenset((p.x, p.y) for p in s) for s in shapes}
+    mats = (
+        ( 1, 0,  0, 1),  # regular
+        (-1, 0,  0, 1),  # reflect about x
+        ( 1, 0,  0,-1),  # reflect about y
+        (-1, 0,  0,-1),  # reflect about x and y
+        # trnaspose then all 4 above
+        ( 0, 1,  1, 0), ( 0, 1, -1, 0), ( 0,-1,  1, 0), ( 0,-1, -1, 0),
+    )
+    # compute canonical representative for each shape (lexicographically smallest normalized transform)
+    shape_to_canon: dict[FastShape, tuple[FastPos, ...]] = {}
+    for s in shapes:
+        reps: list[tuple[FastPos, ...]] = []
+        for a, b, c, d in mats:
+            pts = {(a*x + b*y, c*x + d*y) for x, y in s}
+            minx = min(x for x, y in pts)
+            miny = min(y for x, y in pts)
+            rep = tuple(sorted((x - minx, y - miny) for x, y in pts))
+            reps.append(rep)
+        canon = min(reps)
+        shape_to_canon[s] = canon
+
+    canon_set = set(shape_to_canon.values())
+    canon_to_id = {canon: i for i, canon in enumerate(sorted(canon_set))}
+    result = {(s, canon_to_id[shape_to_canon[s]]) for s in shapes}
+    result = {(frozenset(Pos(x, y) for x, y in s), _id) for s, _id in result}
+    return result
+
+
+def shapes_between(A_pos: Pos, B_pos: Pos, N: int) -> set[Shape]:
+    """Return all shapes of size N where it is possible to draw a path from A to B covering all cells in the shape."""
+    def manhattan(p: tuple[int, int], q: tuple[int, int]) -> int:
+        return abs(p[0] - q[0]) + abs(p[1] - q[1])
+    def is_possible(p: tuple[int, int], q: tuple[int, int], steps_needed: int) -> bool:
+        """Returns whether it's possible to reach q from p in exactly steps_needed steps. Looks at manhattan distance and parity."""
+        dist = manhattan(p, q)
+        return dist <= steps_needed and (steps_needed - dist) % 2 == 0  # the %2 checks parity (i.e. when its false every possible path will overshoot or undershoot B by 1)
+
+    A, B = (A_pos.x, A_pos.y), (B_pos.x, B_pos.y)
+    ax, ay = A
+    bx, by = B
+    min_steps_needed = N - 1
+    # how far we're allowed to wander away from the A-B box
+    slack = (min_steps_needed - manhattan(A, B)) // 2
+    x_min = min(ax, bx) - slack
+    x_max = max(ax, bx) + slack
+    y_min = min(ay, by) - slack
+    y_max = max(ay, by) + slack
+    results: set[Shape] = set()
+    path: list[tuple[int, int]] = [A]
+    visited = {A}
+
+    def dfs(curr: tuple[int, int], cells_used: int):
+        moves_left = N - cells_used
+        if not is_possible(curr, B, moves_left):
+            return
+        if curr == B:
+            if cells_used == N:  # we've reached B and have exactly N cells, this is a wanted shape!
+                results.add(frozenset(get_pos(x=x, y=y) for x, y in path))
+            return
+        x, y = curr
+        for nx, ny in ((x+1, y), (x-1, y), (x, y+1), (x, y-1)):
+            if not (x_min <= nx <= x_max and y_min <= ny <= y_max):
+                continue
+            nxt = (nx, ny)
+            if nxt in visited:
+                continue
+            visited.add(nxt)
+            path.append(nxt)
+            dfs(nxt, cells_used + 1)
+            path.pop()
+            visited.remove(nxt)
+    dfs(A, 1)
+    return results