text:
Talk:Royal and noble styles

Various
I call dibs on the transformation of Roman military titles> Germanic military titles > Germanic (i.e. medieval) heritable titles....at least till the 10th c.!! (Unless somebody else really wants it) JHK

Virtually empty article erased:

 * The titles -- styles -- of royalty, nobility, and gentry are subject to many difficulties. To some extent styles are both a matter of legal reality and of self representation.

 * topics to explore:

 * common titles of nobility - their origins
 * titles as heritable
 * titles as propaganda claims
 * the use of styles of nobility in Meiji Japan
 * the abolition of all titles (in some countries) in the modern era

-- Ruhrjung 13:35 29 May 2003 (UTC)

Well, I see that this was, in fact, an article at one point. If anyone wants to contribute, please do - there's much that could be done here. john 07:04 3 Jun 2003 (UTC)

--- What if anything can we add concerning the local princes here in Saudi Arabia? Some are HRH and others are just HH. There must be some sort of system. Paul, in Saudi

 * Hmm, no idea. I'd imagine something like children of a King are "HRH", and others are "HH", but don't quote me on that.  john 18:34, 30 Jan 2004 (UTC)

Template:Infobox hrhstyles etc
Templates Infobox hrhstyles, Infobox scotlandkingstyles, Infobox_UKkingstyles and Infobox consortstyles have been listed for deletion. To comment on this, visit Wikipedia:Templates for deletion. — OwenBlacker 03:26, 2 January 2007 (UTC)

Archdukes of Austria
The article states that members of the Imperial house of Austria bore the traditional style "königliche und kaiserliche Hoheit". However, I just came across the style "kaiserliche und königliche Hoheit". Could someone back up this statement with a proper source. Gugganij 18:04, 26 August 2007 (UTC)

 * It is probably just a case of someone mixing the order up. They mean the same thing, basically. Charles 18:38, 26 August 2007 (UTC)

Hohenzollern Heir
In the Hohenzollern family, how come only the heir was given the style Imperial and Royal Highness? Why not the whole family like the Habsburgs? Emperor001 (talk) 19:41, 7 January 2008 (UTC)

 * Because in the German Empire, only the German Emperor, German Empress, German Crown Prince and German Crown Princess held titles of imperial status, much like in the United Kingdom where the king and queen were Emperor and Empress of India without the rest of the family having Indian titles. The Prussian Royal Family did not have the titles "German Prince" or "Prince of Germany" and therefore did not constitute part of the Imperial Family unless they had one of the four previously mentioned titles. The heir of the family, as titular German Emperor, is entitled to an imperial style. Charles 22:24, 3 April 2008 (UTC)

Merger proposal
I have suggested merging The Most High, Noble and Potent Prince and The Most Noble and Puissant Prince to Royal and noble styles and Hochwohlgeboren to Royal and noble styles, simply because those pages are this page is covered entirely by the scope of this article and they are little more than stubs which are is little more than a stub which is unlikely to expand further than what they are it is now. Unlike Highness, which has many, many derivatives, these styles are relatively few and this style is a single, simple form with few derivatives best dealt with on this page. Charles 22:13, 3 April 2008 (UTC)

 * All done. Charles 22:30, 3 April 2008 (UTC)

 * Undone now, apparently. Cameron, please be sure to post on this page. Charles 16:27, 4 April 2008 (UTC)
 * Hochwohlgeboren has been, and still is, an important part of German society. It merits an article of its own and should not be merged (especially if one doesn't transfer all the information so as to make sure that nothing goes lost). --Cameron (t|p|c) 16:52, 4 April 2008 (UTC)

French Style
If that is of any relevance here, the current styling of French nobility is the following : — Preceding unsigned comment added by 2A01:E35:2FDA:B5E0:FC34:F0B3:9580:7384 (talk) 22:20, 31 August 2017 (UTC)
 * Members of the royal family : Monseigneur
 * Dukes : Monsieur le Duc
 * Other nobility titles : depending on who adresses them; another member of the nobility (or socially similar persons) would call them Monsieur, other people would call them Monsieur + their title (Monsieur le Marquis, Monsieur le Comte, etc.). The latter being however very seldom used nowadays

nobility bearing the title of "Prince" (who are not royalty of highness)

 * Dukes and duchesses in the peerages of England, Scotland, Great Britain, Ireland, and the United Kingdom, as well as nobility bearing the title of "Prince" (who are not royalty of highness) bear the style of Grace, e.g. "His Grace", "Your Grace".

The Prince part is obscure. Is this about foreign princes? Or is it obsolete because there are (now) no non-royal princes in Britain? —Tamfang (talk) 22:56, 8 December 2017 (UTC)
 * There never have been any non royal UK princes. There was/is an ultra formal style of address where certain peers were styled 'prince' but they were not actual princes its was merely a style. Garlicplanting (talk) 11:06, 20 January 2018 (UTC)

Translations from French
Please note My Lord cannot be a translation for Monseigneur, even if Lord is a translation for Seigneur'. Monseigneur is used to style people of high rank (princes and, after the 19th c., bishops), while Mylord is used for non-royal noblemen. As it happens, "my lord" is never translated in French, as it would confuse a french speaker. Same works for "monseigneur". Sir for Monsieur is even more confusing, as in english Sir is never used in conjunction with a title ("Sir Duke" does not exist). 217.167.255.177 (talk) 07:53, 27 August 2018 (UTC)

Requested move 13 January 2020

 * The following discussion is an archived discussion of a requested move. Please do not modify it. Subsequent comments should be made in a new section on the talk page. No further edits should be made to this section.

Not moved. After much extended time for discussion, no consensus has arisen for any specific move from the current title. BD2412 T 18:16, 12 March 2020 (UTC)

Royal and noble styles → Imperial, royal and noble styles – Would this make sense? C.f. Categories for discussion/Log/2020 January 11. PPEMES (talk) 10:18, 13 January 2020 (UTC) —Relisting. Cwmhiraeth (talk) 11:57, 22 January 2020 (UTC) —Relisting.  Steel1943  (talk) 16:44, 14 February 2020 (UTC)

 * Oppose, and if anything, would support move to Noble styles. Royalty are members of the nobility, so "noble styles" already covers everything.  There's no need to include every subdivison and synonym for "noble."  SnowFire (talk) 15:19, 13 January 2020 (UTC)
 * No opinion on pluralization; would be fine with both Noble style or Noble styles. Per Dekimasu's comment, would also support consistency with the recently moved Royal and noble ranks / Imperial, royal and noble ranks, so move that to Noble rank / Noble ranks as well; same with Template:Imperial, royal, and noble styles.  SnowFire (talk) 19:34, 22 January 2020 (UTC)
 * Oppose. "Imperial" is just a subset of "noble" (in simple terms, being a king-of-kings instead of just a king).  I would also support Noble style per SnowFire's idea for even more concision (since "royal" is just a subset of "noble"), and using singular per WP:SINGULAR. However, I think that people in the royalty-obsessing crowd are going to come up with some kind of distinction to try to draw between "royal" and "noble". I've seen that come up several times before in other contexts, though I don't really buy the rationales that have been offered (it's a fallacy of equivocation; the fact that Definition A has a more particular meaning in very narrow Context X doesn't mean that when WP is writing in a broader context that only Definition A can be used, nor even that it's the one that the majority of readers will expect or even understand).  — SMcCandlish ☏ ¢ 😼  11:14, 21 January 2020 (UTC)
 * I'm puzzled. Would you mind referring to some sourced article realm content that supports the assertion that royalty would be considered part of nobility in English language? PPEMES (talk) 16:07, 21 January 2020 (UTC)
 * For English-speaking countries example: Title of Nobility Clause or Constitution_of_Ireland. Nobody thinks that this prevents only dukes and marquesses from being created, but would allow a King of the USA/Ireland and knights and such.  It covers everything, and the Framers are on record as explicitly not wanting kings / royalty, so that was the obvious, non-controversial intent.
 * What you might be referring to is that sure, "the nobility" can be a term contrasted with the actions of royalty where it really means "all the other nobles" ("Louis XIV clashed with the French nobility over centralization of power in Paris."). But everybody's still a noble, just some of them are also some shade of royalty.  This is especially clear with non-reigning members of noble houses of royal rank, e.g. the random extra kids who never got to be king but instead were "just" normal members of the nobility with dukedoms and the like that they gave to their kids.  SnowFire (talk) 19:34, 22 January 2020 (UTC)
 * Excuse, where in those links does offer support for assertion that royalty is a subset of nobility, please? Because I fail to identify any such quote. PPEMES (talk) 20:56, 22 January 2020 (UTC)

 * Comment. Cf. Imperial, royal and noble ranks, requested to be moved to that title a year ago by PPEMES and moved without objection. Dekimasu よ! 15:10, 22 January 2020 (UTC)
 * Support per WP:CONSISTENCY with Imperial, royal and noble ranks and also WP:PRECISE. I think it's very debatable whether royalty is part of nobility or not (our article on the subject defines it as "a social class normally ranked immediately under royalty" which implies royalty is not included). But either way, an ordinary reader would not be expected to know this and could reasonably expect a "Noble styles" article to only include those below royalty. The same with the royal/imperial distinction, so overall this is a good proposal. — Amakuru (talk) 22:29, 22 January 2020 (UTC)
 * oppose the proposed, Support Noble styles. The proposed is inconcise. Imperial is a subset of royal is a subset of noble. —SmokeyJoe (talk) 09:44, 9 March 2020 (UTC)
 * The above discussion is preserved as an archive of a requested move. Please do not modify it. Subsequent comments should be made in a new section on this talk page. No further edits should be made to this section.

title: Talk:Royal and noble styles


text:
Flash Gordon

Flash Gordon is the protagonist of a space adventure comic strip created and originally drawn by Alex Raymond. First published January 7, 1934, the strip was inspired by, and created to compete with, the already established Buck Rogers adventure strip.

Creation
The Buck Rogers comic strip had been commercially very successful, spawning novelizations and children's toys, and King Features Syndicate decided to create its own science fiction comic strip to compete with it. At first, King Features tried to purchase the rights to the John Carter of Mars stories by Edgar Rice Burroughs. However, the syndicate was unable to reach an agreement with Burroughs. King Features then turned to Alex Raymond, one of their staff artists, to create the story.

One source for Flash Gordon was the Philip Wylie novel When Worlds Collide (1933). The book's themes of an approaching planet threatening the Earth, and an athletic hero, his girlfriend, and a scientist traveling to the new planet by rocket, were adapted by Raymond for the comic strip's initial storyline. Raymond's first samples were dismissed for not containing enough action sequences. Raymond reworked the story and sent it back to the syndicate, which accepted it. Raymond was partnered with ghostwriter Don Moore, an experienced editor and writer. Raymond's first Flash Gordon story appeared in January 1934, alongside Jungle Jim. The Flash Gordon strip was well received by newspaper readers, becoming one of the most popular American comic strips of the 1930s.

As with Buck Rogers, the success of Flash Gordon resulted in numerous licensed products being sold, including pop-up books, coloring books, and toy spaceships and rayguns.

Comic strip characters and story
The Flash Gordon comic strip ran as a Sunday strip from 1934 until 2003, and daily strip from 1940 to 1944 and 1951 to 1992. Reprints of the Sunday strip were syndicated by King Features Syndicate from 2003 until 2023, when Flash Gordon was relaunched with a new daily and Sunday strip.

The comic strip follows the adventures of Flash Gordon, a handsome polo player and Yale University graduate, and his companions Dale Arden and Dr. Hans Zarkov. The story begins with Earth threatened by a collision with the planet Mongo. Dr. Zarkov invents a rocket ship to fly into space in an attempt to stop the disaster. Half mad, he kidnaps Flash and Dale. Landing on the planet, and halting the collision, they come into conflict with Ming the Merciless, Mongo's evil ruler.

For many years, the three companions have adventures on Mongo, traveling to the forest kingdom of Arboria, ruled by Prince Barin; the ice kingdom of Frigia, ruled by Queen Fria; the jungle kingdom of Tropica, ruled by Queen Desira; the undersea kingdom of the Shark Men, ruled by King Kala; and the flying city of the Hawkmen, ruled by Prince Vultan. They are joined in several early adventures by Prince Thun of the Lion Men. Eventually, Ming is overthrown, and Mongo is ruled by a council of leaders led by Barin.

Flash and friends visit Earth for a series of adventures before returning to Mongo and crashing in the kingdom of Tropica, later reuniting with Barin and others. Flash and his friends then travel to other worlds before returning once again to Mongo, where Barin, now married to Ming's daughter Princess Aura, has established a peaceful rule (except for frequent revolts led by Ming or by one of his many descendants).

In the 1950s, Flash became an astronaut who travelled to other planets besides Mongo. The long story of the Skorpi War takes Flash to other star systems, using starships that are faster than light.

In addition to Ming and his allies, Flash and his friends also fought several other villains, including Azura, the Witch Queen; Brukka, chieftain of the giants of Frigia; the fascistic Red Sword organisation on Earth; and Brazor, the tyrannical usurper of Tropica. After Raymond's tenure, later writers created new enemies for Flash to combat. Austin Briggs created Kang the Cruel, Ming's callous son. Prince Polon, who had the power to shrink or enlarge living creatures, the unscrupulous Queen Rubia, and Pyron the Comet Master were among the antagonists introduced during Mac Raboy's run. The Skorpi, a race of alien shape shifters who desired to conquer the galaxy, were recurring villains in both the Mac Raboy and Dan Barry stories. The Skorpi space-fighter ace Baron Dak-Tula became a periodic nemesis of Flash in the late 1970s stories.

International versions of the comic strip
King Features sold the Flash Gordon strip to newspapers across the world, and by the late 1930s, the strip was published in 130 newspapers, translated into eight foreign languages, and was read by 50 million people. In the 1930s and 1940s, several newspapers in Britain carried Flash Gordon, including the Scottish Sunday Mail. In France, his adventures were published in the magazine Robinson, under the name "Guy l'Éclair". Dale Arden was named Camille in the French translation. In Australia, the character and strip were retitled Speed Gordon to avoid a negative connotation of the word "Flash". (At the time, the predominant meaning of "flashy" was "showy", connoting dishonesty.)

However, events in the 1930s affected the strip's distribution. Newspapers in Nazi Germany were forbidden to carry the Flash Gordon strip, while in Fascist Italy it was restricted to two newspapers. In 1938, the Spanish magazine Aventurero, the only publication in the country to carry Flash Gordon, ceased publication because of the Spanish Civil War. The outbreak of World War II resulted in Flash Gordon being discontinued in many countries. In Belgium, artist Edgar Pierre Jacobs was therefore asked to bring the current Flash Gordon story to a satisfactory conclusion, which he did.

After the war's end, the strip enjoyed a resurgence in international popularity. Flash Gordon reappeared in Italy, Spain and West Germany, and it was also syndicated to new markets like Portugal and the Irish Republic. From the 1950s onward, countries like Spain, Italy and Denmark also reprinted Flash Gordon newspaper strips in comic book or paperback novel form. In India, Flash Gordon comics were published by Indrajal Comics.

Later years
The popularity of Raymond's Flash Gordon Sunday strip meant a daily strip was also introduced. This strip was drawn by Austin Briggs and ran from 1941 to 1944. After Raymond left Flash Gordon in 1944 to join the US Marines, the daily strip was cancelled and Briggs took over the Sunday strip. Although Raymond wanted to return to drawing Flash Gordon after the war's end, King Features did not want to remove Briggs from his position. To conciliate Raymond, King Features allowed him to create a new strip, Rip Kirby. After Briggs left the Sunday strip in 1948, he was succeeded by former comic book artist Mac Raboy, who drew the strip until his death in 1967. In 1951, King Features created a new daily Flash Gordon strip. This strip was drawn by Dan Barry. Barry was assisted during his tenure by Harvey Kurtzman and Harry Harrison, who both wrote scripts for the strip. Barry also had several artists who aided him with Flash Gordon's illustrations, including Frank Frazetta, Al Williamson, Bob Fujitani, Jack Davis, Sy Barry, Fred Kida and Emil Gershwin. When Barry left the strip in 1990, various artists and writers worked on Flash Gordon. The daily strip was ended in 1993. The final artist to work on the Flash Gordon Sunday strip was Jim Keefe. Keefe was occasionally assisted on the strip by other artists, including Williamson, John Romita Sr. and Joe Kubert. King Features ended the Flash Gordon newspaper strip in 2003, although re-runs of Keefe's strip still appear in a few US newspapers.

On October 20, 2023, it was announced that King Features Syndicate would relaunch Flash Gordon on October 22 under cartoonist Dan Schkade and will be released daily.

Strip bibliography

 * Sunday, Alex Raymond, 1934–1943 (with writer Don Moore, from 1935 onwards)
 * Daily, Austin Briggs, 1940–1944
 * Sunday, Austin Briggs, 1944–1948
 * Sunday, Mac Raboy, 1948–1967
 * Daily, Dan Barry, 1951–1990 (with writers Harvey Kurtzman, 1952–1953; and Harry Harrison, 1958–1964)
 * Sunday, Dan Barry, 1967–1990
 * Sunday and daily, Ralph Reese & Bruce Jones, Gray Morrow, 1990–1991
 * Sunday and daily, Thomas Warkentin & Andrés Klacik, 1991–1992
 * Sunday, Richard Bruning, Kevin VanHook, Thomas Warkentin & Andrés Klacik, 1992–1996
 * Sunday, Jim Keefe, 1996–2003
 * Sunday and daily, Dan Schkade, 2023–present

Unofficial
 * L'Avventuroso (Italy) – Guido Fantoni, 1938
 * Bravo (Belgium) – Edgar P. Jacobs, 1941

Critical reception and influence
Flash Gordon is regarded as one of the best illustrated and most influential of American adventure comic strips. Historian of science fiction art Jane Frank asserted that because of his work on Flash Gordon, "Raymond is one of the most famous science fiction artists of all time, although he never contributed an illustration to any science fiction magazine or book". Comic book artist Jerry Robinson has said "What made Flash Gordon a classic strip was Raymond's artistry and the rich imagination he brought to his conceptions of the future" and described the final years of Raymond's tenure on the strip as being characterized by "sleek, brilliantly polished brush work." The science fiction historian John Clute has stated that "The comics version of Flash Gordon was graceful, imaginative and soaring" and included it on a list of the most important American science fiction comics. In an article about Raymond for The Comics Journal, R.C. Harvey declared that Raymond's Flash Gordon displayed "a technical virtuosity matched on the comics pages only by Harold Foster in Prince Valiant". The Encyclopedia of Science Fiction stated that Flash Gordon's "elaborately shaded style and exotic storyline" made it one of the most influential comics, and that its art emphasized a "romantic baroque".

Flash Gordon (along with Buck Rogers) was a big influence on later science fiction comic strips, such as the American Don Dixon and the Hidden Empire (1935 to 1941) by Carl Pfeufer and Bob Moore. In Italy, Guido Fantoni drew Flash Gordon in 1938, after the prohibition by the fascist regime. In Belgium, Edgar P. Jacobs was commissioned to produce a science fiction comic strip in the style of Flash Gordon. Jacobs' new strip, Le Rayon U ("The U-Ray") began serial publication in Bravo in 1943. This version had text boxes which described the action and the dialogue, in the style of many Belgian comics of the time, similar to Hal Foster's version of Tarzan and Prince Valiant. In 1974, Jacobs reformatted Le Rayon U in order to include speech bubbles. This version was published in Tintin magazine and in book form by Dargaud-Le Lombard. The British comic The Trigan Empire, by Mike Butterworth and Don Lawrence, also drew on Flash Gordon for its artistic style. In Thailand Flash Gordon was a big influence for classic thai comics character Chaochaiphomthong (เจ้าชายผมทอง) (meaning "prince golden hair") a sword and magic hero created by Jullasak Amornvej in 1958.

Flash Gordon was also an influence on early superhero comics characters. Jerry Siegel and Joe Shuster based Superman's uniform of tights and a cape on costumes worn by Flash Gordon. Bob Kane's drawing of Batman on the cover of Detective Comics No. 27 (the first appearance of the character) was based on a 1937 Alex Raymond drawing of Flash Gordon. Dennis Neville modeled the comics hero Hawkman's costume on the "Hawkmen" characters in Raymond's Flash Gordon comic strip. In Avengers: Infinity War, Iron Man mockingly refers to Star-Lord as Flash Gordon due to their similar appearance and both being space heroes.

Scientist and track-and-field olympian Meredith C. Gourdine's nickname, "Flash" Gourdine, was based on Flash Gordon.

Films
Most of the Flash Gordon film and television adaptations retell the early adventures on the planet Mongo.

Film serials
Flash Gordon was featured in three serial films starring Buster Crabbe: Flash Gordon (1936), Flash Gordon's Trip to Mars (1938), and Flash Gordon Conquers the Universe (1940). The 1936 Flash Gordon serial was condensed into a feature-length film titled Flash Gordon or Rocket Ship or Space Soldiers or Flash Gordon: Spaceship to the Unknown; the 1938 serial into a feature-length film entitled Flash Gordon: The Deadly Ray from Mars; and the 1940 serial into a feature-length film entitled The Purple Death from Outer Space.

The first Flash Gordon serial remains copyrighted, but the compilation made of the second serial, and the third serial itself are in the public domain.

Flash Gordon 1980 film
In the 1970s, several noted directors attempted to make a film of the story. Federico Fellini optioned the Flash Gordon rights from Dino De Laurentiis, but never made the film. George Lucas also attempted to make a Flash Gordon film in the 1970s, but was unable to acquire the rights from De Laurentiis, so he decided to create Star Wars instead. De Laurentiis then hired Nicolas Roeg to make a Flash Gordon film, but was unhappy with Roeg's ideas, and Roeg left the project. De Laurentiis also discussed hiring Sergio Leone to helm the Flash Gordon film; Leone declined because he believed the script was not faithful to the original Raymond comic strips. Finally, De Laurentiis hired Mike Hodges to direct the Flash Gordon film.

Hodges' 1980 Flash Gordon film stars former Playgirl-centerfold Sam J. Jones in the title role. Its plot is based loosely on the first few years of the comic strip, revising Flash's backstory by making him the quarterback of the New York Jets instead of a polo player. Raymond's drawings feature heavily in the opening credits, as does the signature theme-song "Flash" by rock band Queen, who composed and performed the entire musical score.

Riding the coat-tails of Star Wars, Superman, and Star Trek: The Motion Picture, Flash Gordon was not a critical success on release. Melody Anderson co-starred with Jones as Dale Arden, alongside Chaim Topol as Dr. Hans Zarkov, Max von Sydow as Ming, Timothy Dalton as Prince Barin, Brian Blessed as Prince Vultan, Peter Wyngarde as Klytus and Ornella Muti as Princess Aura. Produced by Dino De Laurentiis, with ornate production designs and costumes by Danilo Donati, the bright colors and retro effects were inspired directly by the comic strip and 1930s serials.

Brian Blessed's performance as the Hawkman leader Prince Vultan lodged the veteran stage and screen actor into the collective consciousness for the utterance of a single line – "GORDON'S ALIVE?!" – which, more than 30 years later, remained the most repeated, reused, and recycled quotation from both the film and Blessed's career.

The film's cult status led it to feature heavily in the comedy films Ted (2012) and Ted 2 (2015) causing a resurgence in interest in the film.

Unofficial films
In 1967, a low-budget Turkish adaptation of the comic was made, called Flash Gordon's Battle in Space (Baytekin – Fezada Çarpisanlar in Turkish). Hasan Demirtag played Flash Gordan.

Robb Pratt, director of the popular fan film Superman Classic, made Flash Gordon Classic, released in May 2015. The traditionally animated short features the characters Flash Gordon, girlfriend Dale Arden, sidekick Dr. Hans Zarkov, antagonist Ming the Merciless, and Princess Aura.

Possible future films
In 2010, Breck Eisner expressed interest to direct a 3D film version of Flash Gordon. Since April 2014, 20th Century Fox was developing the Flash Gordon reboot with J. D. Payne and Patrick McKay writing the film's script. Matthew Vaughn was in talks to direct the film. Mark Protosevich was hired to rewrite the film's script. Julius Avery was later signed to write and direct film, with Vaughn as producer alongside John Davis. An animated film was under development at Disney/Fox with Taika Waititi writing and directing. In August 2019, the animated film was believed to be canceled, but in July 2021, producers John Davis and John Fox revealed that Waititi was still working on the film, albeit it would now be live action instead of animation.

Flash Gordon (1954–55 live-action)
Steve Holland starred in a 1954–55 live-action television series which ran for 39 episodes. The first 26 episodes had the distinction of being filmed in West Berlin, Germany, less than a decade after the end of World War II. This is notable, given that some episodes show the real-life destruction still evident in Germany several years after the war. The final 13 episodes were filmed in Marseille, France.

In this series, Flash, Dale (Irene Champlin) and Dr. Zarkov (Joseph Nash) worked for the Galactic Bureau of Investigation in the year 3203. The actual timeline was established in one episode, "Deadline at Noon", in which Flash, Dale and Dr. Zarkov went back in time to Berlin in the year 1953. The GBI agents traveled in the Skyflash and Skyflash II spaceships.

The series was syndicated, appearing on stations affiliated with the long-defunct DuMont Network, and many other independent stations in the United States. It was recut into a movie in 1957.

Flash Gordon animated (1979–82)
In 1979, Filmation produced an animated series, often referred to as The New Adventures of Flash Gordon, though it is actually titled Flash Gordon. The expanded title was used to distinguish it from previous versions. The project was originally designed as a television film but NBC decided to change it into an animated series.

Flash Gordon: The Greatest Adventure of All (1982)
Filmation produced this successful animated television movie, written by Star Trek writer Samuel A. Peeples, before they began their Saturday morning series, but the television movie did not actually air until 1982. It was critically well-received, and is considered one of the best film versions of Flash Gordon, though it would never be re-broadcast following its premiere.

This movie has yet to be commercially released in the United States, although some sources indicate that off-air bootlegs are prevalent. The only known commercial releases were by VAP Video in Japan (catalog #67019-128), in 1983, in both laserdisc and NTSC VHS videotape formats; and in Bulgaria, where it was released on VHS "Van Chris" and "Drakar". The movie also aired numerous times on "Diema" Channel in the late 1990s. In the Japanese release, it is presented uncut with the original English voice track, with Japanese subtitles added for its intended audience. At the movie's ending is a trailer for the De Laurentiis live-action movie, as well as trailers for other titles from the VAP Video library at the time. The covers for both versions feature comic-strip panels, using stills taken from the movie.

Defenders of the Earth (1986)
In the 1986 cartoon Defenders of the Earth, Flash teamed up with fellow King Features heroes The Phantom and Mandrake the Magician in 65 episodes. This series took extreme liberties with all the characters, revealing that Flash and Dale Arden had conceived a son, Rick Gordon, who is in his mid-teens when the series begins. Dale has her mind torn from her body by Ming in the first episode and is preserved in a crystal, which Rick is able to recover and give to his father. Dale is reborn on Earth as Dynak-X, the strategic super-computer based in the Defenders' Headquarters.

Flash Gordon (1996)
In 1996, Hearst Entertainment premiered an animated Flash Gordon television series. In this version, Alex "Flash" Gordon and Dale Arden are hoverboarding teenagers, who become trapped on Mongo after stopping Ming's attempt to invade Earth.

Flash Gordon (2007–08 live-action)
A live-action series, comprising 22 one-hour episodes, was produced in Canada in early 2007. Under an agreement with King Features Syndicate, the series was produced by Reunion Pictures of Vancouver with Robert Halmi Sr. and Robert Halmi Jr. of RHI Entertainment serving as Executive Producers.

Sci-Fi Channel premiered its new Flash Gordon series in the United States on August 10, 2007.

The traditional primary supporting characters of Ming, Dale Arden, and Dr. Hans Zarkov were drastically altered. Eric Johnson, best known for his earlier work on the WB's Smallville, played the title character of Steven "Flash" Gordon. Gina Holden played Dale Arden, Jody Racicot played Dr. Hans Zarkov, and John Ralston portrayed the arch-villain, Ming.

Radio serials and audio-dramas
Starting April 22, 1935, the strip was adapted into The Amazing Interplanetary Adventures of Flash Gordon, a 26-episode weekly radio serial. The series followed the strip very closely, amounting to a week-by-week adaptation of the Sunday strip for most of its run.

Flash Gordon was played by Gale Gordon, later famous for his television roles in Our Miss Brooks, Dennis the Menace, The Lucy Show and Here's Lucy (the latter two with Lucille Ball). The cast also included Maurice Franklin as Dr. Zarkov and Bruno Wick as Ming the Merciless.

The radio series broke with the strip continuity in the last two episodes, when Flash, Dale and Zarkov returned to Earth. They make a crash landing in Malaysia, where they meet Jungle Jim, the star of another of Alex Raymond's comic strips.

The series ended on October 26, 1935, with Flash and Dale's marriage. The next week, The Adventures of Jungle Jim picked up in that Saturday timeslot.

Two days later, on October 28, The Further Interplanetary Adventures of Flash Gordon debuted as a daily show, running four days a week. This series strayed further from Raymond's strip, involving Flash, Dale and Zarkov in an adventure in Atlantis. The series aired 60 episodes, ending on February 6, 1936.

Twenty-six years after he had played Flash Gordon in the last of the three Universal film serials (1940), Buster Crabbe again played Flash for two newly recorded audio-dramas released as the 1966 LP, The Official Adventures Of Flash Gordon (MGM/Leo The Lion Records CH-1028).

Stage
In 1989, Lee Ahlin and Gary Gordon wrote a musical for children, Flash Gordon, based on the comic. The musical premiered in 1989 in Oak Hall Performing Arts Theater in Gainesville, Florida. Flash Gordon starred Brian LeDuc as Flash, Kim Ehrich as Dale Arden, John Pelkey as Ming, and Julie Hamric as Princess Aura.

Comic books
Over the years, several publishers have produced Flash Gordon comics, either reprints or original stories: Several issues of the King Comics series were drawn by Al Williamson, who won the 1966 National Cartoonists Society Award for Best Comic Book for his work on the series. Williamson later said: "I was paying homage to Alex [Raymond], you know. I tried to treat his creation with respect and dignity and tried to do it to the best of my ability. I find that other artists who have done Flash Gordon just don't seem to get the feeling of the strip, you know. Flash is a noble guy and it's kind of nice to have that kind of a hero". King also released a comic version as a part of their Comics Reading Library in the 1970s.
 * David McKay Publications King Comics #1–155 (1936–1949) [strip reprints]
 * Dell Comics Four Color Comics #10, 84, 173, 190, 204, 247, 424, 512; Flash Gordon #2 (1945–1953) [first 2 strip reprints]
 * Harvey Comics #1–5 (1950) [strip reprints]
 * Gold Key Comics #1 (1965) [reprints FC #173]
 * King Comics #1–11 (1966–1967) (also in Phantom #18–20)
 * Charlton Comics #12–18 (1969–1970)
 * Gold Key Comics #19–27 (1978–1979); under their "Whitman Comics" #28–37 (1980–1982)

Williamson provided artwork for a Western Publishing adaptation of Dino De Laurentiis' Flash Gordon film, written by Bruce Jones. It was released by Western Publishing in both hardcover and softcover formats to coincide with the film's release, and was also serialized in three issues of Whitman's Flash Gordon comic book, #31-33, March–May 1981.

In 1988, Dan Jurgens wrote a modernized version of the comic strip as a nine-issue DC Comics miniseries. It features Flash as a washed up basketball player who finds new purpose in life on Mongo, Dale as an adventurous reporter who is just as capable as Flash, and a gray-skinned Ming who is less of an Asian stereotype. The series ran for the planned nine issues and was left with an open-ended conclusion. Though Mongo is not a threat to Earth in this series, Ming had every intention of conquering Earth once he coerced Dr. Zarkov into designing the needed ships.

In 1995, Marvel Comics published a new two-issue series, written by Mark Schultz with art by Al Williamson, in the style of the Flash comics Williamson had produced for King and others.

A new comic book series was released by Ardden Entertainment in August 2008, though with inconsistent release dates for subsequent issues. The series was written by Brendan Deneen and Paul Green and debuted in 2008, with the first arc entitled "The Mercy Wars". The initial story arc concluded in mid-2009. These were followed by further storylines. Ardden also published a Flash Gordon anthology entitled The Secret History of Mongo. Ardden's second Flash Gordon arc is titled Invasion of the Red Sword (2010). Two other arcs were completed.

A reprint of all of Al Williamson's Flash Gordon comic books in black and white was printed by Flesk in 2009.

In 2010, Dark Horse Comics began an archive reprint series in hardback, starting with the original comics published by Dell. The second volume covers the comics published by King Comics, the third covers the comics published by Charlton Comics, the fourth covers the comics published by Gold Key, and the fifth covers the comics published by Whitman.

In 2011, Dynamite Entertainment began a new series called Flash Gordon: Zeitgeist. The series is written by Eric Trautmann (Vampirella, Red Sonja), from a story and designs by Alex Ross (Kingdom Come, Marvels, Project: Superpowers) and illustrated by Daniel Lindro. The company also produced a spin-off miniseries, Merciless: The Rise of Ming, in 2012, with story and art by Scott Beatty and Ron Adrian. Following a crossover miniseries called King's Watch (where, much like Defenders of the Earth, Flash Gordon teamed up with Mandrake and the Phantom; albeit, set in the 21st century), Dynamite launched a new Flash Gordon ongoing series in 2014, with story and art by Jeff Parker and Evan "Doc" Shaner. In 2015, Dynamite followed this run with another Flash Gordon miniseries as part of their "King: Dynamite" series. This series was written by Ben Acker and Ben Blacker and illustrated by Lee Ferguson.

In July 2023, Mad Cave Studios announced that it had obtained the license to publish new stories, graphic novels and reprints.

Flash Gordon Strange Adventure Magazine
In 1936, one issue of Flash Gordon Strange Adventure Magazine was published by Harold Hersey, featuring a novel about Flash Gordon, entitled The Master of Mars. It was written by little-known author James Edison Northford. The saddle-stitched novel was based (more or less) on the comic strip story lines, and included color illustrations reminiscent of Alex Raymond's artwork. On the back pages a second installment, The Sun Men of Saturn, was promised, but it never saw print. Even though the series did not gain in popularity, the lone issue of Flash Gordon Strange Adventure Magazine has become a much sought-after item for pulp magazine collectors.

Big Little Books
The Flash Gordon strip was adapted for the Big Little Books series by the Whitman Publishing Company in 1934; the books follow the strip stories very closely and were designed with a captioned illustration opposite each page of text. The series ran for 14 installments from 1934 until 1948. The books were:
 * "Flash Gordon on the Planet Mongo" (1934)
 * "Flash Gordon and the Monsters of Mongo" (1935)
 * "Flash Gordon and the Tournaments of Mongo" (1935)
 * "Flash Gordon and the Witch Queen of Mongo" (1936)
 * "Flash Gordon vs. the Emperor of Mongo" (1936)
 * "Flash Gordon in the Water World of Mongo"	(1937)
 * "Flash Gordon in the Forest Kingdom of Mongo" (1938)
 * "Flash Gordon and the Perils of Mongo" (1940)
 * "Flash Gordon and the Tyrant of Mongo" (1941)
 * "Flash Gordon and the Ice World of Mongo"	(1942)
 * "Flash Gordon and the Ape Men of Mor"	(1942)
 * "Flash Gordon and the Power Men of Mongo" (1943)
 * "Flash Gordon and the Red Sword Invaders" (1945)
 * "Flash Gordon in the Jungles of Mongo" (1947)
 * "Flash Gordon and the Fiery Desert of Mongo" (1948)

Flash Gordon in the Caverns of Mongo (1936)
The first novel based on the strip, Flash Gordon in the Caverns of Mongo, was published in 1936 by Grosset & Dunlap. The credited author was Alex Raymond, but Doug Murray claims the novel "was almost certainly ghost-written". Like the pulp magazine of the same year, it failed to launch a series.

Avon Books
In 1973, Avon Books launched a six-book series of adult-oriented Flash Gordon novels: The Lion Men of Mongo, The Plague of Sound, The Space Circus, The Time Trap of Ming XIII, The Witch Queen of Mongo and The War of the Cybernauts. Although the books were credited to Alex Raymond, the first three were written by SF writer Ron Goulart (under the house name "Con Steffanson") and the other three novels were by Bruce Cassiday (the first under the "Steffanson" name, and the latter two under the pseudonym "Carson Bingham").

1980 film novelization
A novelization of the 1980 film was written by Arthur Byron Cover, and published in the United States by Jove Publications and in the United Kingdom by New English Library.

Tempo Books
In 1980, Tempo Books released a series by David Hagberg: Massacre in the 22nd Century, War of the Citadels, Crisis on Citadel II, Forces from the Federation, Citadels under Attack and Citadels on Earth. Except for the names of the hero and his co-stars of Dale Arden and Dr. Hans Zarkov, this series had little to do with any other version of Flash Gordon.

1939 World's Fair
The name "Flash Gordon" was emblazoned on the proscenium of a ride at the 1939 New York World's Fair. An article in Popular Science (March 1939) described how 150 people could enter a ride designed to resemble a rocket ship with a motion picture screen and vibrating seats for a simulated trip to another planet. The ride was located "at the opposite end of the amusement zone from the parachute tower". Fairgoers walked around a simulation of Venus as a jungle planet, inhabited by mechanical dinosaurs to enter a "Martian Headquarters", where "weirdly costumed Martians and mechanically animated models of giant beasts enact[ed] episodes from the adventures of Flash Gordon". The ride's Martians did not look like those in the 1938 serial, nor did the rocket ship.

Reprints
Raymond's work, particularly his Sunday strips, has been reprinted many times over the years by many publishers, most notably Nostalgia Press, Kitchen Sink Press and Checker Book Publishing Group.

Some of the Austin Briggs dailies were reprinted by Kitchen Sink Press. The King Comics run of Flash Gordon reprinted one Alex Raymond story and two Mac Raboy ones in 1967. The Mac Raboy Sundays have been reprinted by Dark Horse Comics in black and white, while Kitchen Sink began to collect both the Dan Barry and Austin Briggs daily strips. The Dan Barry dailies have never been entirely reprinted, but the Barry stories written by noted author Harry Harrison were reprinted in Comics Revue magazine, published by Manuscript Press. Tempo Books published six mass-market paperbacks reprinting Dan Barry strips from the 1970s in the 1980s. Two stories from the Dan Barry dailies, D2-133 "Baldur Battles Skorpi" (February 24 to May 10, 1986) and D2-134 "The Bear" (May 12 to August 21, 1986), were reprinted in an oblong format, 6.5 by 10.5 paperback edition with two strips per page by Budget Books PTY of Melbourne, Australia in 1987 under the title The New Adventures of Flash Gordon, ISBN 0-86801-795-7. A reprint of all of Al Williamson's Flash Gordon comic strip and comic book work was released in 2009.
 * Flash Gordon on the Planet Mongo (1934–35), Nostalgia
 * Flash Gordon into the Water World (1935–37), Nostalgia
 * Flash Gordon Escapes to Arboria (1937–39), Nostalgia
 * Flash Gordon vs Frozen Horrors (1939–40), Nostalgia
 * Flash Gordon Joins the Power Men (1940–41), Nostalgia
 * Flash Gordon: A New Kingdom (1939) Pacific Comics Club/Club Anni Trenta, 1977 (limited edition for collectors)
 * Flash Gordon: The End of Ming (1940) Pacific Comics Club/Club Anni Trenta, 1977 (limited edition for collectors)
 * Flash Gordon: Return to Earth (1941) Pacific Comics Club/Club Anni Trenta, 1977 (limited edition for collectors)
 * Flash Gordon: A New War (1941) Pacific Comics Club/Club Anni Trenta, 1977 (limited edition for collectors)
 * Flash Gordon: The Usurper (1942) Pacific Comics Club/Club Anni Trenta, 1977 (limited edition for collectors)
 * Flash Gordon: Gundar the Hawk of Tropica (1942–43) Pacific Comics Club/Club Anni Trenta, 1977 (limited edition for collectors)
 * Flash Gordon: The End of Brazor (1944). Pacific Comics Club/Club Anni Trenta, 1977 (limited edition for collectors)
 * Mongo, Planet of Doom (1934–35), Kitchen Sink Press ISBN 0-87816-114-7
 * Three Against Ming   (1935–37), Kitchen Sink Press ISBN 0-87816-120-1
 * The Tides of Battle  (1937–39), Kitchen Sink Press ISBN 0-87816-162-7
 * The Fall of Ming     (1939–41), Kitchen Sink Press ISBN 0-87816-168-6
 * Between Worlds at War (1941–43), Kitchen Sink Press ISBN 0-87816-177-5
 * Triumph in Tropica   (1943–44), Kitchen Sink Press ISBN 0-87816-199-6
 * Flash Gordon, Dead or Alive!: Daily Strips 5/27/40 to 8/26/40 by Austin Briggs. Pacific Comics Club, 1981(limited edition for collectors)
 * Prisoner of Ming : Daily Strips 8/27/40 to 11/13/40 / by Austin Briggs. Pacific Comics Club, 1981 (limited edition for collectors)
 * Flight to Freeland: Daily Strips 11/14/40 to 2/28/41 / by Austin Briggs. Pacific Comics Club, 1981 (limited edition for collectors)
 * Adora of the Forest People: Daily Strips 3/1/41 to 8/23/41 by Austin Briggs. Pacific Comics Club, 1981 (limited edition for collectors)
 * Flash Gordon: The Dailies by Austin Briggs 1940–1942 Volume 1, Kitchen Sink Press ISBN 0-87816-172-4 (strips from 1940)
 * Flash Gordon: The Dailies by Austin Briggs 1940–1942 Volume 2, Kitchen Sink Press ISBN 0-87816-187-2 (strips from 1941)
 * Flash Gordon The Complete Daily Strips 1951–1953, Kitchen Sink Press ISBN 0-87816-035-3
 * Flash Gordon - Star Over Atlantis, Dan Barry, Manuscript Press, 2007, ISBN 0-936414-16-2, ISBN 978-0-936414-16-4, dailies 1953–1954.
 * Flash Gordon: Volume 1 (1934–35), Checker Book Publishing Group ISBN 0-9741664-3-X
 * Flash Gordon: Volume 2 (1935–36), Checker Book Publishing Group ISBN 0-9741664-6-4
 * Flash Gordon: Volume 3 (1936–37), Checker Book Publishing Group ISBN 1-933160-25-X
 * Flash Gordon: Volume 4 (1938–40), Checker Book Publishing Group ISBN 1-933160-26-8
 * Flash Gordon: Volume 5 (1940–41), Checker Book Publishing Group ISBN 1-933160-27-6
 * Flash Gordon: Volume 6 (1941–43), Checker Book Publishing Group ISBN 1-933160-28-4
 * Flash Gordon: Volume 7 (1943–45), Checker Book Publishing Group ISBN 1-933160-20-9
 * Mac Raboy's Flash Gordon, Volume 1, Dark Horse Comics ISBN 1-56971-882-2 (Sundays, 1948–1953 S32-S45)
 * Mac Raboy's Flash Gordon, Volume 2, Dark Horse Comics (Sundays, 1953–1958 S45-S68)
 * Mac Raboy's Flash Gordon, Volume 3, Dark Horse Comics ISBN 1-56971-978-0 (Sundays, 1958–1962)
 * Mac Raboy's Flash Gordon, Volume 4, Dark Horse Comics (Sundays, 1962–1967)
 * The Amazing Adventures of Flash Gordon, Volume 1, Tempo Books ISBN 0-448-17349-2 (S132/D2-097 - S135)
 * The Amazing Adventures of Flash Gordon, Volume 2, Tempo Books ISBN 0-448-17348-4 (D2-081, D2-082)
 * The Amazing Adventures of Flash Gordon, Volume 3, Tempo Books ISBN 0-448-17347-6 (S114-S118)
 * The Amazing Adventures of Flash Gordon, Volume 4, Tempo Books ISBN 0-448-17155-4 (D2-105, D2-107)
 * The Amazing Adventures of Flash Gordon, Volume 5, Tempo Books ISBN 0-448-17208-9 (D2-098)
 * The Amazing Adventures of Flash Gordon, Volume 6, Tempo Books ISBN 0-448-17245-3 (D2-102, D2-109)
 * Al Williamson's Flash Gordon: A Lifelong Vision of the Heroic, Flesk ISBN 1-933865-13-X
 * Flash Gordon: On the Planet Mongo: The Complete Flash Gordon Library 1934–37, by Alex Raymond, Titan Books ISBN 0-85768-154-0
 * Flash Gordon: The Tyrant of Mongo: The Complete Flash Gordon Library 1937–41, by Alex Raymond, Titan Books ISBN 0-85768-379-9
 * Flash Gordon: The Fall of Ming: The Complete Flash Gordon Library 1941–44, by Alex Raymond, Titan Books ISBN 0-85768-688-7
 * Flash Gordon: The Storm Queen of Valkir: The Complete Flash Gordon Library 1944-48, by Austin Briggs, Titan Books ISBN 1-78276-286-8
 * Flash Gordon Dailies: The City of Ice: The Complete Flash Gordon Library 1951-1953, by Dan Barry, Titan Books ISBN 1-78276-683-9
 * Flash Gordon Dailies: The Lost Continent: The Complete Flash Gordon Library 1953-1956, by Dan Barry, Titan Books ISBN 978-1782766841
 * Flash Gordon Sundays: The Death Planet: The Complete Flash Gordon Library 1967-1971 by Dan Barry, Titan Books ISBN 978-1785861369
 * Flash Gordon Dailies: Radium Mines of Electra: The Complete Flash Gordon Library 1940-42 by Austin Brigss, Titan Books ISBN 978-1785861376
 * Definitive Flash Gordon and Jungle Jim Volume 1: 1934-1936, IDW Publishing ISBN 1-61377-015-4
 * Definitive Flash Gordon and Jungle Jim Volume 2: 1936-1939, IDW Publishing ISBN 1-61377-220-3
 * Definitive Flash Gordon and Jungle Jim Volume 3: 1939-1941, IDW Publishing ISBN 1-61377-580-6
 * Definitive Flash Gordon and Jungle Jim Volume 4: 1942-1944, IDW Publishing ISBN 1-61377-917-8

Games

 * The Flash Gordon & the Warriors of Mongo role-playing game was released by Fantasy Games Unlimited in 1977.
 * The Savage World of Flash Gordon Roleplaying Game written by Scott Alan Woodard was released by Pinnacle Entertainment Group in 2018.
 * Flash Gordon (pinball)

DVD releases
Flash Gordon has been released to DVD under a variety of titles and in both edited and non-edited versions. Conquers The Universe and 1950s television series have no shortage of public domain DVD releases.

Flash Gordon (1936)

 * Flash Gordon: Space Soldiers (245 minutes)
 * Flash Gordon: Spaceship to the Unknown. Hearst Entertainment, Inc., 2002. (edited to 98 minutes)

Flash Gordon's Trip to Mars (1938)

 * Flash Gordon's Trip to Mars (2 discs) (299 minutes)
 * Flash Gordon: O raio mortal de Marte. Hearst Entertainment, Inc., 2002. (97 minutes)

Flash Gordon Conquers the Universe (1940)

 * Flash Gordon Conquers the Universe (234 minutes)
 * Flash Gordon: The Peril from Planet Mongo. Hearst Entertainment, Inc., 2002. (edited to 91 minutes)

Flash Gordon (1954–55)

 * Flash Gordon (3 Volumes). Alpha Home Entertainment (only 13 of the episodes have been released thus far).

The New Adventures of Flash Gordon (1979)
US – BCI Eclipse UK – Hollywood DVD LTD
 * The New Adventures of Flash Gordon: The Complete Series (4–Discs). 600 minutes
 * The Adventures of Flash Gordon – Castaways in Tropica
 * The Adventures of Flash Gordon – Blue Magic

Flash Gordon (1980)
On May 6, 1998, Image Entertainment released the 1980 film on DVD in North America for DVD Region 1 territories through a contract with Universal, but it quickly went out of print.

Momentum Pictures later released it in the United Kingdom for DVD Region 2 territories on October 10, 2005. This edition of the film, the "Silver Anniversary Edition", features an anamorphic widescreen transfer at the film's 2.4:1 aspect ratio, both Dolby Digital and DTS 5.1 audio, the original Queen theatrical trailer, an audio commentary by director Mike Hodges, a second audio commentary from actor Brian Blessed, an interview with Mike Hodges, a photo slideshow and an original 1940s Serial, episode one of Flash Gordon Conquers the Universe.

Universal released the film on August 7, 2007, in North America and Region 1 territories once again. The new disc, entitled the "Savior of the Universe Edition", features a 2.35:1 anamorphic widescreen transfer and an English Dolby Digital 5.1 Surround track. Extras include an "Alex Ross on Flash Gordon" featurette in which world-renowned comic artist Alex Ross talks about the film and how it has inspired him in his life and work, a "Writing a Classic" featurette with screenwriter Lorenzo Semple Jr. and a Flash Gordon 1936 serial episode (chapter one of "The Planet of Peril").

Defenders of the Earth
US – BCI Eclipse LLC UK – Hollywood DVD LTD UK – Delta Music PLC UK – Fabulous Films Ltd.
 * Defenders of the Earth – The Complete Series, Volume 1 (5 Discs) 33 Episodes
 * Defenders of the Earth – The Complete Series, Volume 2 (5 Discs) 32 Episodes (Spring 2007)
 * Defenders of The Earth – The Story Begins
 * Defenders of the Earth Movie (3 Discs)
 * Defenders of the Earth Vol 1
 * Defenders of the Earth Vol 2
 * Defenders of the Earth Vol 3
 * Defenders of the Earth Movie – Prince of Kro-Tan
 * Defenders of the Earth Movie – Necklace of Oros
 * Defenders of the Earth Movie – The Book of Mysteries
 * Defenders of the Earth – The Complete Series

Flash Gordon (1996)
Lionsgate on September 21, 2004, released three 4-episode DVDs of Flash Gordon (1996) and Phantom 2040.
 * Flash Gordon: Marooned on Mongo – The Animated Movie (97 minutes)

Parodies
Flesh Gordon (1974) is an American erotic science fiction adventure comedy film. It is an erotic spoof of the Universal Pictures Flash Gordon serials from the 1930s. The screenplay was written by Michael Benveniste, who also co-directed the film with Howard Ziehm. The cast includes Jason Williams, Suzanne Fields, and William Dennis Hunt. The film had an MPAA rating of X, but was also re-edited for a reduced rating of R. It has an original runtime of 78 minutes, and the unrated "collector's edition" release runs 90 minutes.

Several episodes of the spin-off series Star Trek: Voyager featured a holodeck program called The Adventures of Captain Proton, which features many elements lifted straight from the Flash Gordon serials of the 1930s.

The comedy film A Christmas Story (1983) featured a deleted scene with Ralphie and his Red Ryder BB gun saving Flash (played by Paul Hubbard) from Ming (played by Colin Fox). None of the footage from the scene survived.

In the comedy film Ted (2012), Sam Jones appears in character both as himself and as Flash Gordon. Jones reprised his role for the sequel Ted 2 (2015).

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Flash Gordon


text:
Talk:Eight queens puzzle

Mihail Georgiev's solution

 * I have found a modular solution for extremely big boards (e.g. N>1000). It is an extension of the Klove algorithm, but for arbitrary board sizes(the Klove

solution is only for gcd(N, 6)=1(odd numbers bigger than 6). A Matlab program is in the file-exchange repository. I will not include a link, but type in Matlab fileexchange: N-Queen problem modular. It will flash there. Mihail Georgiev 195.75.72.179 (talk) 16:01, 27 September 2017 (UTC)

Algorithm Attribution
How about some attribution or reference for the simple algorithm? When was it discovered? Given the number of published algorithms using various kinds of search even for finding single solutions, it would seem that this has to be a fairly recent discovery? Or?

 * Recent? Not really. The first proof of a simple algorithm for producing a solution to the n-queens problem for every n>=4 can be found here: Wilhelm Ahrens. Mathematische Unterhaltungen und Spiele. B.G. Teubner, 1910.

 * A proof in English can be found here: E.J. Hoffman, J.C. Loessi and R.C. Moore. Constructions for the Solution of the m Queens Problem. National Mathematics Magazine, March-April:66-72, 1969.
 * PittBill 13:28, 20 Apr 2005 (UTC)

 * I don't think any of those are on the Internet, so I can't check whether any of the published algorithms are simpler to follow or remember than the one in the article. If so, can you please replace the one in the article and give the source.  If not, please leave it be. — 131.230.133.185 08:31, 13 Jun 2005 (UTC)

Paul Muljadi
Who is Paul Muljadi? From a quick Google search, I gather that he is a Chess buff & possibly one of the top players, but seeing how his name is mentioned in a couple of Wikipedia articles & he provides no personal information on his website (or even a clear way to navigate it), it would be nice to provide an article with a few sentences about him. -- llywrch 15:25, 24 Apr 2004 (UTC)

 * I don't know who he is, but I know he's not a top player - he doesn't have a FIDE rating at all. I've never heard of him, myself. --Camembert

 * I was being polite by saying "possibly one of the top players": I'd rather be corrected for thinking he was one, than being corrected for thinking that he was not one. For the record, I might be able to name a dozen famous chess players, but only if I could include Philip Marlowe. -- llywrch 22:59, 24 Apr 2004 (UTC)

 * I came independently to the conlcusion that he was nobody in particular, that the "discoveries" described in the article were not mathematically interesting, and that he had probably placed them there himself out of vanity. I removed them, then saw this discussion on the talk page. -- Dominus 15:17, 25 Aug 2004 (UTC)

 * The Integer Sequences link at the bottom of the article goes to Paul Muljadi's webpage, which announces his "discoveries". The reason I haven't removed the link is that Paul's page does list the fundamental solutions to the eight queens problem. PittBill 14:31, 28 Aug 2004 (UTC)

It seems that almost the same web page exist, here is the link: http://www.informationclub.com/encyclopedia/e/ei/eight_queens_puzzle.html

Also say: Copyright ©2003 InformationClub.com This content from encyclopedia is licensed under the GNU Free Documentation License

--andrejj 18:55, 15 Aug 2004 (UTC)

I believe the InformationClub is copying their pages verbatim from the Wikipedia. Other entities have similar copies, such as http://www.wordiq.com and http://www.fact-index.com PittBill 23:08, 15 Aug 2004 (UTC)

Number of Solutions

 * In general, the number of possible solutions of placing N queens on a N by N board, considering the symmetries as distinct solutions, is:

And then the formula is not given, only the values. -- WhiteDragon 06:26, 10 Feb 2005 (UTC)

That's because the formula is unknown. See for more information on the numbers of possible solutions. PittBill 10:43, 10 Feb 2005 (UTC)

I do see WhiteDragon's point, and have removed the In general since the table only gives values for specific N's, not a general formula. PittBill 23:47, 12 Feb 2005 (UTC)

A rough approximation to the amount of "all" solutions up to N = 26 can be given by 5 * factorial(N) / 2.4^N. Sorry... don't have a reference for it :(

XWolfRH (talk) 22:20, 25 April 2016 (UTC)

Question
For N=2 and N=3 there are no solutions. For all other values of N<600 there is at least one solution. This I know because For each of these values of N I computed a solution. I conjecture that solutions exist for all values of N excep N=2 and N=3. Does somebody know something about this conjecture, may be even a proof or a counterfact? Thanks Jos.koot (talk) 18:00, 9 July 2010 (UTC)

Answer: Your conjecture has been known to be true for quite some time. Read the "Constructing a Solution" section of the Eight Queens Puzzle page. The procedure in that section produces a solution for every N>3. For similar proofs of your conjecture, read Bell, Jordan and Stevens, Brett, A survey of known results and research areas for n-queens, Discrete Mathematics, Vol. 309, Issue 1, 6 January 2009, 1-31. PittBill (talk) 14:18, 10 July 2010 (UTC)

Thanks, Jos.koot (talk) 14:58, 10 July 2010 (UTC)

What is CLP(FD)?
What is CLP(FD)? PittBill 01:23, 6 Jun 2005 (UTC)

 * Constraint logic programming over finite domains (http://www.google.com./search?btnI&q=CLP+FD). Fixed in article.  — 131.230.133.185 08:31, 13 Jun 2005 (UTC)

Minimum-Conflicts Heuristic?
I think the part talking about the 'minimum-conflicts' heuristic is incorrect, because that heuristic gets trapped at local optimal solutions(i.e. no single move can improve the solution quality).
 * It may get trapped, but not necessarily. It's the basic tradeoff between hillclimbing and exhaustive search. As mentioned, the gain is that the method can solve problem sizes way beyond the scope of an exhaustive search. The standard fix for 'stuck at local optimum' is to restart with a different random initial configuration.

C Program
I am missing either link or listing of brilliant sollution posted to Usenet. Philipz 09:07, 11 Sep 2005 (CEST)

#include

static int count = 0;

void try(int row, int left, int right) { int poss, place; if (row == 0xFF) ++count; else { poss = ~(row|left|right) & 0xFF; while (poss != 0) { place = poss & -poss; try(row|place, (left|place)<<1, (right|place)>>1); poss &= ~place; }   } }

void main { try(0,0,0); printf("There are %d solutions.\n", count); }

It's not brilliant, though it is compact. Similar code that works for N other than 8 and takes half as long to run by counting vertically symmetric solutions only once can be found at https://rosettacode.org/wiki/N-queens_problem#C -- Jibal (talk) 09:39, 7 June 2022 (UTC)

Exact Cover
The eight-queens problem doesn't seem to be exact cover. A solution for a square larger than 1x1 can not use all the nontrivial diagonals (2x2 and 3x3 have no solutions, and for n > 3, 2n-3 > n). Should "such that every column has a 1 in precisely one of the chosen rows" be restated to "such that each of the first 2n columns has a 1 in precisely one of the chosen rows, and each other column has a 1 in at most one of the chosen rows."? Ralphmerridew 20:12, 17 January 2006 (UTC)

Maybe this should be more explicit, but it's easy to extend any problem of the form "these columns get exactly one 1 and these get at most one 1" to a normal exact cover by just adding a bunch of rows that are all zeros except for having a 1 in one of the "at most 1" rows. (Though it'll be more efficient to use an algorithm that understands the extended problem directly.) Glasser 14:04, 20 January 2006 (UTC)

Solution by Permutations in Python
Here's a simple implementation in Python that generates all 8-castles solutions by a permutations generator, then filters diagonals by checking that the set of diagonals represented has 8 elements. I think this is a more clear solution of the problem in Python, but the article's current recursive solution is probably better for readers because it represents how the problem would be solved in most languages.

You can shorten the code significantly at the expense of clarity by using generator expressions.

- Connelly 00:29, 11 May 2006 (UTC)

4-Queens Puzzle
..is it possible to cover a 8x8 chesstable with 4 queens?

The number of solutions for covering an n by n chessboard with 4 queens are as follows (including rotational and reflectional variants):

Computed by a J program. Roger Hui 06:10, 19 May 2006 (UTC)

See the actual program. Roger Hui 17:24, 19 May 2006 (UTC)

Complexity
The statement "The GNU Prolog program below resolved a 100 queens problem in less than a tenth of a second."

is meaningless without a frame of reference. Giving at least the processor used for the test and the time of a slower algorithm would help matters greatly. Andrew J. MacDonald 03:51, 30 November 2006 (UTC)

Distinct–Unique
The article seems to be arbitrarily using the words "distinct" and "unique" with its own meanings. While it does help to make it less verbose, "unique" already has the usual meaning of being the only one of something, and it's absurd to speak of "unique solution 1, unique solution 2", etc. If at all there is a unique solution, there can be only of it. Does anyone have any suggestions on what to use in place of "unique"? ("Truly distinct", "distinct even after considering symmetries", "nonisomorphic",...) --Shreevatsa 17:49, 6 January 2007 (UTC)

 * Durango Bill's website uses "unique", but the standard term seems to be "fundamental". (See for example, Watkins' book. Or Google 'fundamental solution n-queens') PittBill (talk) 12:14, 17 June 2008 (UTC)

 * I have fixed the abuse of language concerning "unique". Shreevatsa is correct; the word is wholly inappropriate.  There are two kinds of solution counts: those that consider symmetrically related configurations to be the same, and those that consider them to be distinct.  The correct term for the former is "fundamental".  The correct term for the latter is not so clear, but "all" would be appropriate.  I've allowed the article to call them "distinct", for lack of a better term.  Zaslav (talk) 04:43, 12 March 2014 (UTC)

Similar to Sudoku?
Isnt this in some way similiar to solving sudoku? Each row/column may only have one queen, is like every row may only have the same value once. Sould we include Sudoku in the Related Related Problems section? 81.221.196.70 14:17, 4 May 2007 (UTC)
 * Both this problem and Sudoku are examples of Exact cover problems. I've added a sentence to that effect to the Related Problems section. Oliphaunt 09:28, 5 May 2007 (UTC)

Move solution to the bottom of the page and add a spoiler warning
I came to this page to learn about the problem and try to solve it myself (and to find out if a solution was possible). The solution appears right at the top, spoiling the puzzle for those who just want to try it. —Preceding unsigned comment added by 70.171.221.203 (talk) 22:44, 27 September 2007 (UTC)

 * Wikipedia is about providing information, not hiding it. Also, 8 queens isn't really a puzzle and isn't "spoiled" in any way by knowing any or all of the 92 solutions. Jibal (talk) 09:49, 7 June 2022 (UTC)

comment moved from article
217.208.53.194 added the following comment to the article. I'm moving it here. Michael Slone (talk) 13:55, 11 February 2008 (UTC)
 * NOTE: This animation is incorrectly programmed. After finding a solution, the program returns to a previous placement of the second queen, instead of continuing with new placements from the found solution. Therefore, it gets stuck and repeatedly finds the same solution (with the first queen on A8 and the second on E7, after finding a solution it returns to placing the second queen on C7). Totally lousy programming and testing, in other words. —Preceding unsigned comment added by 217.208.53.194 (talk • contribs)

fastest algorith
Can anyone post the pseudocode version of the fastest algorithm that can find all unique solutions for n queens? 75.87.86.76 (talk) 23:05, 17 April 2008 (UTC)

its abt simetries... borderring n*n board to become (n+1)*(n+1) as a main backtracking step Hi, i think its a big challange 4 the analysts programmers to optimize the search 4 counting all solutions 4 n-queens problems, by using a hybrid technique between backtracking n divide and conquer, maybe counting more than one solution at a time... its still fuzzy to me im offering it to u as a challamge — Preceding unsigned comment added by 93.118.212.93 (talk • contribs)
 * fascinating contribs from that IP ... numerous screws loose. -- Jibal (talk) 10:11, 7 June 2022 (UTC)

Possible change
Currently under the section "Constructing a solution", it states:
 * "there are 4,426,165,368 (64×63×...×58×57/8!, [...]) possible arrangements"

I wonder if it would be better to write
 * "there are 4,426,165,368 ((64!–56!)/8!, [...]) possible arrangements"

Or would this just render it more obscure to a non-mathematical reader (especially one unfamiliar with the factorial)? − Twas Now ( talk • contribs • e-mail ) 01:23, 27 July 2008 (UTC)
 * Not, of course. You probably mean $$\frac{64!}{56!}8!$$. 16:38, 15 July 2009 (UTC) —Preceding unsigned comment added by Komap (talk • contribs)

an algo that might "capture" the "profile" of the part of bactracking type solution might count more than one solution at a time... — Preceding unsigned comment added by 93.118.212.31 (talk) 17:59, 24 July 2011 (UTC)

constrictive programming might help accelerate bactracking to produce the next solution more fast, in case we want to count them all...

anyway, i think it takes a bit of attention in order to make this really work

Florin Matei — Preceding unsigned comment added by 93.118.212.93 (talk) 11:05, 16 January 2012 (UTC)

 * Mr. Matei seems to like to drop irrelevant comments all over Wikipedia. Jibal (talk) 10:12, 7 June 2022 (UTC)

Problem with paragraph "Constructing a solution"
In the aforementioned paragraph, it says that there are around 4 billion possible arrangements when in fact an 8x8 board has ~16 mil arrangements. Am I missing something? —Preceding unsigned comment added by ThisThat911 (talk • contribs) 17:35, 5 February 2009 (UTC)

 * There are 4 billion arrangements of 8 queens on the board. But it is easy to see that you can restrict the possibilities to 1 per row (or column) and that reduces the possibilites to 16 million.  I'll try to clarify that in the article later.  Bubba73 (talk), 18:18, 5 February 2009 (UTC)

Eight queens puzzle solutions
The related article Eight queens puzzle solutions is being discussed for deletion here. Johnuniq (talk) 03:47, 12 August 2010 (UTC)

N-Queens; largest N
to give u trouble, lets say we got only small mem but we seek 4 bigger than mem possibilities n-queens solution, we might find usefull random generators or similaries to produce the brute solution of a slice of the board (virtual board)... in mem we might find usefull to note corrections from brute solutions.these brute solutions might b formed evn by markov sources like generators of numbers 93.118.212.93 (talk) 05:34, 24 August 2012 (UTC)

For random solutions, not to find total number of solutions. Is this of any interest? Points to "10000 Queens solved" by the website author himself. —Preceding unsigned comment added by Ronybc (talk • contribs) 21:28, 9 September 2010 (UTC)

Sosic and Gu solved a 3,000,000 Queens problem in 1991. See the article "3,000,000 Queens in Less Than One Minute", in ACM SIGART Bulletin, Volume 2, pages 22-24. PittBill (talk) 19:48, 11 September 2010 (UTC)

Polynomial solution
It should be noted somewhere inside that the N-Queens problem has a polynomial (and very quick) solution. I found it by accident, see http://doi.acm.org/10.1145/101340.101343

Neználek (talk) 13:00, 7 April 2011 (UTC)

 * There is no polynomial f(n) that gives the number of solutions of the n-Queens Problem. Zaslav (talk) 04:39, 12 March 2014 (UTC)
 * I believe that paper provides an algorithm to find a solution to an N-queens problem for large N, not to calculate the number of solutions. Jibal (talk) 10:17, 7 June 2022 (UTC)

if N is the size of the board, we might b able to use O(log(N)) complexity both code n data to describe fully the solutions that r more like independent of the size of the board, high... simetry lets call it :) 93.118.212.93 (talk) 05:39, 24 August 2012 (UTC)

Explicit Solutions - not included in the unique solutions
Why would the 'Explicit' solution shown for n=8 not appear to be among the 'Unique' or 'fundamental' solutions?Cander0000 (talk) 03:51, 31 December 2012 (UTC)

 * The explicit soluition for n=8 is a variation on #12 of the fundamental solutions. Bubba73 You talkin' to me? 04:12, 31 December 2012 (UTC)

Fundamental Solutions for N=10 wrong?
The tabular in this article mentions for N=10 that there are 92 fundamental solutions. I just implemented this myself and can confirm all numbers from 1 to 9, but I get 96 fundamentals for N=10. Can someone confirm one or the other? — Preceding unsigned comment added by 94.218.43.105 (talk) 21:08, 28 November 2016 (UTC)
 * This is not the right forum for this type of question, but you can follow the links (as I did) to see that all published values that I could find give 92. --Bill Cherowitzo (talk) 21:55, 28 November 2016 (UTC)

Computer code
There should not be too much computer code added to the article, see MOS:CODE. In particular, "Multiple source code implementations are not appropriate ...". There is already one example, referenced to a classic book. No more should be added. Bubba73 You talkin' to me? 15:35, 17 July 2013 (UTC)

3 Queens on a straight line
"Solution 10 has the additional property that no three queens are in a straight line.". Maybe I'm just missing something, but at least solution 9 has that property aswell.79.253.51.222 (talk) 22:56, 6 November 2015 (UTC)

 * A5, E3 and G2 are a straight line. --JBL (talk) 23:07, 6 November 2015 (UTC)

if ((n mod 6) !== 2) AND ((n mod 6) !== 3) then call horse_step_algo

function horse_step_algo { even numbers + odd numbers (2 4 6 8 10 12 1 3 5 7 9 11 13) }

if N not in sequence http://oeis.org/A047243, horse_step_algo return solve.

n mod 6 -> 2017 mod 6 = 1 -> 2 4 6 8 10 ..... 2016 1 3 5 7 9 ..... 2017 solve.

Amanda Sproule (talk) 21:58, 10 December 2017 (UTC)

No Three In A Line
"Solution 10 has the additional property that no three queens are in a straight line."

Isn't that obvious, and shared by all solutions? If there were three queens in a straight line, they'd be threatening each other, and it wouldn't be a solution.

2605:A000:EF84:2C00:10C:6B90:8406:330B (talk) 23:20, 18 April 2017 (UTC)

 * Not all lines are rows, columns, or diagonals. (See also the talk page section directly above this one.)  --JBL (talk) 23:50, 18 April 2017 (UTC)

This is unfortunately still unclear to me - most likely I am missing what is meant by "in a straight line"? When refering to cited article No-three-in-line problem it states: "no-three-in-line problem asks for the maximum number of points that can be placed in the n × n grid so that no three points are collinear. This number is at most 2n, since if 2n + 1 points are placed in the grid, then by the Pigeonhole principle some row and some column will contain three points." From this immediately follows, that a maximum number of 2 * 8 = 16 points (i.e. queens) can be placed on the common 8 × 8 chessboard, so that no row or column will contain 3 queens. But from "row or column" it also immediately follows for me in scope of the Eight queens puzzle, that not even *two* queens may share any row or column (and also not diagonal).

As already stated above I am obviously missing the definition of "straight line" in this context - as also mentioned by JBL above: "Not all lines are rows, columns, or diagonals." So what precisely *is* meant with "in a straight line" here? Maybe it would make sense to add that definition to the article, maybe even depicting the lines in one or all of the other 11 solutions, where three queens indeed are suppossed to be "in a straight line"? Dr.Big.Man (talk) 10:56, 9 January 2019 (UTC)

 * "line" means "line" in the usual geometric sense. In the section above, I have identified a set of three queens that lie in a straight line; does that help? --JBL (talk) 12:38, 9 January 2019 (UTC)
 * The meaning of "straight line" is well known and well documented elsewhere; there is no need to add it to this article. Ranks (rows), files (columns), and diagonals on a chessboard are lines at 0 (or 180), 90 (or 270), and 45 (or 135) degrees ... but that of course does not exhaust all the possibilities for straight lines. Jibal (talk) 10:30, 7 June 2022 (UTC)

Berea College, Martin Richards and Zongyan Qiu
Our citation of Martin Richards' 1997 bit-patterns paper was of the 2009 online version (because that's easier to verify than the original 1997 paper version), but the 2009 date caused the contributor of this anonymous edit (from a ChinaNet IP in Chongqing) to think Zongyan Qiu's 2002 paper had it first. That would have been only a minor matter, until this anonymous edit (from Berea College, USA) changed the main text to read that Martin Richards plagiarised Zongyan Qiu. Plagiarism is a serious allegation for which we have no evidence (even if Richards' first version were 2009—which it wasn't—we still wouldn't know he'd deliberately copied Qiu; they might have just both thought of the same thing), so it's not surprising that User:Sneftel in this edit ("rm nn infighting") deleted the lot. Which is a pity, because it's notable that the algorithm can be done using bit patterns and has been since at least 1997. I therefore reinstated the text, noted the 1997, but still kept Zongyan Qiu's reference as well because I like Chinese and I'm not anti-Qiu or anything like that, but the facts are that Richards first did it in 1997, 5 years before Qiu. We can mention Qiu as well because it's a different publication and it takes a slightly different approach in a different programming language. Everyone happy now? ;-) A1415 (talk) 08:45, 12 April 2019 (UTC)
 * I agree with Sneftel’s removal. If this is notable (as you say) then there should be a secondary  source that comments on it, mentioning these primary research articles.  —JBL (talk) 09:21, 12 April 2019 (UTC)
 * Notability applies to article subjects, not to sections of text or to citations, which don't need secondary sources (that would be nuts if we had to provide a secondary source for every research paper cited in Wikipedia). Jibal (talk) 10:37, 7 June 2022 (UTC)
 * I disagree with your addition. While I now understand that he didn't plagiarize, your addition swings heavily toward Richards' favor. Anyway, I agree with other editors that the whole algorithm may not be notable. If we end up adding, the IP edit is a good compromise. 71.31.30.66 (talk) 03:16, 15 April 2019 (UTC)
 * Favor? It's not a contest. Jibal (talk) 10:37, 7 June 2022 (UTC)

It was the allegation of plagiarism that brought the paragraph to my attention, but I removed the paragraph entirely rather than just reverting because the result did not seem particularly notable. I looked around for secondary references, and found a few "related work" mentions but nothing positioning it as an important aspect of the n-queens problem as a whole. Sneftel (talk) 11:40, 12 April 2019 (UTC)
 * The edit summary of that revert says "Smells strongly of WP:COISELF". I'm not sure which editor(s) Sneftel meant, but my only connection to Richards is having had him as a lecturer many years ago, does that count? A1415 (talk) 08:46, 20 April 2019 (UTC)

A Google scholar search shows 9 citations for Richards, including: Meanwhile there are 3 citations of Qiu, two of which are also in the above list of papers that cite Richards (so let's not double-count them), and the third is a conference paper called Research of Hybrid Genetic Algorithm in N-Queen Problem Based on HCI (with 2 citations).
 * Complexity of n-queens completion (a journal paper)
 * Using dynamic parallelism for fine-grained, irregular workloads: a case study of the n-queens problem (a conference paper about GPUs etc), seems to be the same team as this paper
 * this Chinese paper (about non-recursive methods?)
 * this Malay paper
 * this paper (not sure what it's getting at)
 * PrimerPooler: automated primer pooling to prepare library for targeted sequencing uses bit-patterns for the bioinformaticsy part and cites Richards N-queens as where the idea came from
 * Heterogeneous cluster computing for many-task exact optimization: Application to permutation problems
 * Enable back memory and global synchronization on LLC buffer (not sure I understand that)

Are these 10 citations enough to establish notability in some context? not sure if that context should be "the eight-queens puzzle" or bit manipulation though (although that article would need a lot more fleshing-out with applications etc before it would make sense to add this one). A1415 (talk) 08:46, 20 April 2019 (UTC)
 * I agree with the IP addition like this: Programs to count solutions to the n-queens problem using bitwise operations were published by Zongyan Qiu and Martin Richards.
 * The additions of who did first or what are not notable. 71.31.30.66 (talk) 18:00, 20 April 2019 (UTC)

I mean, clearly none of this is particularly notable, because none of us have gone to the trouble of noting it. You can count solutions through bitwise operations? Well that's potentially interesting if you're into bitwise operations, but in this discussion of wordings, nobody has tried to describe the method or argue that it is in any way important beyond the fact that someone gets to plant their flag in it. It doesn't help describe or explain or help people with the eight-queens puzzle. It's not notable to the eight-queens puzzle. It might be notable on Richards' or Qiu's articles since those are all about them, if it's among the more important things they did (though I doubt that's the case either). Sneftel (talk) 09:03, 25 April 2019 (UTC)
 * I agree with Sneftel, but am also not particularly bothered by the sentence suggested by IP 71... and implemented by IP 92.... --JBL (talk) 12:17, 25 April 2019 (UTC)

Counting solutions by bitwise operations is notable if someone published a paper about it, as they apparently did. There is also a paper about counting solutions through carry chains of hardware addition circuits. This article should actually include a write-up of the algorithm they used to decrease counting time by making better use of symmetry when enumerating the 27 queens problem. 67.164.113.165 (talk) 00:13, 26 April 2019 (UTC)
 * The general criteria for notability are described here. Someone publishing a paper about a topic is not sufficient to demonstrate the notability of the topic. The paper is an example of what's known as a "primary source". Those links should help you get up to speed on what sorts of things we look for. Sneftel (talk) 16:33, 26 April 2019 (UTC)
 * I believe those criteria are for having standalone articles. I think those criteria led us confused. At the end of the day, we're not talking about creating a new article titled "Bitwise solution for N-queen problem". We're talking about the notability of a mere sentence, which shouldn't be controversial. The WP:GNG took pains to state, "If a topic does not meet these criteria but still has some verifiable facts, it might be useful to discuss it within another article." 71.31.30.66 (talk) 17:39, 29 April 2019 (UTC)
 * Notability pertains to articles, not "topics" within an article or to citations, which do not need secondary sources. This whole discussion shows a serious lack of understanding of "what we look for" at Wikipedia. Jibal (talk) 10:42, 7 June 2022 (UTC)

Solutions Section: Further Duplications
In the solution to the Eight Queens section, it says that if you allow symmetry operations of rotations and reflections to be reduced to equivalence classes, you get 12 distinct solutions. I would like to point out that if, in addition, you allow translations, you can reduce the solution set to (at most) six equivalence classes. See this Problem of the Week at Math Help Boards that I posted for an explanation. We may or may not want to allow translations to reduce the solution set further, but I thought I would point this out. Ackbeet (talk) 17:18, 13 June 2019 (UTC)

Order of Solutions
The solutions have a certain order, but wouldn't it make more sense to show them in sequential order? I.e., decide on an order for the Quuens, say first from bottom to top, second from left to right [following the coordinate system]. Then solutions that have a Queen in the corner A1 appear first, then solutions with a Queen on B1, etc. If we use a coordinate system, we can use (c1,c2,c3,c4,...) to indicate that the n-th Queen is in the n-th row and cn-th column. The solutions should then be ordered as follows (using current numbering): 3 (1,2,4 - flipped), 2 (1,2,5 - flipped); 1 (2,4,6 - flipped), 4 (2,5,7,1), 5 (2,5,7,4), 6 (2,6,1), 7 (2,6,8), 8 (2,7,3), 9 (2,7,5); 12 (3,5,2), 10 (3,5,8), 11 (3,6,2). Considering that only 3 solutions are flipped and 10 solutions appear in the correct order, I assume that the shown order was not the one originally envisioned. Bcurfs (talk) 03:56, 16 November 2020 (UTC)
 * Yep, lexicographic ordering (of the minimal elements of the groups) does make sense, particularly as it's the order in which the solutions would be enumerated by a standard backtracking solver. The current ordering seems to be a holdover from a different, fairly OR-ish discussion of the structure of solutions. Sneftel (talk) 11:19, 18 November 2020 (UTC)
 * I don't care about what order they are listed in, but anyone who goes to change this should be aware that there are several different places in the article where solutions are referred to by number, so care is needed in re-ordering them. --JBL (talk) 12:37, 18 November 2020 (UTC)

Superqueen
The superqueen problem adds the constraint of moving like a knight to the n-queens problem. Besides for the regular rook and bishop movement, it adds the knight movement making the puzzle much more difficult. I think it would make for a good addition to the article and I would do it myself, but I wouldn't be able to articulate it so well. It is only solvable for n = 1 | n >= 10 Here are some papers I found on the subject as well as the oeis sequence for it.

http://www.ccs.neu.edu/home/kunkle/papers/techreports/superQueensOG.pdf http://www.durangobill.com/N_Queens.html https://oeis.org/A051223

What of these recent set of articles on a solution?
What of these recent set of articles on a "solution" by Harvard mathematician Michael Simkin?

 * https://phys.org/news/2022-01-harvard-mathematician-year-old-chess-problem.html
 * https://scitechdaily.com/harvard-mathematician-resolves-150-year-old-chess-problem/
 * https://www.sciencealert.com/a-harvard-mathematician-has-solved-an-epic-150-year-old-chess-problem
 * https://www.iflscience.com/editors-blog/dont-slay-queen-chess-puzzle-solved-after-150-years-thanks-to-mathematics/

This development should be in the article. I see Simkin mentioned only twice in the notes. TuckerResearch (talk) 18:48, 27 January 2022 (UTC)
 * It is already covered in the article. The real question is why there are a bunch of new churnalist rehashings of the Quanta piece (also cited in the article) from September. --JBL (talk) 21:31, 27 January 2022 (UTC)
 * I have restructured the article to better highlight the recent work, and also rewritten the lead section. --JBL (talk) 17:09, 29 January 2022 (UTC)

Sample code: how do we feel about it?
So back in February removed the sourced sample code as "outdated and provid[ing] no insight". Subsequently, has added it back -- except not actually, because what they've added is a rewritten version in a different language and with various changes made to the cited version. I was under the impression that this was something that's been discussed a lot here (in light of WP:OR and WP:CODE) but I'm either confused or incompetent because I don't see it on this page or in the article edit history. So let me try to kick off a discussion about it. Personally, I'm inclined towards the view that if we're going to include sample code, I would rather include a code sample directly cited to something, rather than reworked versions of it. --JBL (talk) 11:55, 17 April 2022 (UTC)

 * It would be desirable to have a citation for the code, but Python is essentially a runnable pseudocode which is certainly more useful to the reader as a high-level overview of one of the algorithms than Wirth's Pascal code which required reader to carefully examine to figure what it does. I'm not entirely sure it adds anything to the article more than what is covered in the previous section, but few lines of code sometimes read better than prose so I would tolerate it. We certainly don't want to have two versions differing only in insignificant details as in the current version of the article, though! If someone wants more, the External Links section already has a link to Rosetta Code (and two GitHub links of questionable usefulness; there are thousands of implementations written as an exercise every year). – MwGamera (talk) 16:24, 17 April 2022 (UTC)

 * In fact, I reintroduced the code for several reasons: First, I was intrigued by Niklaus Wirth's idea of representing the chessboard by three lists (a, b, and c). I think that idea alone is worth presenting in some form. Second, to document that as languages continue to evolve, it is possible to represent Wirth's basic idea without low-level operations. And third, because there are so many implementations that just take care of such low-level details. While there are over a hundred versions on Rosetta code, it takes a long time to find one that's optimized for readability and still works in the real world. That's exactly why I put Wirth's code in exactly this form. I also wanted to demonstrate the trick mentioned in the previous section of combining recursion and permutation to reduce the number of investigations. But because this is exactly what damages readability, I'm not sure if that was a good idea. --Majow (talk) 08:21, 18 April 2022 (UTC)
 * You may want to read through WP:CODE for potential reasons *not* to include certain types of sample code. I'm not sure whether Wirth's representation of the chess board is notable enough, or relevant enough to the eight-queens puzzle, to be captured in the article, but if it is then it should be discussed directly and supported by independent sources, not just hinted at in the sample code. But something being "worth preserving" doesn't necessarily make it worth including in an article. WP does not strive to be a repository of source code, even carefully hand-picked "best" source code. Sneftel (talk) 11:14, 19 April 2022 (UTC)
 * It may indeed be a personal problem, but I only understand some things because I can try them and change them in the process. When we discussed the eight queens puzzle at school, I could understand it only because of the explanation and code of N. Wirth (I still have a copy of the book "Algorithms and Data Structures"). I had a lot of trouble understanding the principle of recursion and kept adding print statements to the code and recompiling it again and again until I finally got the idea behind it. That's why I simply missed the sample code here and I personally think N. Wirth's solution is excellent. However, since the array data structure is used in the Pascal language, there are some low-level things you just don't need to do when using lists in Python. Therefore, code readability in Python is better, but memory consumption and execution speed are significantly worse than in Wirth's original. Wirth hardly uses the stack because he allocates the arrays globally and not locally, and the operations on arrays are of order O(1), while on lists they are significantly slower with order O(n). --Majow (talk) 09:45, 20 April 2022 (UTC)
 * None of these personal facts are relevant. Please review WP:OR Jibal (talk) 10:48, 7 June 2022 (UTC)

What you called beautification in Special:Diff/1083937760 is IMO not an improvement at all. It only makes the rendering of the code block inconsistent with the rest of the Wikipedia. One could argue these borders with shadows are visually helpful, but these kind of style changes belong to the site-wide skin or templates. This code isn't particularly special in any way that would mandate making it look different here. – MwGamera (talk) 21:48, 22 April 2022 (UTC)

 * Looking through the sample code, it's a great illustration of the difference between a pseudocode description of an algorithm and an "example implementation" of that algorithm, and is firmly in the latter camp. If one came to the page not knowing the backtracking algorithm to solve the eight-queens puzzle, that code is not formulated to help them. It involves generators, a relatively advanced feature of Python and one which would confuse someone with only a passing familiarity with the language; the variable names are opaque; and it gratuitously uses terse list operators which, again, would confuse someone with limited Python exposure. (It fails as an implementation as well: the state structures are copied rather than mutated, and there's an unnecessary iteration over the row, leading to an additional factor of n in the time complexity. But that's a comparatively minor concern.) I might suggest, Majow, that that is the sort of code which looks beautiful to one who has spent a long time looking at it, yet is opaque to one who is seeing it for the first time. And we really need to prioritize that latter group when writing an encyclopedia. Sneftel (talk) 09:29, 25 April 2022 (UTC)

Symmetrical Solutions
Just suggesting an extra column, symmetrical and fundamental solutions. For some reason I could not find this particular sequence in OEIS!

20×20 (“first” and “last”)
AndrejPodzimek (talk) 00:22, 19 May 2022 (UTC)

title: Talk:Eight queens puzzle


text:
Aon Center (Chicago)

The Aon Center (200 East Randolph Street, formerly Amoco Building) is a modern super tall skyscraper east of the Chicago Loop, Chicago, Illinois, United States, designed by architect firms Edward Durell Stone and The Perkins and Will partnership, and completed in 1973 as the Standard Oil Building (nicknamed "Big Stan"). With 83 floors and a height of 1,136 feet (346 m), it is the fourth-tallest building in Chicago, surpassed in height by Willis Tower, Trump International Hotel and Tower, and St Regis Chicago.

The building is managed by Jones Lang LaSalle, which is also headquartered in the building. Aon Center also houses the headquarters of Aon and one of Kraft Heinz's two headquarters (the other being in Pittsburgh), and the former world headquarters of Amoco prior to its merger into BP.

The building was briefly the tallest in Chicago, but was soon surpassed by the Sears Tower. It was the fourth-tallest building in the world at the time of its completion.

Construction

The Standard Oil Building was constructed as the headquarters of the Standard Oil Company of Indiana. Standard's previous home had been 910 S. Michigan Avenue. This building was constructed in 1911 by the Karpen Brothers Furniture Company and was purchased by Standard in 1927. When the new Standard Oil Building was completed in 1973, it was the tallest completed building in Chicago and the fourth-tallest in the world, earning it the nickname "Big Stan". In 1974, the taller Sears Tower (now Willis Tower) in Chicago surpassed it as the tallest completed building in Chicago (the Sears Tower was also the tallest in the world). However, the Sears Tower had already been topped out in May 1973. When the Aon Center opened as the fourth-tallest completed building in the world, it was only exceeded in height by the twin towers of the original World Trade Center and the Empire State Building in New York City. Originally clad in marble, the Aon Center was also the tallest marble-clad building in the world.

The building employs a tubular steel-framed structural system with V-shaped perimeter columns to resist earthquakes, reduce sway, minimize column bending, and maximize column-free space. This construction method was also used for the original World Trade Center twin towers in New York City.

Refacing

When completed, it was the world's tallest marble-clad building, sheathed entirely with 43,000 slabs of Italian Carrara marble. The marble used was thinner than previously attempted in cladding a building, which soon proved to be a mistake. On December 25, 1973, during construction a 350-pound marble slab detached from the façade and penetrated the roof of the nearby Prudential Center. In 1985, inspection found numerous cracks and bowing in the marble cladding of the building. To alleviate the problem, stainless steel straps were added to hold the marble in place. Later, from 1990 to 1992, the entire building was refaced with Mount Airy white granite at an estimated cost of over $80 million. Amoco was reluctant to divulge the actual amount, but it was well over half the original price of the building, without adjustment for inflation. Two-thirds of the discarded marble was crushed and used as landscaping decoration at Amoco's refinery in Whiting, Indiana, one-sixth was donated to Governors State University, in University Park, and one-sixth donated to Regalo, a division of Lashcon Inc. Under a grant from the Illinois Department of Rehabilitative Services, Regalo's 25 handicapped workers carved the discarded marble into a variety of specialty items such as corporate gifts and mementos including desk clocks and pen holders. The building's facade somewhat resembles that of the North and South tower of the former World Trade Center Complex due to the upward flow of the columns.

Designation
The Standard Oil Building was renamed the Amoco Building when the company changed names in 1985. In 1998, Amoco sold the building to The Blackstone Group for an undisclosed amount, estimated to be between $430 and $440 million. It was renamed as the Aon Center on December 30, 1999, although the Aon Corporation would not become the building's primary tenant until September 2001. In May 2003, Wells Real Estate Investment Trust, Inc. acquired the building for between $465 and $475 million. On August 10, 2007, Wells Real Estate Investment Trust, Inc. changed its name to Piedmont Office Realty Trust, Inc.)

Real estate investors Mark Karasick and Victor Gerstein acquired the building from Piedmont in 2015 for $713 million.

Planned observation deck
On May 14, 2018, the building's owners unveiled a $185 million proposal for an observatory featuring a thrill ride on the roof called the Sky Summit, the world's tallest exterior elevator, and new entrance pavilion. The observatory was supposed to be completed in 2022, but the COVID-19 pandemic had been announced to have delayed construction plans by about a year.

title: Aon Center (Chicago)


text:
Reification

Reification may refer to:

Science and technology

 * Reification (computer science), the creation of a data model
 * Reification (knowledge representation), the representation of facts and/or assertions
 * Reification (statistics), the use of an idealized model to make inferences linking results from a model with experimental observations

Other uses

 * Reification (fallacy), the fallacy of treating an abstraction as if it were a real thing
 * Reification (Gestalt psychology), the perception of an object as having more spatial information than is present
 * Reification (linguistics), the transformation of a natural-language statement such that actions and events represented by it become quantifiable variables
 * Reification (Marxism), the consideration of an abstraction of an object as if it had living existence and abilities

title: Reification


text: Talk:Reification

title: Talk:Reification