Skip to content

Latest commit

 

History

History
9 lines (7 loc) · 497 Bytes

README.md

File metadata and controls

9 lines (7 loc) · 497 Bytes

Queens / 八皇后 + 位运算

This repository contains the slides and programs I used in the BitTiger lecture on 10/05/2016. In this lecture, I wrote 5 programs to solve the n-queens problem, each one faster than the previous. Bit operations played a key role in enabling the acceleration.

这里是我在2016年10月5日的BitTiger讲座上使用的PPT和代码。 在此次讲座中,我介绍了n皇后问题的五种越来越快的解法。 位运算对提高速度起了关键作用。