{"version":"1.0","type":"rich","title":"Acht Königinnen","description":"This visualization solves the eight queens puzzle by generating all 64 single-queen board states, encoding each as a string of characters, and computing pairwise compatibility between states. It then recursively narrows down combinations of queens that do not attack each other, printing each valid solution as a grid of \"Q\" (queen), \"O\" (free), and \"X\" (attacked) cells. The code uses Python’s `reduce` for flattening state lists and standard list comprehensions to filter compatible states, with no external visualization libraries. The final output lists all 92 solutions, counting them via a simple loop.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-9163834?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}