The N-queens Problem in Python

A multi-thread enabled N-Queens benchmark for hardware running Python.

Mauro Riva

Following Follow project

Liked Like project

Become a Hackaday.io member

Just one more thing

To make the experience fit your profile, pick a username and tell us what interests you.

OK, I'm done! Skip

Similar projects worth following

253 views

0 comments

253 followers

0 likes

Description
Details
Files 0
Components 0
Logs 0
Instructions 4
- View all
Discussion 0

View Gallery

Description

The N-Queens benchmark solves the combinatorially hard chess problem of placing N queens on an chessboard such that no queen can attack any other.

This code written in Python allows testing your hardware performance resolving a mathematical problem. I programmed this code especially to test the performance of embedded hardware running Python (Raspberry Pi, Docker in Raspberry Pi, Beagleboard, Beaglebone). There are a lot of benchmark everywhere e.g. Whetstone, Dhrystone, SysBench CPU, Linpack etc. but none of these can resolve a mathematical problem and also test the performance of the hardware using Python. This code does it.

Build Instructions

Collapse

1

Install Python in your (Embedded) Hardware

Follow the instructions https://www.python.org/getit/
2

Clone or Download the "N-Queens Problem" repository

You can find the repository here: https://github.com/lemariva/N-Queens-Problem
3

Temperature

The repository includes a file "temperature.py". This is coded to get the temperature (CPU & GPU) of a Raspberry Pi. If you are not using a Raspberry Pi, you need to modify this file to get the hardware temperature or just delete it.

View all 4 instructions

The N-queens Problem in Python

Become a Hackaday.io member

Just one more thing

Description

Build Instructions Collapse

Enjoy this project?

Discussions

Become a Hackaday.io Member

Does this project spark your interest?

Report project as inappropriate

Send message

Remove Member

Build Instructions

Collapse