Identifying Nash equilibria in extensive form game Is there a systematic way of identifying all (pure strategy) Nash equilibria (not just the subgame perfect ones) in an extensive form game? In the following Entrant v Resident example, there are three NEs, two of which ($(OF,F),(OA,F)$) are not subgame perfect. What I've been doing is to convert the extensive form to normal form, and then find NEs there. While reliable, this method is time consuming, and gets complicated as the number of actions/players increases. For example, I suspect that it'd be much easier to spot NEs in a four-player extensive game (each with two action, say) than its normal form equivalent. 

I'd be interested to know if there's any procedure that we can use to find pure NEs in a reasonably simple extensive form game.
As far as I know, No. 

While I am not sure why you would want to find non-subgame perfect Nash equilibria in an extensive form game, I am sure you would need to convert it to normal form to do it. Extensive form of a sequential game carries more information than normal form, specifically which moves do not exist within the sequence. In a normal form representation of the sequential game you have to show every possible move available to every player, even the moves that do not exist. So basically when you convert a sequential game from extensive form to normal form, it becomes another game where you then look for Nash equilibria. 

If you are doing a two player game where each player gets one move, you can do it in your head just by looking at the game tree, but if the game is any more complex, you would need to do it step by step, first converting it into a normal form.