Semi-Analytical Benchmarks for MCNP6
Code verification is an extremely important process that involves proving or disproving the validity of code algorithms by comparing them against analytical results of the underlying physics or mathematical theory on which the code is based upon. Monte Carlo transport codes such as MCNP6 undergo verification and testing upon every release to ensure that the codes are properly simulating nature. Specifically, MCNP6 has multiple sets of problems with known analytic solutions that are used for code verification. Most of the verification problems are fairly simple due to the fact that they are usually composed of few materials, with simplified cross-sections, or physics approximations, and simple geometry. These approximations make the transport equation possible to solve analytically or semi-analytically, and thus they are quite valuable in verifying that the code algorithms and methods (Monte Carlo, discrete ordinates, etc.) are operating as intended. The remainder of this paper is organized as follows: first we briefly discuss the theory behind the benchmarks problems, then the numerical results are presented, and finally we conclude with general remarks on this and possible future work.