diff --git a/fish/src/bot.rs b/fish/src/bot.rs
index 4b4ecf9..61f8d2b 100644
--- a/fish/src/bot.rs
+++ b/fish/src/bot.rs
@@ -16,7 +16,7 @@ use crate::bot::node::{Node, RawNodePtr};
 use crate::bot::trans::TransTable;
 use crate::eval::{features, Features, Weights};
 
-pub(crate) use bumpalo::Bump as Arena;
+use bumpalo::Bump as Arena;
 
 /// Encompasses an instance of the algorithm.
 pub struct Bot {
diff --git a/fish/src/bot/node.rs b/fish/src/bot/node.rs
index 6cd79aa..d6d764c 100644
--- a/fish/src/bot/node.rs
+++ b/fish/src/bot/node.rs
@@ -11,7 +11,7 @@ use crate::find::find_locations;
 
 /// Represents a node in the search tree. A node basically just consists of a board state
 /// (incl. queue) and some extra metadata relating it to previous nodes in the tree.
-pub(crate) struct Node {
+pub struct Node {
     matrix: *const Mat,
     queue: RawQueue,
     edge: Option<Edge>,
@@ -176,7 +176,7 @@ impl Edge {
 /// Wraps a raw pointer to a `Node`, requiring you to manage the lifetime yourself.
 #[derive(Copy, Clone, Eq, PartialEq, Hash, Debug)]
 #[repr(transparent)]
-pub(crate) struct RawNodePtr(*const Node);
+pub struct RawNodePtr(*const Node);
 
 impl RawNodePtr {
     pub unsafe fn as_node<'a>(self) -> &'a Node {
diff --git a/fish/src/bot/trans.rs b/fish/src/bot/trans.rs
index 4064f00..da9864f 100644
--- a/fish/src/bot/trans.rs
+++ b/fish/src/bot/trans.rs
@@ -8,7 +8,7 @@ use mino::Mat;
 use crate::bot::node::{Node, RawNodePtr};
 use crate::HashMap;
 
-pub(crate) struct TransTable {
+pub struct TransTable {
     lookup: HashMap<QueueKey, HashMap<RawMatPtr, RawNodePtr>>,
 }