diff --git a/src/pages/solve/SharpSAT.tsx b/src/pages/solve/SharpSAT.tsx
new file mode 100644
index 0000000..66cfb23
--- /dev/null
+++ b/src/pages/solve/SharpSAT.tsx
@@ -0,0 +1,50 @@
+import { Divider, Heading, Spacer, Text } from "@chakra-ui/react";
+import type { NextPage } from "next";
+import { useState } from "react";
+import { Layout } from "../../components/layout/Layout";
+import { SAT_language } from "../../components/solvers/SAT/prism-SAT";
+import { SolverConfiguration } from "../../components/solvers/SolverConfiguration";
+import { TextInputMask } from "../../components/solvers/TextInputMask";
+import { LogicalExpressionValidator } from "../../converter/dimacs/LogicalExpressionValidator";
+
+const SharpSAT: NextPage = () => {
+  const logicalExpressionValidator = new LogicalExpressionValidator();
+
+  const [logicalExpressionString, setLogicalExpressionString] = useState("");
+
+  return (
+    <Layout>
+      <Heading as="h1">sharpSAT Solver</Heading>
+      <Text color="text" align="justify">
+        For a given Boolean formula, this algorithm counts the number of satisfying assignments.
+        You can enter any Boolean formula with any number of variables and combine them using Boolean operators
+        (i.e., &quot;and&quot;, &quot;or&quot; and &quot;not&quot;).
+      </Text>
+
+      <Spacer />
+
+      <TextInputMask
+        textPlaceholder='Try "a and (not a or not b)"'
+        text={logicalExpressionString}
+        setText={setLogicalExpressionString}
+        problemTypeId="sharpsat"
+        grammar={{
+          grammar: SAT_language,
+          language: "SAT_language",
+        }}
+        validate={(text) =>
+          logicalExpressionValidator.validateLogicalExpression(text)
+        }
+      />
+
+      <Divider />
+
+      <SolverConfiguration
+        problemTypeId="sharpsat"
+        problemInput={logicalExpressionString}
+      />
+    </Layout>
+  );
+};
+
+export default SharpSAT;