Solving the ( n 2 − 1 ) -Puzzle with 8 3 n 3 Expected Moves

Author： Parberry Ian  

Publisher： MDPI

E-ISSN： 1999-4893|8|3|459-465

ISSN： 1999-4893

Source： Algorithms, Vol.8, Iss.3, 2015-07, pp. : 459-465

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An Extended Detailed Investigation of First and Second Order Supersymmetries for Off-Shell N=2 and N=4 Supermultiplets

By Gates Sylvester James   Parker James   Rodgers Vincent G. J.   Rodriguez Leo   Stiffler Kory  

Symmetry, Vol. 7, Iss. 2, 2015-06 ,pp. : 1080-1121

MDPI

Access to resources Recommend Favorite

N = (4,4) Supersymmetry and T-Duality

By Göteman Malin  

Symmetry, Vol. 4, Iss. 4, 2012-10 ,pp. : 603-625

MDPI

Access to resources Recommend Favorite

Neutrosophic Positive Implicative N -Ideals in BCK-Algebras

By Jun Young Bae   Smarandache Florentin   Song Seok-Zun   Khan Madad  

Axioms, Vol. 7, Iss. 1, 2018-01 ,pp. : 3-3

MDPI

Access to resources Recommend Favorite

An O(n)-Round Strategy for the Magnus-Derek Game

By Nedev Zhivko  

Algorithms, Vol. 3, Iss. 3, 2010-07 ,pp. : 244-254

MDPI

Access to resources Recommend Favorite

Soliton and Similarity Solutions of N = 2,4 Supersymmetric Equations

By Delisle Laurent   Hussin Véronique  

Symmetry, Vol. 4, Iss. 3, 2012-08 ,pp. : 441-451

MDPI

Access to resources Recommend Favorite