A bipartite graph on \(2n\) vertices is called bipancyclic if it contains cycles of every length from \(4\) to \(2n\). In this paper we address the question: what is the minimum number of edges in a bipancyclic graph? We present a simple analysis of some small orders using chord patterns.