[{"data":1,"prerenderedAt":82},["ShallowReactive",2],{"$fS4X4JqOwpWEwMWJYw47EomwY3RdmWIetdUugdVuDq2g":3,"home-posts":20,"home-algos":24},[4,8,12,16],{"id":5,"name":6,"slug":7},1,"Game","game",{"id":9,"name":10,"slug":11},2,"Âm Nhạc","am-nhac",{"id":13,"name":14,"slug":15},3,"Sách","sach",{"id":17,"name":18,"slug":19},4,"Thuật toán","thuat-toan",{"items":21,"page":22,"size":23,"total":22,"totalPages":22},[],0,6,{"items":25,"page":22,"size":23,"total":81,"totalPages":13},[26,38,47,56,65,73],{"id":27,"title":28,"slug":29,"excerpt":30,"content":31,"coverImage":32,"status":33,"viewCount":22,"likeCount":22,"shareCount":22,"categoryId":17,"authorId":5,"publishedAt":34,"isPinned":35,"createdAt":36,"updatedAt":36,"category":37},51,"Neural Network (MLP)","neural-network","Kiến trúc não người: Hàng ngàn nơ-ron liên kết nhau để bẻ cong không gian và giải bài toán khó nhất.","Mô phỏng thuật toán Neural Network (MLP)","https:\u002F\u002Fpicsum.photos\u002Fseed\u002Fneural-network\u002F800\u002F400","PUBLISHED",null,false,"2026-04-06T00:25:17+07:00",{"id":17,"name":18,"slug":19},{"id":39,"title":40,"slug":41,"excerpt":42,"content":43,"coverImage":44,"status":33,"viewCount":5,"likeCount":22,"shareCount":22,"categoryId":17,"authorId":5,"publishedAt":34,"isPinned":35,"createdAt":36,"updatedAt":45,"category":46},48,"A* Search Algorithm","a-star","Sự kết hợp hoàn hảo giữa thuật toán loang (Dijkstra) và một cái mũi thính (Heuristic) để tìm đường cực nhanh.","Mô phỏng thuật toán A* Search Algorithm","https:\u002F\u002Fpicsum.photos\u002Fseed\u002Fa-star\u002F800\u002F400","2026-04-06T00:28:19+07:00",{"id":17,"name":18,"slug":19},{"id":48,"title":49,"slug":50,"excerpt":51,"content":52,"coverImage":53,"status":33,"viewCount":5,"likeCount":22,"shareCount":22,"categoryId":17,"authorId":5,"publishedAt":34,"isPinned":35,"createdAt":36,"updatedAt":54,"category":55},49,"DBSCAN Clustering","dbscan","Phân cụm theo mật độ: Hoạt động như sự lây lan vi khuẩn để phát hiện các khu vực dữ liệu dị dạng.","Mô phỏng thuật toán DBSCAN Clustering","https:\u002F\u002Fpicsum.photos\u002Fseed\u002Fdbscan\u002F800\u002F400","2026-04-06T01:15:31+07:00",{"id":17,"name":18,"slug":19},{"id":57,"title":58,"slug":59,"excerpt":60,"content":61,"coverImage":62,"status":33,"viewCount":5,"likeCount":22,"shareCount":22,"categoryId":17,"authorId":5,"publishedAt":34,"isPinned":35,"createdAt":36,"updatedAt":63,"category":64},50,"Decision Tree","decision-tree","Chia để trị: Mô phỏng não bộ phân loại đối tượng bằng hệ thống câu hỏi Có\u002FKhông.","Mô phỏng thuật toán Decision Tree","https:\u002F\u002Fpicsum.photos\u002Fseed\u002Fdecision-tree\u002F800\u002F400","2026-04-06T00:43:52+07:00",{"id":17,"name":18,"slug":19},{"id":66,"title":67,"slug":68,"excerpt":69,"content":70,"coverImage":71,"status":33,"viewCount":22,"likeCount":22,"shareCount":22,"categoryId":17,"authorId":5,"publishedAt":34,"isPinned":35,"createdAt":36,"updatedAt":36,"category":72},53,"Minimax (Tic-Tac-Toe)","minimax","AI bất bại: Chiếc máy tính đọc trước tương lai hàng vạn bước để đánh cờ với con người.","Mô phỏng thuật toán Minimax (Tic-Tac-Toe)","https:\u002F\u002Fpicsum.photos\u002Fseed\u002Fminimax\u002F800\u002F400",{"id":17,"name":18,"slug":19},{"id":74,"title":75,"slug":76,"excerpt":77,"content":78,"coverImage":79,"status":33,"viewCount":22,"likeCount":22,"shareCount":22,"categoryId":17,"authorId":5,"publishedAt":34,"isPinned":35,"createdAt":36,"updatedAt":36,"category":80},54,"Q-Learning","q-learning","Cây gậy và Củ cà rốt: Robot tự học cách đi trong mê cung thông qua phần thưởng và hình phạt.","Mô phỏng thuật toán Q-Learning","https:\u002F\u002Fpicsum.photos\u002Fseed\u002Fq-learning\u002F800\u002F400",{"id":17,"name":18,"slug":19},16,1775442677450]