{"data":{"full_name":"tex216/Block-World","name":"Block-World","description":"Python program that implements an agent that can solve Block World problems optimally (in the minimum number of moves) for an arbitrary initial arrangement of blocks (A-Z, 26 blocks maximum) using Generate & Test and Means-Ends Analysis techniques.","stars":8.0,"forks":6.0,"language":"Python","license":null,"archived":0.0,"subcategory":"pathfinding-algorithm-implementations","last_pushed_at":"2021-08-28T21:13:49+00:00","pypi_package":null,"npm_package":null,"downloads_monthly":0.0,"dependency_count":0.0,"commits_30d":null,"reverse_dep_count":0.0,"maintenance_score":0.0,"adoption_score":4.0,"maturity_score":1.0,"community_score":16.0,"quality_score":21.0,"quality_tier":"experimental","risk_flags":"['no_license', 'stale_6m', 'no_package', 'no_dependents']"},"meta":{"timestamp":"2026-04-07T08:33:09.328537+00:00"}}