Calculate the number of solutions to place n queens on an n*n chess board, without any queen attacking each other. Options allow using rooks instead of queens, disabling knight attacks and setting the minimum distance between queens.

Features

  • This project is written in Java.
  • Web interface uses Google Web Toolkit (GWT).

Project Activity

See All Activity >

Categories

Board Games, Mathematics, Chess Games

License

GNU General Public License version 2.0 (GPLv2)

Follow Chess Queens

Chess Queens Web Site

Other Useful Business Software
Enterprise-grade ITSM, for every business Icon
Enterprise-grade ITSM, for every business

Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
Try it Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Chess Queens!

Additional Project Details

Languages

English

Intended Audience

Developers, Science/Research

User Interface

Web-based

Programming Language

Java

Related Categories

Java Board Games, Java Mathematics Software, Java Chess Games

Registered

2010-11-29
Report inappropriate content