From charlesreid1

Revision as of 07:08, 16 February 2018 by Admin (talk | contribs)

Here's what we're doing:

  • Running CPU intensive code
  • cpu, memory, threads, file size
  • where in structure, depth, iterations, etc.

N queens problem:

  • searching for number of ways to arrange n queens on the chessboard
  • code instrumentation: current portion of tree (vector of queen placements), number of solutions found
  • profiling: netdata on host machine