The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.

The result was redirect‎ to Hexagonal chess#Starchess. (non-admin closure) CR (talk) 20:45, 3 February 2025 (UTC)[reply]

Starchess (edit | talk | history | protect | delete | links | watch | logs | views) – (View log | edits since nomination)
(Find sources: Google (books · news · scholar · free images · WP refs· FENS · JSTOR · TWL)

No independent sources in the article. Only independent mention I could find is:

  • McC. Haworth, Guy; Rusz, Á. (2012). "Position Criticality in Chess Endgames". In Jaap van den Herik, H.; Plat, Aske (eds.). Advances in Computer Science. pp. 252–255.

It only discusses a specific chess algorithm that uses Starchess as a test case, most of the four pages are just a list of lines discovered by the algorithm. Likely not SIGCOV, and certainly not enough for it to meet WP:GNG Chaotic Enby (talk · contribs) 02:17, 20 January 2025 (UTC)[reply]

Relisted to generate a more thorough discussion and clearer consensus.
Please add new comments below this notice. Thanks, plicit 12:38, 27 January 2025 (UTC)[reply]

Speedy Redirect back to Hexagonal chess#Starchess. This article was originally just a redirect to this ___location, and this entire article is what is already found in the article. No need for it to be its own article. Chew(VTE) 00:21, 28 January 2025 (UTC)[reply]
Merge back to Hexagonal chess#Starchess per Chew -Samoht27 (talk) 18:13, 3 February 2025 (UTC)[reply]
The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.