sarrufat / ang-games

This application is an attempt to find a general algorithm for solving a kind of mathematical chess problem known as “independence problem”, such as the Eight Queen puzzle. This algorithm tries to discover how many possible solutions exist.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

ang-games

Angular / Go sample application. Implemented using go-kit framework. Micro service architecture using metrics - Prometheus and Grafana.

In previous versions a recursive algorithm implemented in Scala was used. The same algorithm has been implemented in Go. The performance improvement has been an order of magnitude amazingly.

Chess Problem

This application is an attempt to find a general algorithm for solving a kind of mathematical chess problem known as “independence problem”, such as the Eight Queen puzzle. This algorithm tries to discover how many possible solutions exist.

The problem consists on finding all unique configurations of a set of normal chess pieces on a chess board with dimensions M×N where none of the pieces is in a position to take any of the others. The colour of the pieces doesn't matter, and there are no pawns among the pieces.

About

This application is an attempt to find a general algorithm for solving a kind of mathematical chess problem known as “independence problem”, such as the Eight Queen puzzle. This algorithm tries to discover how many possible solutions exist.


Languages

Language:Go 44.6%Language:TypeScript 40.5%Language:HTML 8.9%Language:JavaScript 3.5%Language:Dockerfile 1.8%Language:SCSS 0.7%