diff --git a/vnrhook/util/util.cc b/vnrhook/util/util.cc
index 5a499f9..529c568 100644
--- a/vnrhook/util/util.cc
+++ b/vnrhook/util/util.cc
@@ -3,8 +3,11 @@
 // Branch: ITH_Engine/engine.cpp, revision 133
 // See: http://ja.wikipedia.org/wiki/プロジェクト:美少女ゲーム系/ゲームエンジン
 
+#include "common.h"
 #include "util/util.h"
 #include "ithsys/ithsys.h"
+#include "main.h"
+#include "growl.h"
 
 namespace { // unnamed
 
@@ -281,4 +284,33 @@ bool Util::SearchResourceString(LPCWSTR str)
   return false;
 }
 
+DWORD Util::SearchMemory(const BYTE* bytes, unsigned short length, DWORD protect)
+{
+	std::vector<std::pair<DWORD, DWORD>> validMemory;
+	for (BYTE* probe = NULL; (DWORD)probe < 0x80000000;) // end of user memory space
+	{
+		MEMORY_BASIC_INFORMATION info = {};
+		if (!VirtualQuery(probe, &info, sizeof(info)))
+		{
+			probe += 0x1000;
+			continue;
+		}
+		else
+		{
+			if (info.Protect > protect && !(info.Protect & PAGE_GUARD)) validMemory.push_back({ (DWORD)info.BaseAddress, info.RegionSize });
+			probe += info.RegionSize;
+		}
+	}
+
+	for (auto memory : validMemory)
+		// Artikash 7/14/2018: not sure, but I think this could throw read access violation if I dont subtract search_length
+		for (int i = 0; i < memory.second - length; ++i)
+			for (int j = 0; j <= length; ++j)
+				if (j == length) return memory.first + i; // not sure about this algorithm...
+				else if (*((BYTE*)memory.first + i + j) != *(bytes + j) && *(bytes + j) != 0x11) break; // 0x11 = wildcard
+
+
+	return 0;
+}
+
 // EOF
diff --git a/vnrhook/util/util.h b/vnrhook/util/util.h
index 2788d87..1586c69 100644
--- a/vnrhook/util/util.h
+++ b/vnrhook/util/util.h
@@ -22,6 +22,8 @@ bool CheckFile(LPCWSTR name);
 
 bool SearchResourceString(LPCWSTR str);
 
+DWORD SearchMemory(const BYTE* bytes, unsigned short length, DWORD protect = PAGE_EXECUTE);
+
 } // namespace Util
 
 // EOF