#search algorithm

[agatedragongames]

Random Mouse Algorithm

The 'Random Mouse Algorithm' is the best maze solving algorithm in the universe. It uses less memory than other wasteful pathfinding algorithms like 'Breadth First Search' and 'A-star'. Since it picks a random node at every junction.

So there is no need for complicated containers like queues and stacks. The only downside, it's very slow… But it's guaranteed to find the goal (or cheese) eventually! It also won't find you the shortest path, but there is nothing wrong with taking the scenic route 🐭🧀

[numa-smells]

taking a break from computer science by doing some more computer science

[cimness]

It's just that Google's 2018 algorithm upgrade filters out news with the word "porn" in it. Like articles about porn performer suicide, tips for revenge porn victims, parents who oppose porn website age-verification (turns out, today's parents are more afraid of data collection than their kids watching porn). Stories with the word "porn" in them are important because they're about censorship, sexual health, business trends, sex work, politics, gender and women. They're about people. But not for the world's most popular search engine. Google's war on sex took root in 2011 when Google Plus launched with a strict no-sex policy. In 2013, the company enacted a porn purge across Blogger, and Android's Google Keyboard was updated to exclude more than1,400 "inappropriate" words, like "lovemaking," "condom," and "STI." In 2014 Google Play banned sex-themed apps, and an algorithm change in Search destroyed organic results for sex websites. That same year Google made changes to its AdWords policies to prohibit sex-related advertising.

How sex censorship killed the internet we love

[ultrachemicalgladiator]

Urgh, the photo quality is terrible, I need to figure out this studyblr stuff... Anyway, I picked a random topic to revise today, namely search algorithms for OCR A level computing. Not too difficult, just some pseudo code and maths. Essentially if your data is sorted, use binary search, if not, sort it then use binary search. (I guess linear search works in some cases). I only showed a recursive algorithm for binary search, since I prefer it. This is my first study post, please tell me what you think! Tips to improve the lighting would be much appreciated, or any other advice for that matter.

[cultureofresistance]

'If you flag or penalise some results, you effectively censor them'. You don’t have to delete something to make it disappear. When I raised this point at the Workshop on Digital Misinformation in April this year, it was met with a comment about this approach not being 'true censorship' because it doesn’t intentionally censor a particular group or ideology. The circumstances didn’t allow for a meaningful discussion at the time so I couldn’t respond (I was just an audience member asking a question after a presentation), but the technical definitions of censorship are largely unhelpful to the communities who feel like their voices are being suppressed by incredibly powerful multi-national companies who act as gate-keepers to all information on the Internet.

Shane Greenup, How to End Google’s Monopoly – Shane Greenup – Medium

[agatedragongames]

Pathfinder Search Algorithm Battle Royale

A-star (yellow) vs Breadth (green) vs Greedy (red) vs Depth (blue)

Four pathfinding search algorithms which start at different corners of a hexagon grid, looking for the same goal

[agatedragongames]

Learn how to explore a grid and find a goal point with breadth first search in this pathfinding tutorial. You will use Processing and Java to code the breadth first search pathfinding algorithm and create a graphical demo so you can see it in action.

In the last tutorial, we programmed depth first search and watched it explore a node graph. In this tutorial we will program breadth first search and watch it explore a grid.

The breadth first search algorithm will add every unexplored adjacent node to a queue, and explore all of the added nodes in sequence. For each node explored, it will continue to add the adjacent unexplored nodes to the queue. It will continue to do this until the goal is found or all connected nodes have been explored.

Pathfinding a Grid with Breadth First Search

Learn how to explore a grid and find a goal point with breadth first search in this pathfinding tutorial. You will use Processing and Java t

[agatedragongames]

Learn how to generate a hexagonal grid, create walls, connect the hexagonal cells and render the cells in this Processing tutorial, using the Java programming language.

Generating a Hexagonal Grid in Processing

Learn how to generate a hexagonal grid, create walls, connect the hexagonal cells and render the cells in this Processing tutorial, using th