• DocumentCode
    2763921
  • Title

    Junior Researcher: a discovery system that can solve the N queens problems (N⩾4) on a constant computational complexity

  • Author

    Gao, Q.S. ; Hou, S.J.

  • Author_Institution
    Sch. of Comput. Sci., Tech. Univ. of Nova Scotia, Halifax, NS, Canada
  • fYear
    1990
  • fDate
    22-25 Oct 1990
  • Firstpage
    345
  • Lastpage
    347
  • Abstract
    An approach that uses the discovery system Junior Researcher to solve the N-queens problems (N⩾4) is proposed. The functions, structure and features of Junior Researcher are described. A constant-complexity algorithm for solving the problem is then given
  • Keywords
    computational complexity; games of skill; logic programming; search problems; Junior Researcher; N queens problems; Prolog; computational complexity; discovery system; logic programming; Computational complexity; Computer science; Equations; Global Positioning System; Polynomials; Problem-solving; Supercomputers; Transforms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)
  • Conference_Location
    Jerusalem
  • Print_ISBN
    0-8186-2078-1
  • Type

    conf

  • DOI
    10.1109/JCIT.1990.128303
  • Filename
    128303
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2763921