<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Breadth First on rostrum.blog</title>
    <link>https://www.rostrum.blog/tags/breadth-first/</link>
    <description>Recent content in Breadth First on rostrum.blog</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-gb</language>
    <lastBuildDate>Fri, 10 Jun 2022 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="https://www.rostrum.blog/tags/breadth-first/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>Automated pathfinding in {r.oguelike}</title>
      <link>https://www.rostrum.blog/2022/06/10/basic-search/</link>
      <pubDate>Fri, 10 Jun 2022 00:00:00 +0000</pubDate>
      
      <guid>https://www.rostrum.blog/2022/06/10/basic-search/</guid>
      <description>The enemy E chases the player @ who collects gold $ and and an apple a  tl;dr I’ve experimented with simple breadth-first search for {r.oguelike}, a work-in-progress game-in-a-package for R. This means enemies can pathfind and chase down the player character.
 Hunting the hunter I’ve written before about the inception of {r.oguelike}, a concept for a roguelike game written in R, along with a simple method for creating procedural tile-based cave-like dungeons.</description>
    </item>
    
  </channel>
</rss>