mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-21 02:53:15 +08:00
Remove unnecessary code (#4141)
This commit is contained in:
@ -187,13 +187,11 @@ public class MonteCarloTreeSearch {
|
||||
System.out.println("N.\tScore\t\tVisits");
|
||||
|
||||
for (int i = 0; i < rootNode.childNodes.size(); i++) {
|
||||
System.out.println(
|
||||
String.format(
|
||||
"%02d\t%d\t\t%d",
|
||||
System.out.printf(
|
||||
"%02d\t%d\t\t%d%n",
|
||||
i + 1,
|
||||
rootNode.childNodes.get(i).score,
|
||||
rootNode.childNodes.get(i).visitCount
|
||||
)
|
||||
);
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user