Editing SameGame (section)

==History==
''SameGame'' was originally created as ''Chain Shot!'' in 1985 by Kuniaki Moribe. It was distributed for [[Fujitsu]]'s [[FM-8]] and [[FM-7]] platforms in a Japanese monthly [[personal computer]] magazine called ''[[List of magazines published by ASCII Media Works|Gekkan ASCII]]''. In 1992, the game was ported as ''SameGame'' to [[Unix]] platforms by Eiji Fukumoto, to the NEC [[PC-9801]] series by Wataru Yoshioka, and to Macintosh as ''ChainShot!'' by Eiichiro Mawatari.<ref>{{Cite web |title=ChainShotの詳細情報 : Vector ソフトを探す！ |url=https://www.vector.co.jp/soft/mac/game/se034256.html |access-date=2023-05-09 |website=www.vector.co.jp}}</ref> In 1993, it was ported to [[Windows 3.1]] by Ikuo Hirohata. This version was translated into English by Hitoshi Ozawa, and is still available from his software archive.<ref>{{cite web
	| url = http://www.nurs.or.jp/~h_ozawa/english/soft/free/game.html
	| title = ISOFT - Home of Japanese software
	| last = Ozawa
	| first = Hitoshi
	| access-date = 2010-11-28
	| archive-date = 2011-07-18
	| archive-url = https://web.archive.org/web/20110718030814/http://www.nurs.or.jp/~h_ozawa/english/soft/free/game.html
	| url-status = dead
	}}</ref>
In 1994, Takahiro Sumiya ported it to [[Classic Mac OS|Macintosh]]. This version has some gameplay differences—a choice of between two and five colors—and is probably the most widely distributed of the original series. It was the basis for the ''Same Gnome'' and ''KSame'' variations created for [[Linux]].

In 2001, Biedl et al. proved that [[Decision problem|deciding]] the solvability (whether all blocks can be removed) of 1-column (or 1-row) 2-colour Clickomania can be done in [[linear time]]. Deciding the solvability of 2-column, 5-colour Clickomania is [[NP-complete]]. Deciding the solvability of 5-column 3-colour Clickomania is also NP-complete.<ref>{{cite journal|last1=Biedl|first1=Therese|author1-link=Therese Biedl|last2=Demaine|first2=Erik|author2-link=Erik Demaine|title=The Complexity of Clickomania|journal=More Games of No Chance|date=2001|arxiv=cs/0107031|bibcode=2001cs........7031B}}</ref> Follow-up work in 2015 by Adler et al. proved that deciding the solvability of Clickomania is hard even in the 2-column 2-colour case, as well as [[parameterized complexity]] results on determining whether an instance of size ''n'' is solvable in ''k'' or fewer clicks.<ref>{{cite conference |url=https://erikdemaine.org/papers/Clickomania_MOVES2015/paper.pdf |title=Clickomania is Hard, even with 2 Colors and Columns |year=2015 |conference=The Mathematics of Various Entertaining Subjects (MOVES) |conference-url=https://momath.org/moves-conference/}}</ref>